Skip to main content
SpringerLink
Log in

On the Degradation of Distributed Graph Databases with Eventual Consistency

  • Conference paper
  • First Online:
Computer Performance Engineering (EPEW 2018)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11178))

Included in the following conference series:

Abstract

The ‘eventual consistency’ approach to updates in a distributed graph database leaves open the possibility that edge information may be corrupted. The process by which this occurs is modeled, with the aim of estimating the time that it takes for the database to become corrupted. A fluid approximation is developed and is evaluated for different parameter settings. Comparisons with simulations show that the results are very accurate.

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 EPUB and 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

References

  1. Bailis, P., Ghodsi, A.: Eventual consistency today: limitations, extensions, and beyond. Queue 11(3), 20–32 (2013)

    Article  Google Scholar 

  2. Brewer, E.A.: Towards robust distributed systems. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, Portland, 16–19 July 2000

    Google Scholar 

  3. Brouwer, L.E.J.: Uber Abbildungen von Mannigfaltigkeiten. Mathematische Annalen 71, 97–115 (1911)

    Article  MathSciNet  Google Scholar 

  4. http://cassandra.apache.org/

  5. DeCandia, G., et al.: Dynamo: Amazon’s highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)

    Article  Google Scholar 

  6. Gilbert, S., Lynch, N.: Brewers conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002)

    Article  Google Scholar 

  7. Herlihi, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM TOPLAS 12(3), 463–492 (1990)

    Article  Google Scholar 

  8. Huang, J., Abadi, D.J.: Leopard: lightweight edge-oriented partitioning and replication for dynamic graphs. Proc. VLDB Endow. 9(7), 540–551 (2016)

    Article  Google Scholar 

  9. Robinson, I., Webber, J., Eifrem, E.: Graph Databases, New Opportunities for Connected Data. O’Reilly Media, Sebastopol (2015). ISBN 978-1491930892

    Google Scholar 

  10. Vogels, W.: Eventually consistent. Comm. ACM 52(1), 40–44 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Newcastle University, Newcastle upon Tyne, NE4 5TG, UK

    Paul Ezhilchelvan & Isi Mitrani

  2. Neo4j UK, 41-45 Blackfriars Rd, London, SE1 8NZ, UK

    Jim Webber

Authors
  1. Paul Ezhilchelvan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isi Mitrani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jim Webber
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paul Ezhilchelvan .

Editor information

Editors and Affiliations

  1. eScience Center, Amsterdam, The Netherlands

    Rena Bakhshi

  2. University Paris-Saclay, Gif-sur-Yvette, France

    Paolo Ballarini

  3. Université Paris-Est Créteil, Créteil, France

    Benoît Barbot

  4. Telecom SudParis, Evry, France

    Hind Castel-Taleb

  5. Westfälische Wilhelms Universität Münster, Münster, Germany

    Anne Remke

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ezhilchelvan, P., Mitrani, I., Webber, J. (2018). On the Degradation of Distributed Graph Databases with Eventual Consistency. In: Bakhshi, R., Ballarini, P., Barbot, B., Castel-Taleb, H., Remke, A. (eds) Computer Performance Engineering. EPEW 2018. Lecture Notes in Computer Science(), vol 11178. Springer, Cham. https://doi.org/10.1007/978-3-030-02227-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-02227-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-02226-6

  • Online ISBN: 978-3-030-02227-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation