Skip to main content

bCATE: A Balanced Contention-Aware Transaction Execution Model for Highly Concurrent OLTP Systems

  • Conference paper
  • 3429 Accesses

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

Abstract

Web applications like social networking and online shopping are growing rapidly, forcing the OLTP systems to have the ability to efficiently handle numbers of concurrent transactions. Shared-everything models used in conventional OLTP systems, however, face significant problems in concurrency and scalability. With the increment of concurrent threads, the contention among threads increases sharply and degrades the system performance significantly. Shared-nothing models, on the other hand, are ideal for scalability but suffer a lot from data skew problem.

In this paper, we propose bCATE, a novel concurrent transaction execution model which divides the database into conflict partitions and detects the conflicts between transactions in each partition. bCATE adopts an efficient thread assignment strategy to alleviate the performance degradation caused by contention and data skew. We conduct extensive empirical studies on our implementation of bCATE on Shore-MT [1] and demonstrate that bCATE can achieve up to 50% performance promotion against other models.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Johnson, R., Pandis, I., Hardavellas, N., Ailamaki, A., Falsafi, B.: Shore-mt: A scalable storage manager for the multicore era. In: EDBT, pp. 24–35 (2009)

    Google Scholar 

  2. Harizopoulos, S., Abadi, D.J., Madden, S., Stonebraker, M.: Oltp through the looking glass, and what we found there. In: SIGMOD, pp. 981–992 (2008)

    Google Scholar 

  3. Pandis, I., Johnson, R., Hardavellas, N., Ailamaki, A.: Data-oriented transaction execution. Proceedings of the VLDB Endowment 3(1-2), 928–939 (2010)

    Google Scholar 

  4. Stonebraker, M., Hachem, N., Helland, P.: The end of an architecture era (it’s time for a complete rewrite). In: VLDB, pp. 1150–1160 (2007)

    Google Scholar 

  5. Cieslewicz, J., Ross, K.A.: Data partitioning on chip multiprocessors. In: DaMon, pp. 25–34 (2008)

    Google Scholar 

  6. Hua, K.A., Lee, C.: Handling data skew in multiprocessor database computers using partition tuning. In: VLDB, pp. 525–535 (1991)

    Google Scholar 

  7. Tözün, P., Pandis, I., Johnson, R., Ailamaki, A.: Scalable and dynamically balanced shared-everything oltp with physiological partitioning. The International Journal on Very Large Data Bases, 1–25 (2012)

    Google Scholar 

  8. Helland, P.: Life beyond distributed transactions: an apostate’s opinion. In: CIDR (2007)

    Google Scholar 

  9. Pavlo, A., Curino, C., Zdonik, S.: Skew-aware automatic database partitioning in shared-nothing paralleled oltp systems. In: SIGMOD, pp. 61–72 (2012)

    Google Scholar 

  10. Ailamaki, A., DeWitt, D.J., Hill, M.D., Wood, D.A.: Dbmss on a modern processor: Where does time go? In: VLDB, pp. 266–277 (1999)

    Google Scholar 

  11. Harizopoulos, S., Ailamaki, A.: A case for staged database systems. In: CIDR (2003)

    Google Scholar 

  12. Hardavellas, N., Pandis, I., Johnson, R., Mancheril, N., Ailamaki, A., Falsafi, B.: Database servers on chip multiprocessors: Limitations and opportunities. In: CIDR, pp. 79–87 (2007)

    Google Scholar 

  13. Johnson, R., Pandis, I., Stoica, R., Athanassoulis, M., Ailamaki, A.: Scalability of write-ahead logging on multicore and multisocket hardware. The VLDB Journal 21(2), 239–263

    Google Scholar 

  14. Johnson, R., Pandis, I., Ailamaki, A.: Improving oltp scalability with speculative lock inheritance. Proceedings of the VLDB Endowment 2(1), 479–489 (2009)

    Google Scholar 

  15. Zilio, D.C.: Physical database design decision algorithms and concurrent reorganization for parallel database systems. PhD thesis, University of Toronto (1998)

    Google Scholar 

  16. Rao, J., Zhang, C., Megiddo, N., Lohman, G.: Automating physical database design in a parallel database. In: SIGMOD, pp. 558–569 (2002)

    Google Scholar 

  17. Agrawal, S., Narasayya, V., Yang, B.: Integrating vertical and horizontal partitioning into automated physical database design. In: SIGMOD, pp. 359–370 (2004)

    Google Scholar 

  18. Pandis, I., Tözün, P., Johnson, R., Ailamaki, A.: Plp: Page latch-free shared-everything oltp. Proceedings of the VLDB Endowment 4(10), 610–621 (2011)

    Google Scholar 

  19. Jones, E.P., Abadi, D.J., Madden, S.: Low overhead concurrency control for partitioned main memory databases. In: SIGMOD, pp. 603–614 (2010)

    Google Scholar 

  20. Pavlo, A., Jones, E.P.C., Zdonik, S.: On predictive modeling for optimizing transaction execution in parallel oltp systems. Proceedings of the VLDB Endowment 5(2), 85–96

    Google Scholar 

  21. Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a workload-driven approach to database replication and partitioning. Proceedings of the VLDB Endowment 3(1-2), 48–57 (2010)

    Google Scholar 

  22. Sockut, G.H., Iyer, B.R.: Online reorganization of databases. ACM Computer Survey 41(3), 14:1–14:136

    Google Scholar 

  23. Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 3 edn. Springer (2011)

    Google Scholar 

  24. Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in a database system. Communnications of the ACM 19(11), 624–633

    Google Scholar 

  25. TATP: Telecom application transaction processing benchmark, http://tatpbenchmark.sourceforge.net/

  26. SysBench: System performance benchmark, http://sysbench.sourceforge.net/

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

Shi, X., Lv, Y., Shao, Y., Cui, B. (2013). bCATE: A Balanced Contention-Aware Transaction Execution Model for Highly Concurrent OLTP Systems. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38562-9_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38561-2

  • Online ISBN: 978-3-642-38562-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics