Jump to content

Inverted index

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nils Grimsmo (talk | contribs) at 11:07, 10 November 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An inverted file is an index structure mapping words to their locations in a text or text collection. Inverted files are usually the most important data structure used in search engines.

If you have an inverted file for a set of documents , you can seach for a word , and get either the set of documents containing , or all pairs of documents and offsets where occurs.


References

  • Justin Zobel, Alistair Moffat and Kotagiri Ramamohanarao, Inverted files versus signature files for text indexing. ACM Transactions on Database Systems (TODS), Volume 23, Issue 4 (December 1998), Pages: 453 - 490.