Skip to main content
SpringerLink
Log in

D 3-Tree: A Dynamic Deterministic Decentralized Structure

  • Conference paper
  • First Online:
Algorithms - ESA 2015

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

Abstract

We present D 3-Tree, a dynamic deterministic structure for data management in decentralized networks, by engineering and further extending an existing decentralized structure. D 3-Tree achieves O(logN) worst-case search cost (N is the number of nodes in the network), O(logN) amortized load-balancing cost, and it is highly fault-tolerant. A particular strength of D 3-Tree is that it achieves O(logN) amortized search cost under massive node failures. We conduct an extensive experimental study verifying that D 3-Tree outperforms other well-known structures and that it achieves a significant success rate in element queries in case of massive node failures.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: A dynamic overlay network for routing, data management, and multicasting. In: ACM SPAA 2004, pp. 170–179 (2004)

    Google Scholar 

  2. Brodal, G., Sioutas, S., Tsichlas, K., Zaroliagis, C.: D2-tree: A new overlay with deterministic bounds. Algorithmica 72(3), 860–883 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  3. Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: Load balancing and range queries in P2P systems using P-Ring. ACM Trans. Internet Technol. 10(4), Art.16, 1–16 (2011)

    Google Scholar 

  4. Gupta, A., Agrawal, D., Abbadi, A.E.: Approximate range selection queries in peer-to-peer systems. In: Proc. 1st Biennial Conference on Innovative Data Systems Research – CIDR (2003)

    Google Scholar 

  5. Jagadish, H.V., Ooi, B.C., Tan, K., Vu, Q.H., Zhang, R.: Speeding up search in P2P networks with a multi-way tree structure. ACM SIGMOD 2006, 1–12 (2006)

    Google Scholar 

  6. Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: a balanced tree structure for peer-to-peer networks. In: VLDB 2005, pp. 661–672 (2005)

    Google Scholar 

  7. Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Springer (2011)

    Google Scholar 

  8. Sahin, O., Gupta, A., Agrawal, D., Abbadi, A.E.: A peer-to-peer framework for caching range queries. In: ICDE 2004, pp. 165–176 (2004)

    Google Scholar 

  9. Scheideler, C., Schmid, S.: A distributed and oblivious heap. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 571–582. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Sourla, E., Sioutas, S., Tsichlas, K., Zaroliagis, C.: D3-tree: A dynamic distributed deterministic load–balancer for decentralized tree structures. Tech. Rep. ArXiv:1503.07905, ACM CoRR (March 2015)

    Google Scholar 

  11. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31(4), 149–160 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computer Eng. & Informatics, Univ. of Patras, 26504, Patras, Greece

    Efrosini Sourla & Christos Zaroliagis

  2. Computer Technology Institute & Press “Diophantus”, Patras University Campus, N. Kazantzaki Str., 26504, Patras, Greece

    Christos Zaroliagis

  3. Dept of Informatics, Ionian University, 49100, Corfu, Greece

    Spyros Sioutas

  4. Dept of Informatics, Aristotle Univ. of Thessaloniki, 54124, Thessaloniki, Greece

    Kostas Tsichlas

Authors
  1. Spyros Sioutas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Efrosini Sourla
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kostas Tsichlas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Spyros Sioutas .

Editor information

Editors and Affiliations

  1. University of Technology, Eindhoven, The Netherlands

    Nikhil Bansal

  2. Sapienza University of Rome, Rome, Italy

    Irene Finocchi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sioutas, S., Sourla, E., Tsichlas, K., Zaroliagis, C. (2015). D 3-Tree: A Dynamic Deterministic Decentralized Structure. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_82

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48350-3_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48349-7

  • Online ISBN: 978-3-662-48350-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation