(data structure)
Definition: An inverted index that only indicates the text in which a word appears, not where the word appears within the text.
Generalization (I am a kind of ...)
inverted index.
See also full inverted index, block addressing index.
Note: See the example at inverted index.
Author: PEB
Nivio Ziviani, Edleno Silva de Moura, Gonzalo Navarro, and Ricardo Baeza-Yates, Compression: A Key for Next-Generation Text Retrieval Systems, IEEE Computer, 33(11):37-44, November 2000, (page 42).
Justin Zobel and Alistair Moffat, Inverted Files for Text Search Engines, ACM Computing Surveys, 38(2), article 6, July 2006.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 13 October 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "inverted file index", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 13 October 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/invertedFileIndex.html
