(data structure)
Definition: An inverted index that includes the exact location within texts, in addition to the text in which the word appears.
Generalization (I am a kind of ...)
inverted index.
See also inverted file 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).
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 13 October 2006.
HTML page formatted Wed Feb 4 11:02:21 2009.
Cite this as:
Paul E. Black, "full inverted 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.itl.nist.gov/div897/sqg/dads/HTML/fullInvertedIndex.html
