Engineering a textbook approach to index massive string dictionaries

DOI10.1007/978-3-031-43980-3_16MaRDI QIDQ6545426

Mariagiovanna Rotundo, Paolo Ferragina, Giorgio Vinciguerra

Publication date: 29 May 2024

zbMATH Keywords

algorithm engineeringtrie data structurekey-value storestring compressionstring dictionary problem

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Representing trees of higher degree
• String search in coarse-grained parallel computers
• The log-structured merge-tree (LSM-tree)
• c-trie++: a dynamic trie tailored for fast prefix searches
• The string B-tree
• Compressed Cache-Oblivious String B-Tree
• Fast Compressed Tries through Path Decompositions
• A Learned Approach to Design Compressed Rank/Select Data Structures
• Compressed string dictionaries via data-aware subtrie compaction

This page was built for publication: Engineering a textbook approach to index massive string dictionaries

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