Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems

Authors:
Sebastian Kniesburges;Christian Scheideler
Affiliations:
Department of Computer Science, University of Paderborn, Paderborn, Germany;Department of Computer Science, University of Paderborn, Paderborn, Germany
Venue:
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Year:
2011

Citing 10
Cited 1

Trie Hashing with Controlled Load

IEEE Transactions on Software Engineering
Scalable best matching prefix lookups

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Prefix B-trees

ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Introduction to Algorithms

Introduction to Algorithms
Trie hashing

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Peer-to-peer systems for prefix search

Proceedings of the twenty-second annual symposium on Principles of distributed computing

Brief announcement: hashed predecessor patricia trie - a data structure for efficient predecessor queries in peer-to-peer systems

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 O(log |x|) hash table accesses and Delete(x) in O(1) 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).