inverted index

(redirected from Inverted files)

inverted index

(database, information science)
A sequence of (key, pointer) pairs where each pointer points to a record in a database which contains the key value in some particular field. The index is sorted on the key values to allow rapid searching for a particular key value, using e.g. binary search. The index is "inverted" in the sense that the key value is used to find the record rather than the other way round. For databases in which the records may be searched based on more than one field, multiple indices may be created that are sorted on those keys.

An index may contain gaps to allow for new entries to be added in the correct sort order without always requiring the following entries to be shifted out of the way.
Mentioned in ?
References in periodicals archive ?
The hierarchical-codebook is also applied to generate multiple inverted files to improve non-exhaustive search.
Section 2 briefly reviewed VLAD formulation and some improvements, while section 3 describes our enhanced VLAD, encode strategy and the non-exhaustive search strategies based on multiple inverted files.
Inverted files (Wikipedia, 20 Jan 2010) (Chouvalit and Veera, 2007) (Fidel and Angel, 2002) (indexing technique) is mostly used for creating indexes.
They propose and compare different schemes for storing and managing inverted files using an embedded database system.
Inverted files versus signature files for text indexing.
However, due to its simplicity and good performance, inverted files have been traditionally the most popular indexing technique used along the years.
It can also be used to improve indexed schemes that combine inverted files and sequential search, like Glimpse [Manber and Wu 1993].
Two well-known indexing methods are inverted files and signature files.
When this message came up to me, I immediately realized that either I had forgotten to index the database and that is why the message came up or that I had put the database index, text, dictionary and inverted files in another directory and had not entered the subdirectory information in Database Files.
In particular we describe parallel algorithms for inverted files and suffix arrays structures that are suitable for implementing search engines.
Compressed inverted files with reduced decoding overheads.
Inverted files on serial computers, though, are the most common method for supporting storage and access within an information retrieval system.