DMP-tree: A dynamic M-way prefix tree data structure for strings matching

DOI10.1016/J.COMPELECENG.2008.04.011MaRDI QIDQ605684zbMATH OpenOpenAlexFDO

Authors Nasser Yazdani, Hossein Mohammadi

Publication date 25 November 2010

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.compeleceng.2008.04.011

zbMATH Keywords

DMP-treeIP lookupmulti indexingprefix matchingstring matching

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Fast prefix matching of bounded strings
• I/O Efficient Dynamic Data Structures for Longest Prefix Queries
• I/O efficient dynamic data structures for longest prefix queries
• The string B-tree
• A longest prefix first search tree for IP lookup

Cited in

(1)

• Fast prefix matching of bounded strings

This page was built for publication: DMP-tree: A dynamic M-way prefix tree data structure for strings matching

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