Abstract
In a bulk update of a search tree a set of individual updates (insertions or deletions) is brought into the tree as a single transaction. In this paper, we present a bulk-insertion algorithm for the class of (a,b)-trees (including B + -trees). The keys of the bulk to be inserted are divided into subsets, each of which contains keys with the same insertion place. From each of these sets, together with the keys already in the insertion place, an (a,b)-tree is constructed and substituted for the insertion place. The algorithm performs the rebalancing task in a novel manner minimizing the number of disk seeks required. The algorithm is designed to work in a concurrent environment where concurrent single-key actions can be present.
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
Preview
Unable to display preview. Download preview PDF.
References
Arge, L.: The buffer tree: a technique for designing batched external data structures. Algorithmica 37, 1–24 (2003)
Arge, L., Hinrichs, K.H., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithmica 33, 104–128 (2002)
Brown, M.R., Tarjan, R.E.: Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing 9, 594–614 (1980)
Chen, L., Choubey, R., Rundensteiner, E.A.: Merging R-trees: Efficient strategies for local bulk insertion. GeoInformatica 6, 7–34 (2002)
Hoffmann, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E.: Sorting Jordan sequences in linear time using level-linked search trees. Information and Control 68, 170–184 (1986)
Huddleston, S., Mehlhorn, K.: A new data structure for representing sorted lists. Acta Informatica 17, 157–184 (1982)
Jacobsen, L., Larsen, K.S., Nielsen, M.N.: On the existence and construction of non-extreme (a,b)-trees. Information Processing Letters 84, 69–73 (2002)
Jermaine, C., Datta, A., Omiecinski, E.: A novel index supporting high volume data warehouse insertion. In: Proceedings of the 25th International Conference on Very Large Databases, pp. 235–246. Morgan Kaufmann Publishers, San Francisco (1999)
Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and recovery in generalized search trees. In: Proceedings of the 1997 SIGMOD Conference, SIGMOD Record, vol. 26, pp. 62–72. ACM Press, New York (1997)
Larsen, K.S.: Relaxed multi-way trees with group updates. Journal of Computer and System Sciences 66, 657–670 (2003)
Malmi, L., Soisalon-Soininen, E.: Group updates for relaxed height-balanced trees. In: Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 358–367. ACM Press, New York (1999)
Mehlhorn, K.: Data Structures and Algorithms. Sorting and Searching, vol. 1. Springer, Heidelberg (1984)
Moffat, A., Petersson, O., Wormald, N.C.: A tree-based mergesort. Acta Informatica 35, 775–793 (1998)
Pollari-Malmi, K.: Batch updates and concurrency control in B-trees. Ph.D.Thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Report A38/02 (2002)
Pollari-Malmi, K., Soisalon-Soininen, E., Ylönen, T.: Concurrency control in Btrees with batch updates. IEEE Transactions on Knowledge and Data Engineering 8, 975–984 (1996)
Sagiv, Y.: Concurrent operations on B*-trees with overtaking. Journal of Computer and System Sciences 33, 275–296 (1986)
Tao, Y., Papadias, D.: Adaptive index structures. In: Proceedings of the 28th Conference on Very Large Data Bases, pp. 418–429. Morgan Kaufmann Publishers, San Francisco (2002)
Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6, 306–318 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pollari-Malmi, K., Soisalon-Soininen, E. (2004). Concurrency Control and I/O-Optimality in Bulk Insertion. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30213-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23210-0
Online ISBN: 978-3-540-30213-1
eBook Packages: Springer Book Archive