Affiliation:
1. Guangdong University of Finance
Abstract
Multi-dimensional applications use tree structure to store data and space filling curves to traverse data. Most frequently used Quad-tree and Z-ordering curve are analyzed. By importing these to a HDF5 file format, a multi-dimensional data storage subsystem is constructed. Performance test results show in a sequential reading application environment, this method is feasible and efficient.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. Scott Klasky, Hasan Abbasi, Jeremy Logan, et al. In situ data processing for extreme scale computing [C]. Scientific Discovery through Advanced Computing Program (SciDAC), Denver, Colorado. 2011.
2. Top500org (2012). Retrieved 10. 29, 2012., from http: /i. top500. org/system/177556.
3. Jay Lofstead, Milo Polte, Garth Gibson, et al. Six degrees of scientific data: reading patterns for extreme scale science IO[C]. Proceedings of the 20th international symposium on High performance distributed computing, San Jose, California, USA, ACM. 2011: 49-60.
4. Volker Gaede, Oliver Guenther. Multidimensional access methods[J]. ACM Computing Surveys. 1998, 30(2): 170-231.
5. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, et al. The R*-tree: an efficient and robust access method for points and rectangles[J]. SIGMOD Rec. 1990, 19(2): 322-331.