Skip to main content

Design and Evaluation of an Edge Concurrency Control Protocol for Distributed Graph Databases

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


A new concurrency control protocol for distributed graph databases is described. It avoids the introduction of certain types of inconsistencies by aborting vulnerable transactions. An approximate model that allows the computation of performance measures, including the fraction of aborted transactions, is developed. The accuracy of the approximations is assessed by comparing them with simulations, for a variety of parameter settings.


  • Graph databases
  • Reciprocal consistency
  • Edge-order consistency
  • Arbitration
  • Stochastic modelling
  • Simulation

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Learn about institutional subscriptions


  1. 1.

    This is avoided in edge-partitioned graph databases, where all instances of a given edge type reside in the same partition, and nodes are replicated. Then the problem is to ensure that updates to nodes are consistent across partitions.


  1. Adya, A.: Weak consistency: a generalized theory and optimistic implementations for distributed transactions. Ph.D. thesis, Massachusetts Institute of Technology (1999)

    Google Scholar 

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

    CrossRef  Google Scholar 

  3. Apache Cassandra. Accessed 11 Dec 2019

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

    CrossRef  Google Scholar 

  5. Ezhilchelvan, P., Mitrani, I., Webber, J.: On the degradation of distributed graph databases with eventual consistency. In: Bakhshi, R., Ballarini, P., Barbot, B., Castel-Taleb, H., Remke, A. (eds.) EPEW 2018. LNCS, vol. 11178, pp. 1–13. Springer, Cham (2018).

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  7. Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. (TOCS) 16(2), 133–169 (1998)

    CrossRef  Google Scholar 

  8. Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: USENIX Annual Technical Conference, pp. 305–319. USENIX Association, Philadelphia (2014)

    Google Scholar 

  9. Escriva, R., Wong, B., Sirer, E.G.: Warp: lightweight multi-key transactions for key-value stores. CoRR:abs/1509.07815 (2015)

    Google Scholar 

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

    Google Scholar 

  11. Firth, H., Missier, P.: TAPER: query-aware, partition-enhancement for large, heterogeneous graphs. Distrib. Parallel Databases 35(2), 85–115 (2017)

    CrossRef  Google Scholar 

  12. Robinson, I., Webber, J., Eifrem, E.: Graph Databases, New Opportunities for Connected Data. O’Reilly Media, Inc., Sebastopol (2015)

    Google Scholar 

  13. Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222–1230. ACM, Beijing (2012)

    Google Scholar 

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

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding authors

Correspondence to Paul Ezhilchelvan , Isi Mitrani , Jack Waudby or Jim Webber .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ezhilchelvan, P., Mitrani, I., Waudby, J., Webber, J. (2020). Design and Evaluation of an Edge Concurrency Control Protocol for Distributed Graph Databases. In: Gribaudo, M., Iacono, M., Phung-Duc, T., Razumchik, R. (eds) Computer Performance Engineering. EPEW 2019. Lecture Notes in Computer Science(), vol 12039. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44410-5

  • Online ISBN: 978-3-030-44411-2

  • eBook Packages: Computer ScienceComputer Science (R0)