The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this paper we address the problem of longest prefix matching and present an efficient data structure called hashed Patricia trie. Our hashed Patricia trie supports Prefixsearch(x) and Insert(x) in hash table accesses and Delete(x) in hash table accesses when |x| is the number of bits used to encode x. That is the costs only depend on |x| and not the size of the data structure. The hash table accesses may be realized by any distributed hash table (DHT). © 2011 Springer-Verlag.
CITATION STYLE
Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient longest prefix matching in peer-to-peer systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6552 LNCS, pp. 170–181). https://doi.org/10.1007/978-3-642-19094-0_18
Mendeley helps you to discover research relevant for your work.