Efficient index for retrieving top-\(k\) most frequent documents

DOI10.1016/j.jda.2010.08.003zbMath1215.68095OpenAlexW2027252317MaRDI QIDQ616994

Shih-Bin Wu, Rahul Shah, Manish Patil, Wing-Kai Hon

Publication date: 20 January 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2010.08.003

zbMATH Keywords

document retrievaltext indexinginduced generalized suffix tree

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (11)

Space-Efficient Frameworks for Top- k String Retrieval ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Top-\(k\) document retrieval in optimal space ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Gapped indexing for consecutive occurrences ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Ranked document selection ⋮ Indexes for Document Retrieval with Relevance ⋮ Unnamed Item ⋮ Practical Compact Indexes for Top-kDocument Retrieval

Cites Work

• Log-logarithmic worst-case range queries are possible in space theta(N)
• Compressed suffix trees with full functionality
• A fast string searching algorithm
• Space-Efficient Algorithms for Document Retrieval
• Position-Restricted Substring Searching
• Efficient randomized pattern-matching algorithms
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient index for retrieving top-\(k\) most frequent documents