TY - GEN
T1 - I/O efficient dynamic data structures for longest prefix queries
AU - Hershcovitch, Moshe
AU - Kaplan, Haim
N1 - Funding Information:
This work is partially supported by United states - Israel Binational Science Foundation, project number 2006204.
PY - 2008
Y1 - 2008
N2 - We present an efficient data structure for finding the longest prefix of a query string p in a dynamic database of strings. When the strings are IP-addresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string p using I/O operations, where B is the size of a disk block. It also supports an insertion and a deletion of a string p with the same number of I/O's. The size of the data structure is linear in the size of the database and the running time of each operation is O(log(n)∈+∈|p|).
AB - We present an efficient data structure for finding the longest prefix of a query string p in a dynamic database of strings. When the strings are IP-addresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string p using I/O operations, where B is the size of a disk block. It also supports an insertion and a deletion of a string p with the same number of I/O's. The size of the data structure is linear in the size of the database and the running time of each operation is O(log(n)∈+∈|p|).
UR - http://www.scopus.com/inward/record.url?scp=54249156169&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69903-3_5
DO - 10.1007/978-3-540-69903-3_5
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:54249156169
SN - 3540699007
SN - 9783540699002
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 29
EP - 40
BT - Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings
T2 - 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008
Y2 - 2 July 2008 through 4 July 2008
ER -