@article{3207a0cde6854196bd1c097e93e5b033,
title = "I/O efficient dynamic data structures for longest prefix queries",
abstract = "We present an efficient data structure for finding the longest prefix of a query string q in a dynamic database of strings.When the database strings are prefixes of IP-addresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string q using O(logB(n) + |q| B ) I/O operations, where B is the size of a disk block. It also supports an insertion and a deletion of a string q with the same number of I/Os. The data structure requires O(n/B) blocks, and the running time for each operation is O(B logB(n) + |q|).",
keywords = "Algorithms, Data structures, I/O model, Longest prefix, Segment tree, String B-tree",
author = "Moshe Hershcovitch and Haim Kaplan",
note = "Funding Information: This work is partially supported by United states—Israel Binational Science Foundation, project number 2006204. ",
year = "2013",
month = feb,
doi = "10.1007/s00453-011-9594-2",
language = "אנגלית",
volume = "65",
pages = "371--390",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "2",
}