Abstract
The paper presents an ongoing study to maximize query performance for tree-like structures on the GPUs platform. We formalized the problem with an assignment problem for minimizing the number of global memory accesses. We also conduct experiments to identify the benefits of query performance optimization.
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
Similar content being viewed by others
References
CUDA C++ Programming Guide. https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html. Accessed 7 Oct 2022
Zhang, W., Yan, Z., Lin, Y., Zhao, C., Peng, L.: A high throughput B+tree for SIMD architectures. IEEE Trans. Parallel Distrib. Syst. 31, 707–720 (2020)
Awad, M.A., Ashkiani, S., Johnson, R., Farach-Colton, M., Owens, J.D.: Engineering a high-performance GPU B-tree. In: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (2019)
Xie, Z., Cai, Q., Jagadish, H.V., Ooi, B.C., Wong, W.: PI: a parallel in-memory skip list based index (2016)
Zhang, J., et al.: S3: a scalable in-memory skip-list index for key-value store. Proc. VLDB Endow. 12, 2183–2194 (2019)
Gregg, C., Hazelwood, K.M.: Where is the data? Why you cannot debate CPU vs. GPU performance without the answer. In: (IEEE ISPASS) IEEE International Symposium on Performance Analysis of Systems and Software, pp. 134–144 (2011)
Bakkum, P., Skadron, K.: Accelerating SQL database operations on a GPU with CUDA. GPGPU-3 (2010)
Kim, C., 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 (2010)
Kaczmarski, K.: Experimental B+-tree for GPU. ADBIS (2011)
Jin, G., Endo, T., Matsuoka, S.: A multi-level optimization method for stencil computation on the domain that is bigger than memory capacity of GPU. In: 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and PHD Forum, pp. 1080–1087 (2013)
Rawat, P.S., Rastello, F., Sukumaran-Rajam, A., Pouchet, L., Rountev, A., Sadayappan, P.: Register optimizations for stencils on GPUs. In: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (2018)
Jin, G., Endo, T., Matsuoka, S.: A parallel optimization method for stencil computation on the domain that is bigger than memory capacity of GPUs. In: 2013 IEEE International Conference on Cluster Computing (CLUSTER), pp. 1–8 (2013)
Acknowledgment
Che-Wei Chang and Hung-Chang Hsiao were partially supported by the Intelligent Manufacturing Research Center (iMRC) from The Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education (MOE) and Ministry of Science and Technology (MOST) under Grant NSTC 111-2222-E-034-002 - in Taiwan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Chang, CW., Zhang, X., Hsiao, HC. (2022). Query Regrouping Problem on Tree Structure for GPUs Accelerated Platform. In: Hsieh, SY., Hung, LJ., Klasing, R., Lee, CW., Peng, SL. (eds) New Trends in Computer Technologies and Applications. ICS 2022. Communications in Computer and Information Science, vol 1723. Springer, Singapore. https://doi.org/10.1007/978-981-19-9582-8_18
Download citation
DOI: https://doi.org/10.1007/978-981-19-9582-8_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-9581-1
Online ISBN: 978-981-19-9582-8
eBook Packages: Computer ScienceComputer Science (R0)