Design of Self-generating Component Powered by Magnetic Energy Harvesting—Magnetic Field Alarm.pdfVIP

I/O Efficient Dynamic Data Structures for Longest Prefix Queries Moshe Hershcovitch1 and Haim Kaplan2 1 Faculty of Electrical Engineering moshik1@ 2 School of Computer Science haimk@cs.tau.ac.il Tel Aviv University, Tel Aviv 69978, Israel Abstract. 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 O(logB (n) + |p | ) I/O operations, where B is the size of a disk block. B 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 |). 1 Introduction We consider the longest prefix problem which is defined as follows. The input consists of a set of strings S = {p 1 . . . pn } which we shall refer to as prefixes . We want to preprocess S into a data structure such that given a query string q we can efficiently find the longest prefix in S which is a prefix of q or report that no prefix in S is a prefix of q. We focus on the dynamic version of the problem where we want to be able to insert and delete prefixes to and from S , respectively. The main application of this problem is for packet forwarding in IP networks. In this application a router maintains a set of prefixes of IP addresses according to some routing protocol such as BGP (Border Gateway Protocol). When a packet arrives, the r