An Architecture for Full Text Retrieval Systems

  • Scott C. Deerwester
  • Donald A. Ziff
  • Keith Waclena


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.


Retrieval System Word Type Information Retrieval System Conjunctive Search Functional Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Augustsson L. “Small”, Chalmers University Computer Science Technical Report; (detailed reference unavailable).Google Scholar
  2. [2]
    Augustsson L. Private communication, 1989.Google Scholar
  3. [3]
    Choueka Y., A.S. Fraenkel and S.T. Klein. “Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems,” Proceedings 9th ACM-SIGIR Conference, 1986, pp. 88–97.Google Scholar
  4. [4]
    Choueka Y. “Responsa: An operational full-text retrieval system with linguistic components for large corpora,” 1989.Google Scholar
  5. [5]
    Friedman D. P. and D. S. Wise. “CONS Should Not Evaluate its Arguments”, Proceedings 3rd International Colloquium on Automata Languages and Programming, 1976.Google Scholar
  6. [6]
    Goldstein C. “Full Text Retrieval from Structured Text,” Bulletin of the American Society for Information Science,August/September 1989, p. 11.Google Scholar
  7. [7]
    Harman D., D. Benson, L. Fitzpatrick, R. Huntzinger, and C. Goldstein. “IRX: An Information Retrieval System for Experimentation and User Applications,” in RIAO 88 Conference Proceedings, vol. 2, Cambridge, MA, 1988.Google Scholar
  8. [8]
    Henderson P., and J. M. Morris, “A Lazy Evaluator”, Proceedings 3rd Symposium on Principles of Programming Languages, 1976.Google Scholar
  9. [9]
    Lesk M.E. “Some Applications of Inverted Indexes on the UNIX System,” in UNIX User’s Manual: Supplementary Documents, 1984.Google Scholar
  10. [10]
    Lesk M.E. “GRAB Inverted Indices with Low Storage Overhead”, Computing Systems, v. 1, pp. 207–220, 1988.Google Scholar
  11. [11]
    Mitchie D. “Memo” Functions and Machine Learning,“ Nature, v. 218, pp 19–22.Google Scholar
  12. [12]
    Morrissey R. and C. del Vigna. “A Large Natural Language Data Base”, Educom, 1983.Google Scholar
  13. [13]
    Smith J. “MicroARRAS,” Proceedings of RIAD ’88, v. I, Cambridge, 1988.Google Scholar
  14. [14]
    Turner D.A. “Another Algorithm for Bracket Abstraction,” The Journal of Symbolic Logic, June 1979, v. 44, n. 2, pp. 267–270.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1990

Authors and Affiliations

  • Scott C. Deerwester
    • 1
  • Donald A. Ziff
    • 1
  • Keith Waclena
    • 1
  1. 1.University of ChicagoUSA

Personalised recommendations