Efficient In-Memory Inverted Indexes: Theory and Practice
Inverted indexes are the backbone of most large-scale information retrieval systems. Although conceptually simple, high-performance inverted indexes require a deep understanding of low-level system optimizations, compression techniques, and traversal strategies. With the widespread adoption of in-memory search engines, the rise of learned sparse retrieval (LSR), and the increasing complexity of ranking pipelines, the design space for efficient indexing and retrieval systems has expanded significantly.
Authors
- Antonio Mallia (ORCID: https://orcid.org/0000-0002-7817-6140)
- Sean MacAvaney (ORCID: https://orcid.org/0000-0002-8914-2659)
- Michał Siedlaczek (ORCID: https://orcid.org/0000-0002-9168-0851)
- Joel Mackenzie (ORCID: https://orcid.org/0000-0001-7992-4633)
Institutions
- The University of Queensland (AU)
- University of Glasgow (GB)
Publication Details
- Published
- 2025-07-13
- DOI
- https://doi.org/10.1145/3726302.3731688
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00