Abstract
B-slack trees a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(log b n), where b is the maximum node degree. Updates can be performed in \(O(\log_{\frac b 2} n)\) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnow, D.M., Tenenbaum, A.M.: An empirical comparison of B-trees, compact B-trees and multiway trees. ACM SIGMOD Record 14, 33–46 (1984)
Arnow, D.M., Tenenbaum, A.M., Wu, C.: P-trees: Storage efficient multiway trees. In: Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 111–121. ACM (1985)
Baeza-Yates, R.A., Larson, P.-A.: Performance of B+-trees with partial expansions. IEEE Transactions on Knowledge and Data Eng. 1(2), 248–257 (1989)
Bayer, R., McCreight, E.: Organization and maintenance of large indexes. Technical Report D1-82-0989, Boeing Scientific Research Laboratories (1970)
Brönnimann, H., Katajainen, J., Morin, P.: Putting your data structure on a diet. CPH STL Rep, 1 (2007)
Brown, T., Ellen, F., Ruppert, E.: A general technique for non-blocking trees. In: Proc. of the 19th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, PPoPP 2014, pp. 329–342. ACM, New York (2014)
Culik II, K., Ottmann, T., Wood, D.: Dense multiway trees. ACM Transactions on Database Systems (TODS) 6(3), 486–512 (1981)
Huang, S.-H.S.: Height-balanced trees of order (β, γ, δ). ACM Trans. Database Syst. 10(2), 261–284 (1985)
Küspert, K.: Storage utilization in B*-trees with a generalized overflow technique. Acta Informatica 19(1), 35–55 (1983)
Larsen, K., Soisalon-Soininen, E., Widmayer, P.: Relaxed balance through standard rotations. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 450–461. Springer, Heidelberg (1997)
Rosenberg, A.L., Snyder, L.: Compact B-trees. In: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, SIGMOD 1979, pp. 43–51. ACM, New York (1979)
Srinivasan, B.: An adaptive overflow technique to defer splitting in B-trees. The Computer Journal 34(5), 397–405 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Brown, T. (2014). B-slack Trees: Space Efficient B-Trees. In: Ravi, R., Gørtz, I.L. (eds) Algorithm Theory – SWAT 2014. SWAT 2014. Lecture Notes in Computer Science, vol 8503. Springer, Cham. https://doi.org/10.1007/978-3-319-08404-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-08404-6_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08403-9
Online ISBN: 978-3-319-08404-6
eBook Packages: Computer ScienceComputer Science (R0)