Space-Efficient Framework for Top-k String Retrieval Problems

DOI10.1109/FOCS.2009.19MaRDI QIDQ5171204zbMATH OpenFDO

Authors Wing-Kai Hon, Rahul Shah, 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)

Full work available at URL https://doi.org/10.1109/FOCS.2009.19

Mathematics Subject Classification ID

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

Cited in

(24)

• Top-k document retrieval in optimal space
• Linear-space data structures for range frequency queries on arrays and trees
• Colored range queries and document retrieval
• Colored top-\(K\) range-aggregate queries
• Time-optimal top-k document retrieval
• Ranked Document Retrieval in External Memory
• Document listing on repetitive collections with guaranteed performance
• Ranked document retrieval with forbidden pattern
• Practical compact indexes for top-k document retrieval
• New space/time tradeoffs for top-\(k\) document retrieval on sequences
• Array range queries
• Top-\(k\) document retrieval in optimal time and linear space
• Ranked document retrieval for multiple patterns
• Lempel-Ziv compressed structures for document retrieval
• Ranked document selection
• Orthogonal range searching for text indexing
• Indexes for document retrieval with relevance
• Space-efficient frameworks for top-k string retrieval
• Quantum data structure for range minimum query
• Top-k term-proximity in succinct space
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Bottom-\(k\) document retrieval
• General document retrieval in compact space
• Range majorities and minorities in arrays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171204)