Compressed string dictionaries via data-aware subtrie compaction

DOI10.1007/978-3-031-20643-6_17zbMath1525.68035OpenAlexW4312664090MaRDI QIDQ6111589

Francesco Tosoni, Giorgio Vinciguerra, Paolo Ferragina, Antonio Boffa

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20643-6_17

zbMATH Keywords

triescompressed data structuresstring dictionaries

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Lempel-Ziv-78 compressed string dictionaries
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Fast Compressed Tries through Path Decompositions
• The string B-tree
• The compressed permuterm index
• Compressing and indexing labeled trees, with applications
• Efficient Storage and Retrieval by Content and Address of Static Files
• Compressed Cache-Oblivious String B-Tree
• Deterministic Indexing for Packed Strings
• A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
• m-Bonsai: A Practical Compact Dynamic Trie
• Dynamic Path-decomposed Tries

This page was built for publication: Compressed string dictionaries via data-aware subtrie compaction