Practical Compact Indexes for Top-kDocument Retrieval
From MaRDI portal
Publication:5270942
DOI10.1145/3043958zbMath1369.68171OpenAlexW2594150397MaRDI QIDQ5270942
Roberto Konow, Simon Gog, Gonzalo Navarro
Publication date: 3 July 2017
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3043958
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Efficient index for retrieving top-\(k\) most frequent documents
- Representing trees of higher degree
- Improved compressed indexes for full-text document retrieval
- Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- General Document Retrieval in Compact Space
- Document Retrieval on Repetitive Collections
- Compressed representations of sequences and full-text indexes
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Position-Restricted Substring Searching
- Indexing compressed text
- Top-k Ranked Document Search in General Text Databases
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Space-Efficient Framework for Top-k String Retrieval Problems
- Spaces, Trees, and Colors
- Improved Single-Term Top-k Document Retrieval
- Practical Entropy-Compressed Rank/Select Dictionary
- Succinct Trees in Practice
This page was built for publication: Practical Compact Indexes for Top-kDocument Retrieval
