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

(25)

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

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)