Skip to main content

Quantitative Contention Generation for Performance Evaluation on OLTP Databases

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2020)

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

  • 1280 Accesses

Abstract

Although we have achieved significant progress in improving the scalability of transactional database systems (OLTP), the presence of contention operations in workloads is still the fundamental limitation in improving throughput. The reason is that the overhead of managing conflict transactions with concurrency control mechanism is proportional to the amount of contentions. As a consequence, contention workload generation is urgent to evaluate performance of modern OLTP database systems. Though we have kinds of standard benchmarks which provide some ways in simulating resource contention, e.g. skew distribution control of transactions, they can not control the generation of contention quantitatively; even worse, the simulation effectiveness of these methods is affected by the scale of data. So in this paper we design a scalable quantitative contention generation method with fine contention granularity control, which is expected to generate resource contention specified by contention ratio and contention intensity.

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

Access this chapter

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.79
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 52.74
Price includes VAT (France)
  • 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

Similar content being viewed by others

References

  1. Aditya, G., Dheren, G., Fei, Z., Amit, P., Zhan, F.M.: Btrim: hybrid in-memory database architecture for extreme transaction processing in VLDBS. In: VLDB, pp. 1889–1901 (2018)

    Google Scholar 

  2. Appuswamy, R., Anadiotis, A.C., Porobic, D., Iman, M.K., Ailamaki, A.: Analyzing the impact of system architecture on the scalability of oltp engines for high-contention workloads. VLDB 11(2), 121–134 (2017)

    Google Scholar 

  3. Cahill, M.J., Röhm, U., Fekete, A.D.: Serializable isolation for snapshot databases. TODS 34(4), 20 (2009)

    Article  Google Scholar 

  4. Chen, S., Ailamaki, A., Athanassoulis, M., et al.: TPC-C: characterizing the new TPC-E benchmark via an I/O comparison study. SIGMOD 39(3), 5–10 (2011)

    Article  Google Scholar 

  5. Chunxi, Z., Yuming, L., Rong, Z., et al.: Benchmarking on intensive transaction processing. Front. J. Higher Educ. Press, 14, 145–204 (2019)

    Google Scholar 

  6. Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM Symposium on Cloud Computing, pp. 143–154. ACM (2010)

    Google Scholar 

  7. Harding, R., Aken, D.V., Pavlo, A., Stonebraker, M.: An evaluation of distributed concurrency control. VLDB 10(5), 553–564 (2017)

    Google Scholar 

  8. Huang, G., et al.: X-engine: an optimized storage engine for large-scale e-commerce transaction processing. In: SIGMOD, pp. 651–665. ACM (2019)

    Google Scholar 

  9. PostgreSQL. https://www.postgresql.org/ddl-partitioning.html/

  10. Ren, K., Faleiro, J.M., Abadi, D.J.: Design principles for scaling multi-core OLTP under high contention. In: SIGMOD, pp. 1583–1598. ACM (2016)

    Google Scholar 

  11. Ronstrom, M., Thalmann, L.: Mysql cluster architecture overview. MySQL Technical White Paper (2004)

    Google Scholar 

  12. Stonebraker, M.: A measure of transaction processing power. In: Readings in Database Systems, pp. 442–454 (1994)

    Google Scholar 

  13. Wolski, A.: TATP benchmark description (version 1.0) (2009)

    Google Scholar 

  14. Zhou, N., Zhou, X., Zhang, X., Du, X., Wang, S.: Reordering transaction execution to boost high-frequency trading applications. Data Sci. Eng. 2(4), 301–315 (2017)

    Article  Google Scholar 

Download references

Acknowledgment

This work is partially supported by National Key Research and Development Plan Project (No. 2018YFB1003404). Ke Shu is supported by PingCAP.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rong Zhang .

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

Zhang, C., Zhang, R., Qian, W., Shu, K., Zhou, A. (2020). Quantitative Contention Generation for Performance Evaluation on OLTP Databases. In: Wang, X., Zhang, R., Lee, YK., Sun, L., Moon, YS. (eds) Web and Big Data. APWeb-WAIM 2020. Lecture Notes in Computer Science(), vol 12318. Springer, Cham. https://doi.org/10.1007/978-3-030-60290-1_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60290-1_34

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-030-60290-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics