Lempel-Ziv compressed structures for document retrieval
DOI10.1016/J.IC.2019.01.006zbMATH Open1467.68047OpenAlexW2914245896WikidataQ128458518 ScholiaQ128458518MaRDI QIDQ2272976FDOQ2272976
Authors: Héctor Ferrada, Gonzalo Navarro 
Publication date: 17 September 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.01.006
Recommendations
Information storage and retrieval of data (68P20) Data structures (68P05) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Information retrieval. Implementing and evaluating search engines.
- Title not available (Why is that?)
- Improved compressed indexes for full-text document retrieval
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of balanced parentheses and static trees
- Fully functional static and dynamic succinct trees
- Compressed representations of sequences and full-text indexes
- An analysis of the Burrows-Wheeler transform
- Indexing compressed text
- Compression of individual sequences via variable-rate coding
- Title not available (Why is that?)
- Space-Efficient Framework for Top-k String Retrieval Problems
- Succinct Trees in Practice
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Top-\(k\) document retrieval in optimal time and linear space
- Representing trees of higher degree
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Space-efficient frameworks for top-\(k\) string retrieval
- Title not available (Why is that?)
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Succinct data structures for flexible text retrieval systems
- Space-Efficient Algorithms for Document Retrieval
- On compressing and indexing repetitive sequences
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- Top-\(k\) ranked document search in general text databases
- New text indexing functionalities of the compressed suffix arrays
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Implementing the LZ-index, theory versus practice
- Indexing text using the Ziv--Lempel trie
- On the height of digital trees and related problems
- Improved range minimum queries
- General document retrieval in compact space
- Improved single-term top-\(k\) document retrieval
Cited In (7)
- Unique-order interpolative coding for fast querying and space-efficient indexing in information retrieval systems
- Space-Efficient Algorithms for Document Retrieval
- Inverted file compression through document identifier reassignment.
- A linear lower bound on index size for text retrieval
- FLPI: an optimal algorithm for document indexing based on LPI
- Improved compressed indexes for full-text document retrieval
- Sensitivity of string compressors and repetitiveness measures
Uses Software
This page was built for publication: Lempel-Ziv compressed structures for document retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272976)
