Abstract
In this paper, we present some insights from the analysis of the drawbacks of the advanced concurrency control techniques. Based on the analysis, we reveal that a commonly used technique for index structures, read-copy update (RCU), has the most significant impact on the throughput and latency of in-memory database systems. For overcoming the drawbacks, we developed Glasstree, a new index structure that produces a smaller load on the memory allocator by enhancing Masstree. Glasstree achieved high throughput and stable latency than Masstree under various workloads.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The commit ID of git used in our evaluation is 15edde0.
References
Diaconu, C., Freedman, C., Ismert, E., Larson, P.-A., Mittal, P., Stonecipher, R., Verma, N., Zwilling, M.: Hekaton: SQL server’s memory-optimized OLTP engine. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 1243–1254 (2013)
Fraser, K.: Practical lock-freedom, Ph.D. thesis, Cambridge University, Technical report UCAM-CL-TR-579 (2004)
Kung, H.T., Robinson, J.T.: On optimistic methods for concurrency control. ACM Trans. Database Syst. 6(2), 213–226 (1981)
Leverich, J., Kozyrakis, C.: Reconciling high server utilization and sub-millisecond quality-of-service. In: Proceedings of the Ninth European Conference on Computer Systems, pp. 4:1–4:14 (2014)
Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European Conference on Computer Systems, pp. 183–196 (2012)
Matveev, A., Shavit, N., Felber, P., Marlier, P.: Read-log-update: a lightweight synchronization mechanism for concurrent programming. In: Proceedings of the 25th Symposium on Operating Systems, pp. 168–183 (2015)
McKenney, P.E., Sarma, D., Arcangeli, A., Kleen, A., Krieger, O., Russell, R.: Read-copy update. In: Proceedings of Ottawa Linux Symposium (2002)
Mitake, H., Yamada, H., Nakajima, T.: Looking into the peak memory consumption of epoch-based reclamation in scalable in-memory database systems. In: Proceedings of the 30th International Conference on Database and Expert Systems Applications (2019)
Ousterhout, J., Gopalan, A., Gupta, A., Kejriwal, A., Lee, C., Montazeri, B., Ongaro, D., Park, S.J., Qin, H., Rosenblum, M., Rumble, S., Stutsman, R., Yang, S.: The RAMCloud storage system. ACM Trans. Comput. Syst. 33(3), 7:1–7:55 (2015)
Tu, S., Zheng, W., Kohler, E., Liskov, B., Madden, S.: Speedy transactions in multicore in-memory databases. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 18–32 (2013)
Beta release of Masstree. https://github.com/kohler/masstree-beta. Accessed 13 June 2019
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Mitake, H., Yamada, H., Nakajima, T. (2020). A Highly Scalable Index Structure for Multicore In-Memory Database Systems. In: Kotenko, I., Badica, C., Desnitsky, V., El Baz, D., Ivanovic, M. (eds) Intelligent Distributed Computing XIII. IDC 2019. Studies in Computational Intelligence, vol 868. Springer, Cham. https://doi.org/10.1007/978-3-030-32258-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-32258-8_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32257-1
Online ISBN: 978-3-030-32258-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)