Skip to main content

Scalable and Fully Consistent Transactions in the Cloud through Hierarchical Validation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8059))

Abstract

Cloud-based systems are expected to provide both high availability and low latency regardless of location. For data management, this requires replication. However, transaction management on replicated data poses a number of challenges. One of the most important is isolation: Coordinating simultaneous transactions in a local system is relatively straightforward, but for databases distributed across multiple geographical sites, this requires costly message exchange. Due to the resulting performance impact, available solutions for scalable data management in the cloud work either by reducing consistency standards (e.g., to eventual consistency), or by partitioning the data set and providing consistent execution only within each partition. In both cases, application development is more costly and error-prone, and for critical applications where consistency is crucial, e.g., stock trading, it may seriously limit the possibility to adopt a cloud infrastructure. In this paper, we propose a new method for coordinating transactions on replicated data. We target cloud systems with distribution across a wide-area network. Our approach is based on partitioning data to allow efficient local coordination while providing full consistency through a hierarchical validation procedure across partitions. We also present results from an experimental evaluation using Real-Time Maude simulations.

This work was partially supported by AFOSR Grant FA8750-11-2-0084.

This is a preview of subscription content, log in via an institution.

Buying options

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Chang, F.: et al.: Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst. 26, 4:1–4:26 (2008)

    Google Scholar 

  4. Das, S., Agrawal, D., Abbadi, A.E.: ElasTraS: An elastic transactional data store in the cloud. In: USENIX HotCloud. USENIX (2009)

    Google Scholar 

  5. Rao, J., Shekita, E.J., Tata, S.: Using Paxos to build a scalable, consistent, and highly available datastore. Proc. VLDB Endow. 4(4), 243–254 (2011)

    Google Scholar 

  6. Baker, J., et al.: Megastore: Providing scalable, highly available storage for interactive services. In: CIDR (2011), http://www.cidrdb.org/cidr2011/Papers/CIDR11_Paper32.pdf

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

    Article  Google Scholar 

  8. Corbett, J.C., et al.: Spanner: Google’s globally-distributed database. In: OSDI 2012, pp. 251–264. USENIX Association, Berkeley (2012)

    Google Scholar 

  9. Ölveczky, P.C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation 20(1-2), 161–196 (2007)

    Article  MATH  Google Scholar 

  10. Kemme, B., Alonso, G.: Don’t be lazy, be consistent: Postgres-R, A new way to implement database replication. In: VLDB 2000 (2000), http://www.vldb.org/

  11. Pedone, F., Guerraoui, R., Schiper, A.: The database state machine approach. In: Distributed Parallel Databases (2003)

    Google Scholar 

  12. Grov, J., et al.: A pragmatic protocol for database replication in interconnected clusters. In: PRDC 2006. IEEE Computer Society (2006)

    Google Scholar 

  13. Sutra, P., Shapiro, M.: Fault-tolerant partial replication in large-scale database systems. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 404–413. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Schiper, N., Sutra, P., Pedone, F.: P-store: Genuine partial replication in wide area networks. In: SRDS 2010. IEEE (2010)

    Google Scholar 

  15. Campbell, D.G., Kakivaya, G., Ellis, N.: Extreme scale with full SQL language support in Microsoft SQL Azure. In: SIGMOD 2010, 1021–1024. ACM (2010)

    Google Scholar 

  16. Kossmann, D., Kraska, T., Loesing, S.: An evaluation of alternative architectures for transaction processing in the cloud. In: SIGMOD 2010. ACM (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grov, J., Ölveczky, P.C. (2013). Scalable and Fully Consistent Transactions in the Cloud through Hierarchical Validation. In: Hameurlain, A., Rahayu, W., Taniar, D. (eds) Data Management in Cloud, Grid and P2P Systems. Globe 2013. Lecture Notes in Computer Science, vol 8059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40053-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40053-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40052-0

  • Online ISBN: 978-3-642-40053-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics