论文信息 - Fast Inverted Indexes with On-Line Update

Fast Inverted Indexes with On-Line Update

We describe data structures and an update strategy for the practical implementation of inverted indexes The context of our discussion is the construction of a dedi cated index engine for a distributed full text information retrieval system but the results have wider application Retrieval operations require a single disk access per query term The on line update strategy guarantees the con sistency of on disk data structures Index compression

Charles L. A. Clarke | Forbes J. Burkowski | Gordon V. Cormack

[1] Peter Weiss,et al. Size reduction of inverted files using data compression and data structure reorganization , 1990 .

[2] William Pugh,et al. Concurrent maintenance of skip lists , 1990 .

[3] Forbes J. Burkowski. Surrogate subsets: a free space management strategy for the index of a text retrieval system , 1989, SIGIR '90.

[4] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[5] Charles L. A. Clarke,et al. An Algebra for Structured Text Search and a Framework for its Implementation , 1995, Comput. J..

[6] Gerard Salton,et al. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

[7] Forbes J. Burkowski. Retrieval performance of a distributed text database utilizing a parallel processor document server , 1990, DPDS '90.

[8] Hector Garcia-Molina,et al. Performance of inverted indices in shared-nothing distributed text document information retrieval systems , 1993, [1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems.

[9] Ricardo Baeza-Yates,et al. Information Retrieval: Data Structures and Algorithms , 1992 .

[10] Christos Faloutsos,et al. Access methods for text , 1985, CSUR.

[11] Jan O. Pedersen,et al. Optimization for dynamic inverted index maintenance , 1989, SIGIR '90.

[12] Steven P. Wartik. Boolean Operations , 1992, Information Retrieval: Data Structures & Algorithms.