Abstract
In this paper, practical and statistical analysis between B-tree and Buffer tree has been presented. Through this paper, the reader can very well understand, what is the practical implementation of B-tree and Buffer tree, how it gives a solution to the indexing problem in databases, how the communication between internal memory and external memory delays the total I/Os time period, how it can be solved out with adding buffers on every node of the B-tree, and how this batched data structure would give rise to the development to the external algorithms and make a difference in total I/Os and time difference in the program.
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
Arge L (2003) The buffer tree: a technique for designing batched external data structures. Algorithmica 37(1):1–24
Dominic SJ, Sajith G (2004) The persistent buffer tree: an I/O-efficient index for temporal data. arXiv preprintcs/0404033
Arge L, Danner A, Teh S-M (2003) I/O-efficient point location using persistent B-trees. J Exp Algorithmics (JEA) 8:1–2
Arge L (1995) The buffer tree: a new technique for optimal I/O-algorithms. In; Workshop on algorithms and data structures. Springer, Berlin, Heidelberg, pp 334–345
Comer D (1979) Ubiquitous B-tree. ACM Comput Surv (CSUR) 11(2):121–137
Grigore R, Kiefer S (2015) Tree buffers. In: International conference on computer aided verification. Springer, Cham, pp 290–306
Sitchinava N, Zeh N (2012) A parallel buffer tree. In: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures, pp 214–223
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Harshit, S., Santosh, V. (2021). B-Tree Versus Buffer Tree: A Review of I/O Efficient Algorithms. In: Sheth, A., Sinhal, A., Shrivastava, A., Pandey, A.K. (eds) Intelligent Systems. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-16-2248-9_40
Download citation
DOI: https://doi.org/10.1007/978-981-16-2248-9_40
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-2247-2
Online ISBN: 978-981-16-2248-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)