Compression, indexing, and retrieval for massive string data

DOI10.1007/978-3-642-13509-5_24MaRDI QIDQ3575253zbMATH OpenOpenAlexFDO

Authors Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter

Publication date 26 July 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13509-5_24

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Compressed data structures for strings. On searching and extracting strings from compressed textual data
• Fast relative Lempel-Ziv self-index for similar sequences
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressed inverted indexes for in-memory search engines
• Indexing compressed text

Cited in

(9)

• A quick tour on suffix arrays and compressed suffix arrays
• Compression-based distance between string data and its application to literary work classification based on authorship
• Top-\(k\) document retrieval in optimal time and linear space
• Random access to high-order entropy compressed text
• Lightweight data indexing and compression in external memory
• Indexes for document retrieval with relevance
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Compressed data structures for strings. On searching and extracting strings from compressed textual data

This page was built for publication: Compression, indexing, and retrieval for massive string data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575253)