Self-adjusting binary search trees
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
O(log n ) Dynamic Packet Routing
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
SIAM Journal on Computing
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
Proceedings of the 33rd annual international symposium on Computer Architecture
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
We present an efficient data structure for finding the longest prefix of a query string pin 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 pusing $O(\log_{B}(n)+\frac{|p|}{B})$ I/O operations, where Bis the size of a disk block. It also supports an insertion and a deletion of a string pwith 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|).