The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Inverted files versus signature files for text indexing
Open accessAbstract
Two well-known indexing methods are inverted files and signature files. We have undertaken a detailed comparison of these two approaches in the context of text indexing, paying particular attention to query evaluation speed and space requirements. We have examined their relative performance using both experimentation and a refined approach to modeling of signature files, and demonstrate that inverted files are distinctly superior to signature files. Not only can inverted files be used to evaluate typical queries in less time than can signature files, but inverted files require less space and provide greater functionality. Our results also show that a synthetic text database can provide a realistic indication of the behavior of an actual text database. The tools used to generate the synthetic database have been made publicly available
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
Development of a Stemming Algorithm
Lovins, J. B. (1968) · Mech. Transl. Comput. Linguistics · Cited by 1,115
Extended Boolean information retrieval
Salton, G., Fox, E. A., & Wu, H. (1983) · Communications of the ACM · doi:10.1145/182.358466 · Cited by 1,054
Run-length encodings (Corresp.)
Golomb, S. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053907 · Cited by 988
Managing Gigabytes: Compressing and Indexing Documents and Images
Witten, I. H., Moffat, A., & Bell, T. C. (1995) · IEEE Transactions on Information Theory · doi:10.1109/tit.1995.476344 · Cited by 726
Self-citationManaging gigabytes (2nd ed.): compressing and indexing documents and images
Witten, I. H., Moffat, A., & Bell, T. (1999) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 705
Self-citationProceedings of the International Conference on Very Large Data Bases
Kerr, D. S. (1975) · ACM eBooks · Cited by 701
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586 · cited 2×
“Because there is a vocabulary it is possible to support queries on stems, patterns, and substrings [Hall and Dowling 1980].”
BackgroundSelf-indexing inverted files for fast text retrieval
Moffat, A., & Zobel, J. (1996) · ACM Transactions on Information Systems · doi:10.1145/237496.237497 · Cited by 361
Self-citationAnalysis and performance of inverted data base structures
Cárdenas, A. F. (1975) · Communications of the ACM · doi:10.1145/360762.360766 · Cited by 306
GLIMPSE: a tool to search through entire file systems
Manber, U., & Wu, S. (1994) · USENIX Winter Technical Conference · Cited by 251
Retrieving records from a gigabyte of text on a minicomputer using statistical ranking
Harman, D. K., & Candela, G. T. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199012)41:8<581::aid-asi4>3.0.co;2-u · Cited by 129
Implementing ranking strategies using text signatures
Croft, W. B., & Savino, P. (1988) · ACM Transactions on Information Systems · doi:10.1145/42279.45947 · Cited by 58
Cited by
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Self-citationCompressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Grossi, R., & Vitter, J. S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402354 · Cited by 431
Evaluation of GIST descriptors for web-scale image search
Douze, M., Jégou, H., Sandhawalia, H., Amsaleg, L., & Schmid, C. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646421 · Cited by 394
Large Language Models for Information Retrieval: A Survey
Zhu, Y., Yuan, H., Wang, S., Liu, J., Liu, W., Deng, C., Chen, H., Liu, Z., Dou, Z., & Wen, J.-R. (2026) · ACM Transactions on Information Systems · doi:10.1145/3748304 · Cited by 225
Metadata
- Authors
- Zobel, J., Moffat, A., & Ramamohanarao, K.
- Venue
- ACM Transactions on Database Systems
- Published
- 1998-12
- Volume
- 23
- Issue
- 4
- Pages
- 453-490
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2163652601
- Cited by
- 341
- References
- 15
- FWCI
- 6.13
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.