Abstract
A compact 0-complete tree is an indexing mechanism that can be effectively used for large databases with long and variable-size keys. Compared to B-trees, compact 0-complete trees eliminate search values from secondary indices altogether. They are replaced with small surrogates whose relatively short representation is adequate for most practical key lengths. Hence the secondary indices are simply hierarchical collections of (surrogate, pointer)-pairs. However, the overall storage performance of a compact 0-complete tree structure suffers from its dependency on the distribution of keys. We complete our previous study of structural modification of 0-complete trees, which improves their space utilization by reducing page-underfilling, with the design and implementation of coupled retrieval and maintenance algorithms. This is achieved by introducing the notion of a sequence set that is analogous to that of B\(^{+}\)-trees.
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
Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121–137 (1979)
Dai, H.K., Furusawa, K.: Improving the storage utilization of \(0\)-complete trees as index structures. In: Dang, T.K., Kung, J., Chung, T.M. (eds.) Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications. FDSE 2022. CCIS, vol. 1688, pp. 88–102 Springer, Singapore (2022). https://doi.org/10.1007/978-981-19-8069-5_6
Dai, H.K., Furusawa, K.: On the storage utilization of \(0\)-complete trees as index structures. Computer Science Department, Oklahoma State University, Technical report TR-23-01, October 2023
Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing – a fast access method for dynamic files. ACM Trans. Database Syst. 4(3), 315–344 (1979)
Folk, M.J., Zoellick, B.: File Structures, Second Edition. Addison-Wesley, Boston (1992)
Fredkin, E.: Many-way information retrieval. Commun. ACM 3, 490–500 (1960)
Orlandic, R.: Design, analysis and applications of compact 0-complete trees. PhD thesis, Department of Computer Science, University of Virginia (1989)
Orlandic, R., Mahmoud, H.M.: Storage overhead of O-trees, B-trees and prefix B-trees: a comparative analysis. Int. J. Found. Comput. Sci. 7(3), 209–226 (1996)
Orlandic, R., Pfaltz, J.L.: Compact 0-complete trees. In: Proceedings of the Fourteenth Conference on Very Large Databases, pp. 372–381. Association for Computing Machinery and IEEE Computer Society, August 1988
Orlandic, R., Pfaltz, J.L.: Q\(_{0}\)-tree: a dynamic structure for accessing spatial objects with arbitrary shapes. Institute for Parallel Computation, University of Virginia, Technical Report IPC-TR-91-010, December 1991
Orlandic, R., Pfaltz, J.L.: Compact 0-complete trees: a new method for searching large files. Institute for Parallel Computation, University of Virginia, Technical report IPC-TR-88-001, January 1988
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dai, H.K., Furusawa, K. (2023). Maintenance Algorithms for 0-Complete Trees with Improved Space Utilization. In: Dang, T.K., Küng, J., Chung, T.M. (eds) Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications. FDSE 2023. Communications in Computer and Information Science, vol 1925. Springer, Singapore. https://doi.org/10.1007/978-981-99-8296-7_4
Download citation
DOI: https://doi.org/10.1007/978-981-99-8296-7_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-8295-0
Online ISBN: 978-981-99-8296-7
eBook Packages: Computer ScienceComputer Science (R0)