Abstract
In the Big Data era, complex data structures are usually too big to reside in main memory. Traditional serialization mechanism can only read a tree from the disk or write a tree to the disk as a whole. When the tree gets huge, memory consumption to hold the whole tree becomes the bottleneck. To solve this problem, one need to be able to read or write only part of the tree only when necessary. We propose an on-demand serialization mechanism that can read or write tree nodes one at a time while keep the logical structure intact. The mechanism is implemented in the GeDBIT (Generalized Distance-Based Index Tree) system in C++. Empirical results demonstrate the functionality and efficiency of our mechanism.
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
Stanley B.: Lippman Barbara, E.: Moo JoséeLaJoie.: C++ primer
Boost Library Documentation
Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24(3), 361–404 (1999)
MoBIoS test suite, http://aug.csres.utexas.edu/mobiosworkload
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
Uhlmann, J.K.: Satisfying General Proximity/Similarity Queries with Metric Trees. Information Processing Letter 40(4), 175–179 (1991)
SISAP test suite, http://sisap.org/Metric_Space_Library.html
Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: Peckman, J.M., Ram, S., Franklin, M. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1997), May 13-15, pp. 357–368. ACM Press, New York (1997)
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
Li, Q., Zhang, H., Lei, F., Liu, G., Lu, M., Mao, R. (2014). An On-demand Serialization Mechanism for Trees. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-09265-2_34
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09264-5
Online ISBN: 978-3-319-09265-2
eBook Packages: Computer ScienceComputer Science (R0)