Abstract
Index structures designed for disk-based database systems do not fulfill the requirements for modern database systems. To improve the performance of these index structures, different approaches are presented by several authors, including horizontal vectorization with SIMD and efficient cache-line usage.
In this work, we compare the adapted index structures Seg-Tree/Trie, FAST, VAST, and ART and evaluate the usage of SIMD within these. We extract important criteria of these adaptations and weight them according to their impact on the performance. As a result, we infer adaptations that are promising for our own index structure Elf.
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
Notes
- 1.
The first list is not important for this paper. The interested reader is referred to the original publication [6].
References
Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. In: Proceedings of the Annual Symposium on Foundations of Computer Science, pp. 399–409. IEEE (2000)
Bender, M.A., Farach-Colton, M., Kuszmaul, B.C.: Cache-oblivious string B-trees. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 233–242. ACM (2006)
Borodin, A., Mirvoda, S., Kulikov, I., Porshnev, S.: Optimization of memory operations in generalized search trees of PostgreSQL. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds.) BDAS 2017. CCIS, vol. 716, pp. 224–232. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58274-0_19
Broneske, D., Breß, S., Heimel, M., Saake, G.: Toward hardware-sensitive database operations. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 229–234 (2014)
Broneske, D., Breß, S., Saake, G.: Database scan variants on modern CPUs: a performance study. In: Jagatheesan, A., Levandoski, J., Neumann, T., Pavlo, A. (eds.) IMDM 2013-2014. LNCS, vol. 8921, pp. 97–111. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-13960-9_8
Broneske, D., Köppen, V., Saake, G., Schäler, M.: Accelerating multi-column selection predicates in main-memory - the Elf approach. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 647–658. IEEE (2017)
Broneske, D., Saake, G.: Exploiting capabilities of modern processors in data intensive applications. IT - Inf. Technol. 59(3), 133–140 (2017). https://doi.org/10.1515/itit-2016-0049
Graefe, G., Larson, P.A.: B-tree indexes and CPU caches. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 349–358. IEEE (2001)
Kim, C., et al.: FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 339–350. ACM (2010)
Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 38–49. IEEE (2013)
Polychroniou, O., Raghavan, A., Ross, K.A.: Rethinking SIMD vectorization for in-memory databases. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 1493–1508. ACM (2015)
Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: Proceedings of the International Conference on Very Large Databases (VLDB), vol. 99, pp. 78–89 (1999)
Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: ACM SIGMOD Record, vol. 29, pp. 475–486. ACM (2000)
Schlegel, B., Gemulla, R., Lehner, W.: K-ary search on modern processors. In: Proceedings of the International Workshop on Data Management on New Hardware (DaMoN), pp. 52–60. ACM (2009)
Suaib, M., Palaty, A., Pandey, K.S.: Architecture of SIMD type vector processor. Int. J. Comput. Appl. 20(4) (2011)
Yamamuro, T., Onizuka, M., Hitaka, T., Yamamuro, M.: VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal. In: Proceedings of the International Conference on Extending Database Technology (EDBT), pp. 396–407. ACM (2012)
Zeuch, S., Huber, F., Freytag, J.: Adapting tree structures for processing with SIMD instructions. In: Proceedings of the International Conference on Extending Database Technology (EDBT). Citeseer (2014)
Zukowski, M., Heman, S., Nes, N., Boncz, P.: Super-scalar RAM-CPU cache compression. In: Proceedings of the International Conference on Data Engineering (ICDE), p. 59. IEEE (2006)
Acknowledgments
We thank all reviewers for their constructive feedback. This work was partially funded by the DFG (grant no.: SA 465/50-1).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Wallewein-Eising, M., Broneske, D., Saake, G. (2018). SIMD Acceleration for Main-Memory Index Structures – A Survey. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. Facing the Challenges of Data Proliferation and Growing Variety. BDAS 2018. Communications in Computer and Information Science, vol 928. Springer, Cham. https://doi.org/10.1007/978-3-319-99987-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-99987-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99986-9
Online ISBN: 978-3-319-99987-6
eBook Packages: Computer ScienceComputer Science (R0)