General Document Retrieval in Compact Space
From MaRDI portal
Publication:2828189
DOI10.1145/2670128zbMath1347.68103OpenAlexW2090640497MaRDI QIDQ2828189
Daniel Valenzuela, Simon J. Puglisi, Gonzalo Navarro
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2670128
Related Items (6)
Grammar compressed sequences with rank/select support ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Unnamed Item ⋮ Practical Compact Indexes for Top-kDocument Retrieval
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- New algorithms on wavelet trees and applications to information retrieval
- Representing trees of higher degree
- A simple optimal representation for balanced parentheses
- Succinct data structures for flexible text retrieval systems
- An online algorithm for lightweight grammar-based compression
- Improved compressed indexes for full-text document retrieval
- Succinct Representation of Balanced Parentheses and Static Trees
- Wavelet Trees for All
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
- Compressed representations of sequences and full-text indexes
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Suffix Arrays: A New Method for On-Line String Searches
- Succinct indexes for strings, binary relations and multilabeled trees
- An analysis of the Burrows—Wheeler transform
- Space-Efficient Algorithms for Document Retrieval
- Compressed Text Indexes with Fast Locate
- Indexing compressed text
- Rank/select operations on large alphabets
- Top-k Ranked Document Search in General Text Databases
- Optimal Trade-Offs for Succinct String Indexes
- Compression of individual sequences via variable-rate coding
- New text indexing functionalities of the compressed suffix arrays
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Space-Efficient Framework for Top-k String Retrieval Problems
- Practical Entropy-Compressed Rank/Select Dictionary
- Theory and Practise of Monotone Minimal Perfect Hashing
- Succinct Trees in Practice
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
This page was built for publication: General Document Retrieval in Compact Space
