Skip to main content
SpringerLink
Log in

A Consensus Quorum Algorithm for Replicated NoSQL Data

  • Conference paper
Beyond Databases, Architectures and Structures (BDAS 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 521))

Abstract

We propose an algorithm, called Lorq, for managing NoSQL data replication. Lorq is based on consensus quorum approach and is focused on replicating logs storing update operations. Read operations can be performed on different levels of consistency (from strong to eventual consistency), realizing so-called service level agreements (SLA). In this way the trade-off among availability/latency, partition tolerance and consistency is considered. We discuss correctness of Lorq and its importance in developing modern information systems based on geo-replication and cloud computing.

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. Abadi, D.: Consistency tradeoffs in modern distributed database system design. IEEE Computer 45(2), 37–42 (2012)

    Article  MathSciNet  Google Scholar 

  2. Amazon DynamoDB Pricing (2014), http://aws.amazon.com/dynamodb/pricing

  3. Asynchronous Programming with Async and Await (2014), http://msdn.microsoft.com/en-us/library/hh191443.aspx

  4. Bach, M., Werner, A.: Standardization of noSQL database languages. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B.z. (eds.) BDAS 2014. CCIS, vol. 424, pp. 50–60. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  5. Brewer, E.A.: Towards robust distributed systems (Invited Talk). In: ACM Principles of Distributed Computing, Portland, Oregon, p. 7 (2000)

    Google Scholar 

  6. Cattell, R.: Scalable SQL and NoSQL data stores. SIGMOD Record 39(4), 12–27 (2010)

    Article  Google Scholar 

  7. Cooper, B.F., Ramakrishnan, R., Srivastava, U., Silberstein, A., et al.: PNUTS: Yahoo!’s hosted data serving platform. PVLDB 1(2), 1277–1288 (2008)

    Google Scholar 

  8. Corbett, J.C., Dean, J., Epstein, M., et al.: Spanner: Google’s globally distributed database. ACM Trans. Comput. Syst. 31(3), 8 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Gafni, E., Lamport, L.: Disk Paxos. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 330–344. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Gifford, D.K.: Weighted Voting for Replicated Data. In: ACM SIGOPS 7th Sym. on Op. Systems Principles, SOSP 1979, pp. 150–162 (1979)

    Google Scholar 

  12. Gilbert, S., Lynch, N.A.: Perspectives on the CAP Theorem. IEEE Computer 45(2), 30–36 (2012)

    Article  Google Scholar 

  13. Golab, W., Rahman, M.R., AuYoung, A., Keeton, K., Li, X.: Eventually consistent: Not what you were expecting? Commun. ACM 57(3), 38–44 (2014)

    Article  Google Scholar 

  14. Google: Balancing Strong and Eventual Consistency with Google Cloud Datastore (2014), https://cloud.google.com/developers/articles

  15. Lakshman, A., Malik, P.: Cassandra: A decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2), 35–40 (2010)

    Article  Google Scholar 

  16. Lamport, L.: Generalized Consensus and Paxos. In: Technical Report MSR-TR-2005-33, pp. 1–63. Microsoft Research (2005)

    Google Scholar 

  17. Lamport, L.: Fast Paxos. Distributed Computing 19(2), 79–103 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ongaro, D., Ousterhout, J.: In Search of an Understandable Consensus Algorithm. In: USENIX Annual Technical Conference, pp. 305–319 (2014)

    Google Scholar 

  19. Stonebraker, M., Cattell, R.: 10 rules for scalable performance in ’simple operation’ datastores. Commun. ACM 54(6), 72–80 (2011)

    Article  Google Scholar 

  20. Terry, D.: Replicated data consistency explained through baseball. Commun. ACM 56(12), 82–89 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control and Information Engineering, Poznań University of Technology, Poznań, Poland

    Tadeusz Pankowski

Authors
  1. Tadeusz Pankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tadeusz Pankowski .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Stanisław Kozielski

  2. Silesian University of Technology, Gliwice, Poland

    Dariusz Mrozek

  3. Silesian University of Technology, Gliwice, Poland

    Paweł Kasprowski

  4. Silesian University of Technology, Gliwice, Poland

    Bożena Małysiak-Mrozek

  5. Silesian University of Technology, Gliwice,, Poland

    Daniel Kostrzewa

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Pankowski, T. (2015). A Consensus Quorum Algorithm for Replicated NoSQL Data. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. BDAS 2015. Communications in Computer and Information Science, vol 521. Springer, Cham. https://doi.org/10.1007/978-3-319-18422-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18422-7_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18421-0

  • Online ISBN: 978-3-319-18422-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation