I/O Efficient Dynamic Data Structures for Longest Prefix Queries

DOI10.1007/978-3-540-69903-3_5MaRDI QIDQ3512446zbMATH OpenOpenAlexFDO

Authors Moshe Hershcovitch, Haim Kaplan

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_5

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• I/O efficient dynamic data structures for longest prefix queries
• Fast prefix matching of bounded strings
• Dynamic string searching
• A data structure for a sequence of string accesses in external memory
• c-trie++: a dynamic trie tailored for fast prefix searches

Cited in

(3)

• I/O efficient dynamic data structures for longest prefix queries
• Fast prefix matching of bounded strings
• DMP-tree: A dynamic M-way prefix tree data structure for strings matching

This page was built for publication: I/O Efficient Dynamic Data Structures for Longest Prefix Queries

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