TL;DR
This paper introduces a method to enable anytime query processing on document-ordered indexes, allowing for strict latency control and improved search efficiency, which is crucial for operational SLA compliance.
Contribution
It presents a novel organization of document-ordered indexes that supports anytime querying, outperforming existing algorithms in controlling query runtime and latency.
Findings
Processing document-ordered segments improves runtime control.
The proposed method outperforms existing anytime algorithms.
Query runtimes can be accurately limited to meet SLA requirements.
Abstract
Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections. While there are a number of possible organizations, document-ordered indexes are the most common, since they are amenable to various query types, support index updates, and allow for efficient dynamic pruning operations. One disadvantage with document-ordered indexes is that high-scoring documents can be distributed across the document identifier space, meaning that index traversal algorithms that terminate early might put search effectiveness at risk. The alternative is impact-ordered indexes, which primarily support top-k disjunctions, but also allow for anytime query processing, where the search can be terminated at any time, with search quality improving as processing latency increases. Anytime query processing can be used to effectively reduce…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Methodstravel james · Pruning
