论文信息 - An Architecture for Full Text Retrieval Systems

An Architecture for Full Text Retrieval Systems

A novel architecture for full-text information retrieval systems is described. The architecture’s most distinctive feature is a server that is implemented as an interpreter for a lazily evaluated functional programming language. The consequences of this approach for time and space performance are discussed, concentrating especially on the functionality provided for searching for occurrences of words in textual databases.

[1] DONALD MICHIE,et al. “Memo” Functions and Machine Learning , 1968, Nature.

[2] Peter Henderson,et al. A lazy evaluator , 1976, POPL.

[3] Donna K. Harman,et al. IRX: an information retrieval system for experimentation and user applications , 1988, SIGF.

[4] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[5] D. A. Turner. Another Algorithm for Bracket Abstraction , 1979, J. Symb. Log..

[6] Shmuel Tomi Klein,et al. Improved hierarchical bit-vector compression in document retrieval systems , 1986, SIGIR '86.