The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Inverted index compression and query processing with optimized document ordering
Abstract
Web search engines use highly optimized compression schemes to decrease inverted index size and improve query throughput, and many index compression techniques have been studied in the literature. One approach taken by several recent studies first performs a renumbering of the document IDs in the collection that groups similar documents together, and then applies standard compression techniques. It is known that this can significantly improve index compression compared to a random document ordering. We study index compression and query processing techniques for such reordered indexes. Previous work has focused on determining the best possible ordering of documents. In contrast, we assume that such an ordering is already given, and focus on how to optimize compression methods and query processing for this case. We perform an extensive study of compression techniques for document IDs and present new optimizations of existing techniques which can achieve significant improvement in both compression and decompression performances. We also propose and evaluate techniques for compressing frequency values for this case. Finally, we study the effect of this approach on query processing performance. Our experiments show very significant improvements in index size and query processing speed on the TREC GOV2 collection of 25.2 million web pages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
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
Managing 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
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
Super-Scalar RAM-CPU Cache Compression
Zukowski, M., Heman, S., Nes, N., & Boncz, P. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.150 · Cited by 476
Efficient query evaluation using a two-level retrieval process
Broder, A. Z., Carmel, D., Herscovici, M., Soffer, A., & Zien, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956944 · Cited by 407
Performance of compressed inverted list caching in search engines
Zhang, J., Long, X., & Suel, T. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367550 · Cited by 230
Self-citationBeyond PageRank: machine learning for static ranking
Richardson, M., Prakash, A., & Brill, E. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135881 · Cited by 169
Optimized Query Execution in Large Search Engines with Global Page Ordering
Long, X., & Suel, T. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50020-3 · Cited by 109
Self-citation
Cited by
Batch query processing for web search engines
Ding, S., Attenberg, J., Baeza-Yates, R., & Suel, T. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935858 · Cited by 22
Self-citation
Metadata
- Authors
- Yan, H., Ding, S., & Suel, T.
- Venue
- Proceedings of the 18th international conference on World wide web
- Publisher
- ACM
- Published
- 2009-04-20
- Pages
- 401-410
- OpenAlex
- W2152437528
- Cited by
- 275
- References
- 17
- FWCI
- 17.39
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Inverted index compression and query processing with optimized document ordering. https://app.cochat.ai/papers/10.1145/1526709.1526764
- The paper
- Yan, H., Ding, S., & Suel, T. (2009). Inverted index compression and query processing with optimized document ordering. Proceedings of the 18th international conference on World wide web. https://doi.org/10.1145/1526709.1526764
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.