Inverted index
An inverted index is a type of index that stores a record of where search terms – such as words or numbers – are located in a table.
See:
Essentailly inverted index consists of:
- B-Tree (if it is stored on the disk) or Hash table (if it is stored in memory)
- Inverted list or Bitmap. See An Experimental Study of Bitmap Compression vs. Inverted List Compression ↗
Papers:
- Inverted Indexing for Text Retrieval ↗
- CS6200: Information Retrieval: Indexing ↗
- Generalized Inverted Index ↗
- An Inverted Index Implementation Supporting Efficient Querying and Incremental Indexing ↗
- Fast Inverted Indexes with On-Line Update ↗
- A Generic Inverted Index Framework for Similarity Search on the GPU ↗
- A unified framework for string similarity search with edit-distance constraint ↗