Top-\(k\) document retrieval in optimal space
From MaRDI portal
Publication:396625
DOI10.1016/j.ipl.2013.03.012zbMath1371.68071OpenAlexW2093918274MaRDI QIDQ396625
Publication date: 13 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.012
Related Items (11)
Space-Efficient Frameworks for Top- k String Retrieval ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Gapped indexing for consecutive occurrences ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Ranked document selection ⋮ Indexes for Document Retrieval with Relevance ⋮ Bottom-\(k\) document retrieval ⋮ Structural Pattern Matching - Succinctly.
Cites Work
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- Efficient index for retrieving top-\(k\) most frequent documents
- Fast set intersection and two-patterns matching
- Succinct data structures for flexible text retrieval systems
- Two-dimensional substring indexing.
- Improved compressed indexes for full-text document retrieval
- Forbidden Patterns
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
- Document Listing for Queries with Excluded Pattern
- Compressed representations of sequences and full-text indexes
- Time-Optimal Top-$k$ Document Retrieval
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Alphabet-Independent Compressed Text Indexing
- Space-Efficient Algorithms for Document Retrieval
- Deterministic sorting in O(nloglogn) time and linear space
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Space-Efficient Framework for Top-k String Retrieval Problems
This page was built for publication: Top-\(k\) document retrieval in optimal space
