Skip to main content
SpringerLink
Log in

Distributed B-Tree with Weak Consistency

  • Conference paper
Networked Systems (NETYS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 7853))

Included in the following conference series:

Abstract

B-tree is a widely used data-structure indexing data for efficient Retrieval. We consider a decentralized B-tree, were parts of the structure are distributed among different processors and some parts are replicated, thus providing a decentralized indexing structure and parallel operations as desired by modern-day cloud computing platforms. To accommodate the dynamic changes due to data insertion/deletion and changes of the retrieval load, the state of the B-tree is updated by splitting and merging tree-nodes. The traditional update algorithms maintain strong consistency among the replicated states and possibly involve very many tree-nodes. We show in this paper that data retrieval and update can be performed correctly with much weaker consistency criteria. This allows to decompose the necessary updates into smaller update operations that involve only a limited number of tree-nodes, each. We show by analytical models and simulations that with weak consistency the average number of tree-nodes that require updating is reduced compared to the traditional B-tree update algorithms.

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. Afek, Y., Gafni, E.: End-to-end communication in unreliable networks. In: Proc. 7th ACM Symposium on Principles of Distributed Computing, PODC 1988, pp. 131–148 (1988)

    Google Scholar 

  2. Aguilera, M.K., Golab, W., Shah, M.S.: A practical scalable distributed B-tree. Proc. VLDB Endow. 1(1), 598–609 (2008)

    Google Scholar 

  3. Asaduzzaman, S., Bochmann, G.V.: GeoP2P: An adaptive peer-to-peer overlay for efficient search and update of spatial information. Unpublished document (2009), http://arxiv.org/abs/0903.3759

  4. Bar-Noy, A., Dolev, D.: A partial equivalence between shared-memory and message-passing in an asyn. fail-stop distr. env. Mathematical Systems Theory 26, 21–39 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Birman, K., Chockler, G., Renesse, R.V.: Toward a cloud computing research agenda. ACM SIGACT News 40(2), 68–80 (2009)

    Article  Google Scholar 

  6. Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Transactions on Computing Systems 26(2), 1–26 (2008)

    Article  MATH  Google Scholar 

  7. Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)

    Article  MATH  Google Scholar 

  8. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD 84, 47–57 (1984)

    Article  Google Scholar 

  9. Kung, H.T., Robinson, J.T.: On optimistic methods for concurrency control. ACM Trans. Database Syst. 6(2), 213–226 (1981)

    Article  Google Scholar 

  10. Li, M., Lee, W., Sivasubramaniam, A.: DPTree: A Balanced Tree Based IndexingFramework for Peer-to-Peer Systems. In: 14th IEEE ICNP, pp. 12–21 (November 2006)

    Google Scholar 

  11. Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys 22(4), 299–319 (1990)

    Article  Google Scholar 

  12. Hafaiedh, K.B.: Studying the properties of a distributed decentralized B+ tree with weak consistency. Master Thesis, University of Ottawa (Oct. 2012)

    Google Scholar 

  13. Asaduzzaman, S., Bochmann, G.V.: Distributed B-tree with weak consistency, unpublished report, see http://www.site.uottawa.ca/~bochmann/Curriculum/Pub/2010%20-%20Distributed%20B-tree%20with%20Weak%20Consistency.pdf

  14. Asaduzzaman, S., Bochmann, G.V.: A locality preserving routing overlay using geographic coordinates. In: IEEE Intern. Conf. on Internet Multimedia Systems Architecture and Application, Bangalore, India (December 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Ottawa, Canada

    Gregor V. Bochmann & Shah Asaduzzaman

Authors
  1. Gregor V. Bochmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shah Asaduzzaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NICTA and University of Sydney, 2006, Sydney, Australia

    Vincent Gramoli

  2. EPFL, Switzerland

    Rachid Guerraoui

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bochmann, G.V., Asaduzzaman, S. (2013). Distributed B-Tree with Weak Consistency. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40148-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation