A linear lower bound on index size for text retrieval
From MaRDI portal
Publication:4458870
DOI10.1016/S0196-6774(03)00043-9zbMATH Open1079.68029OpenAlexW4244324195MaRDI QIDQ4458870FDOQ4458870
Authors: Erik D. Demaine, Alejandro Lopez-Ortiz 
Publication date: 14 March 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00043-9
Recommendations
- A linear lower bound on index size for text retrieval
- Improved Dynamic Text Indexing
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Indexing compressed text
Cited In (14)
- Succinct indices for path minimum, with applications
- Complete inverted files for efficient text retrieval and analysis
- A Survey of Data Structures in the Bitprobe Model
- A linear lower bound on index size for text retrieval
- Counting suffix arrays and strings
- Towards efficient positional inverted index
- Data structure lower bounds for document indexing problems
- Fast string dictionary lookup with one error
- Random access to high-order entropy compressed text
- Title not available (Why is that?)
- On a model of indexability and its bounds for range queries
- Orthogonal range searching for text indexing
- The function-inversion problem: barriers and opportunities
- The cell probe complexity of succinct data structures
This page was built for publication: A linear lower bound on index size for text retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458870)
