Towards Data-Based Cache Optimization of B+-Trees-Reference-Cited by-同舟云学术

Towards Data-Based Cache Optimization of B+-Trees

Published:2023-06-18 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th International Workshop on Data Management on New Hardware
language:
Short-container-title:

Author:

Kühn Roland¹^ORCID,Biebert Daniel¹^ORCID,Hakert Christian¹^ORCID,Chen Jian-Jia²^ORCID,Teubner Jens²^ORCID

Affiliation:

1. TU Dortmund University, DE

2. TU Dortmund University, DE and Lamarr Institute for Machine Learning and Artificial Intelligence, Germany

Funder

Deutsche Forschungsgemeinschaft

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3592980.3595316

Reference22 articles.

1. Kuan-Hsun Chen , Chiahui Su , Christian Hakert , Sebastian Buschjäger , Chao-Lin Lee , Jenq-Kuen Lee , Katharina Morik , and Jian-Jia Chen . 2022. Efficient realization of decision trees for real-time inference. ACM transactions on embedded computing systems 21, 6 ( 2022 ), 1–26. Kuan-Hsun Chen, Chiahui Su, Christian Hakert, Sebastian Buschjäger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. 2022. Efficient realization of decision trees for real-time inference. ACM transactions on embedded computing systems 21, 6 (2022), 1–26.

2. Fractal prefetching B+-Trees

3. Goetz Graefe. 2003. Sorting And Indexing With Partitioned B-Trees.. In CIDR Vol. 3. Citeseer 5–8. Goetz Graefe. 2003. Sorting And Indexing With Partitioned B-Trees.. In CIDR Vol. 3. Citeseer 5–8.

4. Goetz Graefe 2011. Modern B-tree techniques. Foundations and Trends® in Databases 3, 4 ( 2011 ), 203–402. Goetz Graefe 2011. Modern B-tree techniques. Foundations and Trends® in Databases 3, 4 (2011), 203–402.

5. B-tree indexes and CPU caches