Towards efficient positional inverted index

DOI10.3390/A10010030zbMATH Open1461.68238OpenAlexW2591309672MaRDI QIDQ1662625FDOQ1662625

Authors: Jan Holub, P. P. Procházka 

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10010030

Recommendations

• A linear lower bound on index size for text retrieval
• Complete inverted files for efficient text retrieval and analysis
• Elias-Fano meets single-term top-\(k\) document retrieval
• A linear lower bound on index size for text retrieval
• Algorithms and Computation

zbMATH Keywords

data compressionnatural language processingsearch enginesself-indexinginverted index

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Cites Work

• Compressed representations of sequences and full-text indexes
• Universal codeword sets and representations of the integers
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
• Run-length encodings (Corresp.)
• Self-indexing based on LZ77

Cited In (2)

• Inverted Index Support for Numeric Search
• Everywhere-Tight Information Cost Tradeoffs for Augmented Index

This page was built for publication: Towards efficient positional inverted index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662625)