Abstract
Index structures such as B-trees are important tools that DBAs use to enhance the performance of data access. However, with the approaching of the big data era, the amount of data generated in different domains have exploded. A recent study has shown that indexes consume about 55% of total memory in a state-of-the-art in-memory DBMS. Building indexes in traditional ways have encountered a bottleneck. Recent work proposes to use neural network models to replace B-tree and many other indexes. However, the proposed model is heavy, inaccuracy, and has failed to consider model updating. In this paper, a novel, simple learned index called adaptive single layer model is proposed to replace the B-tree index. The proposed model, using two data partition methods, is well-organized and can be applied to different workloads. Updating is also taken into consideration. The proposed model incorporates two data partition methods is evaluated in two datasets. The results show that the prediction error is reduced by around 50% and demonstrate that the proposed model is more accurate, stable and effective than the currently existing model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kraska, T., Beutel, A., Chi, E.H., et al.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, pp. 489–504. ACM (2018)
Shazeer, N., Mirhoseini, A., Maziarz, K., et al. Outrageously large neural networks: the sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538 (2017)
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. In: Broy, M., Denert, E. (eds.) Software Pioneers, pp. 245–262. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-642-59412-0_15
Galakatos, A, Markovitch, M, Binnig, C, et al.: A-tree: a bounded approximate index structure. arXiv preprint arXiv:1801.10207 (2018)
Abadi, M., Barham, P., Chen, J., et al.: TensorFlow: a system for large-scale machine learning. In: OSDI 2016, pp. 265–283 (2016)
Graefe, G., Larson, P.A.: B-tree indexes and CPU caches. In: 2001 Proceedings of the 17th International Conference on Data Engineering, pp. 349–358. IEEE (2001)
Richter, S., Alvarez, V., Dittrich, J.: A seven-dimensional analysis of hashing methods and its implications on query processing. Proc. VLDB Endow. 9(3), 96–107 (2015)
Fan, B., Andersen, D.G., Kaminsky, M., et al.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, pp. 75–88. ACM (2014)
Alexiou, K., Kossmann, D., Larson, P.Å.: Adaptive range filters for cold data: avoiding trips to Siberia. Proc. VLDB Endow. 6(14), 1714–1725 (2013)
Zhang, H., Andersen, D.G., Pavlo, A., et al.: Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1567–1581. ACM (2016)
Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: ACM SIGMOD Record, vol. 29, no. 2, pp. 475–486. ACM (2000)
Lehman, T.J., Carey, M.J.: A study of index structures for main memory database management systems. In: Proceedings of the VLDB, p. 1 (1986)
Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acta Inform. 1(4), 290–306 (1972)
Boyar, J., Larsen, K.S.: Efficient rebalancing of chromatic search trees. J. Comput. Syst. Sci. 49(3), 667–682 (1994)
Kim, C., Chhugani, J., Satish, N., et al.: FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 339–350. ACM (2010)
Shahvarani, A., Jacobsen, H.A.: A hybrid B+-tree as solution for in-memory indexing on CPU-GPU heterogeneous computing platforms. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1523–1538. ACM (2016)
Kaczmarski, K.: B+-tree optimized for GPGPU. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7566, pp. 843–854. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33615-7_27
Athanassoulis, M., Ailamaki, A.: BF-tree: approximate tree indexing. Proc. VLDB Endow. 7(14), 1881–1892 (2014)
Graefe, G.: B-tree indexes, interpolation search, and skew. In: Proceedings of the 2nd International Workshop on Data Management on New Hardware, p. 5. ACM (2006)
OpenStreetMap. https://www.openstreetmap.org
Transaction Processing Performance Council. http://www.tpc.org/tpch/
Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. Database Syst. (TODS) 2(1), 11–26 (1977)
Zukowski, M., Heman, S., Nes, N., et al.: Super-scalar RAM-CPU cache compression. In: 2006 Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 59. IEEE (2006)
Acknowledgement
This work is supported by National Key R&D Program of China (No. 2017YFC0803700), NSFC grants (No. 61532021), Shanghai Knowledge Service Platform Project (No. ZF1213) and SHEITC.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, X., Li, J., Wang, X. (2019). ASLM: Adaptive Single Layer Model for Learned Index. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11448. Springer, Cham. https://doi.org/10.1007/978-3-030-18590-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-18590-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18589-3
Online ISBN: 978-3-030-18590-9
eBook Packages: Computer ScienceComputer Science (R0)