Inverted Files for Text Search Engines.¶
Zobel, J., & Moffat, A. (2006). Inverted Files for Text Search Engines. ACM Computing Surveys, 38(2).
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Index
- The intervention catalog carries portable moves. Add an index for a slow query you can name a key for, and remove indexes that pay maintenance for queries no one asks. Composite-key indexes match composite questions (last name plus first name, latitude plus longitude). Inverted indexes invert the natural key-to-location: instead of "for each row, which terms?", store "for each term, which rows?" — the move that made full-text search tractable, and the same move behind citation indexes and reverse lookups.
This sourceThe inverted index ('for each term, which documents?') that makes full-text search tractable — the same key-to-location inversion behind citation indexes and reverse lookups.
Supported in partVerified against the publisher's abstract
Title and abstract place inverted files at the core of text search engines, but neither the abstract nor the metadata states the key-to-location inversion or the citation-index comparison.
“The technology underlying text search engines has advanced dramatically in the past decade. The development of a family of new index representations has led to a wide range of innovations in index storage, index construction, and query evaluation.”
- The intervention catalog carries portable moves. Add an index for a slow query you can name a key for, and remove indexes that pay maintenance for queries no one asks. Composite-key indexes match composite questions (last name plus first name, latitude plus longitude). Inverted indexes invert the natural key-to-location: instead of "for each row, which terms?", store "for each term, which rows?" — the move that made full-text search tractable, and the same move behind citation indexes and reverse lookups.
Domain-specific¶
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 2 of 2 citations: 1 supported, 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a2a73b2b9ab7 · see in the full table