Compact Indexes for Flexible Top-$$k$$ Retrieval
From MaRDI portal
Publication:2942258
DOI10.1007/978-3-319-19929-0_18zbMath1432.68121arXiv1406.3170MaRDI QIDQ2942258
Publication date: 20 August 2015
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3170
Cites Work
- Unnamed Item
- Unnamed Item
- New algorithms on wavelet trees and applications to information retrieval
- Succinct data structures for flexible text retrieval systems
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Compressed suffix trees with full functionality
- General Document Retrieval in Compact Space
- Space-Efficient Frameworks for Top- k String Retrieval
- Top-k Ranked Document Search in General Text Databases
- New text indexing functionalities of the compressed suffix arrays
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- On Hardness of Several String Indexing Problems
- Spaces, Trees, and Colors
- Improved Single-Term Top-k Document Retrieval
- Codes for the World Wide Web