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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bailis, P., Ghodsi, A.: Eventual consistency today: limitations, extensions, and beyond. Queue 11(3), 20–32 (2013)
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
Brouwer, L.E.J.: Uber Abbildungen von Mannigfaltigkeiten. Mathematische Annalen 71, 97–115 (1911)
DeCandia, G., et al.: Dynamo: Amazon’s highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)
Gilbert, S., Lynch, N.: Brewers conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News 33(2), 51–59 (2002)
Herlihi, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM TOPLAS 12(3), 463–492 (1990)
Huang, J., Abadi, D.J.: Leopard: lightweight edge-oriented partitioning and replication for dynamic graphs. Proc. VLDB Endow. 9(7), 540–551 (2016)
Robinson, I., Webber, J., Eifrem, E.: Graph Databases, New Opportunities for Connected Data. O’Reilly Media, Sebastopol (2015). ISBN 978-1491930892
Vogels, W.: Eventually consistent. Comm. ACM 52(1), 40–44 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
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)