Advertisement

An On-demand Serialization Mechanism for Trees

  • Qiaozhi Li
  • He Zhang
  • Fuli Lei
  • Gang Liu
  • Minhua Lu
  • Rui Mao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8351)

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.

Keywords

Serialization I/O index memory data 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Stanley B.: Lippman Barbara, E.: Moo JoséeLaJoie.: C++ primerGoogle Scholar
  2. 2.
    Boost Library DocumentationGoogle Scholar
  3. 3.
    Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24(3), 361–404 (1999)CrossRefGoogle Scholar
  4. 4.
  5. 5.
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Uhlmann, J.K.: Satisfying General Proximity/Similarity Queries with Metric Trees. Information Processing Letter 40(4), 175–179 (1991)CrossRefzbMATHGoogle Scholar
  7. 7.
  8. 8.
    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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Qiaozhi Li
    • 1
  • He Zhang
    • 1
  • Fuli Lei
    • 1
  • Gang Liu
    • 1
  • Minhua Lu
    • 2
  • Rui Mao
    • 1
  1. 1.Guangdong Province Key Laboratory of Popular High Performance Computers, College of Computer Science and Software EngineeringShenzhen UniversityShenzhenChina
  2. 2.School of MedicineShenzhen UniversityShenzhenChina

Personalised recommendations