Space-Efficient Framework for Top-k String Retrieval Problems

DOI10.1109/FOCS.2009.19zbMath1292.68182MaRDI QIDQ5171204

Rahul Shah, Wing-Kai Hon, Jeffrey Scott Vitter

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (23)

Top-\(k\) term-proximity in succinct space ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ Colored range queries and document retrieval ⋮ Top-\(k\) document retrieval in optimal space ⋮ Ranked Document Retrieval in External Memory ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Colored top-\(K\) range-aggregate queries ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Ranked document retrieval for multiple patterns ⋮ Range majorities and minorities in arrays ⋮ Ranked document selection ⋮ General Document Retrieval in Compact Space ⋮ Orthogonal Range Searching for Text Indexing ⋮ Array Range Queries ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item ⋮ Bottom-\(k\) document retrieval ⋮ Practical Compact Indexes for Top-kDocument Retrieval ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: Space-Efficient Framework for Top-k String Retrieval Problems