Improved compressed indexes for full-text document retrieval
From MaRDI portal
Publication:2376797
Recommendations
Cited in
(17)- Space-Efficient Algorithms for Document Retrieval
- Top-\(k\) document retrieval in optimal space
- Linear-space data structures for range frequency queries on arrays and trees
- A simple algorithm for computing the document array
- Document retrieval with one wildcard
- Less space: indexing for queries with wildcards
- Time-optimal top-\(k\) document retrieval
- Practical compact indexes for top-\(k\) document retrieval
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Top-\(k\) document retrieval in optimal time and linear space
- Lempel-Ziv compressed structures for document retrieval
- Space-efficient frameworks for top-\(k\) string retrieval
- Top-k term-proximity in succinct space
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Fragmented BWT: an extended BWT for full-text indexing
- Bottom-\(k\) document retrieval
- General document retrieval in compact space
This page was built for publication: Improved compressed indexes for full-text document retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376797)