Skip to main content
SpringerLink
Log in

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6552))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, January 12-14, pp. 384–393 (2003)

    Google Scholar 

  2. Awerbuch, B., Scheideler, C.: Peer-to-peer systems for prefix search. In: Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 123–132. ACM, New York (2003), http://doi.acm.org/10.1145/872035.872053

    Chapter  Google Scholar 

  3. Bayer, R., Unterauer, K.: Prefix b-trees. ACM Trans. Database Syst. 2(1), 11–26 (1977), doi:10.1145/320521.320530

    Article  Google Scholar 

  4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press/McGraw-Hill (2001)

    Google Scholar 

  5. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory 10, 99–127 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  6. Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol. 3. Addison Wesley, Reading (1997)

    MATH  Google Scholar 

  7. Kumar, S., Turner, J.S., Crowley, P., Mitzenmacher, M.: Hexa: Compact data structures for faster packet processing. In: ICNP, pp. 246–255 (2007)

    Google Scholar 

  8. Litwin, W.: Trie hashing. In: Lien, Y.E. (ed.) SIGMOD Conference, pp. 19–29. ACM Press, New York (1981)

    Google Scholar 

  9. Litwin, W., Roussopoulos, N., Lévy, G., Hong, W.: Trie hashing with controlled load. IEEE Trans. Software Eng. 17(7), 678–691 (1991)

    Article  MathSciNet  Google Scholar 

  10. Morrison, D.R.: Patricia—practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514–534 (1968)

    Article  Google Scholar 

  11. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. CoRR abs/cs/0603043 (2006)

    Google Scholar 

  12. Ramabhadran, S., Hellerstein, J., Ratnasamy, S., Shenker, S.: Prefix hash tree - an indexing data structure over distributed hash tables, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.617

  13. Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001), http://portal.acm.org/citation.cfm?id=646591.697650

    Chapter  Google Scholar 

  14. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149–160. ACM, New York (2001)

    Chapter  Google Scholar 

  15. Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable best matching prefix lookups. In: PODC 1998: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, p. 312. ACM, New York (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Paderborn, D-33102, Paderborn, Germany

    Sebastian Kniesburges & Christian Scheideler

Authors
  1. Sebastian Kniesburges
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Scheideler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  2. Department of Computer Science and Engineering, Hauz Khas, Indian Institute of Technology, 11016, New Delhi, India

    Amit Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kniesburges, S., Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: Katoh, N., Kumar, A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19094-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19094-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19093-3

  • Online ISBN: 978-3-642-19094-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation