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.
- 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:a2a73b2b9ab7 · see in the full table