A Multi-dimensional Data Storage Using Quad-tree and Z-Ordering
Fang Hou, Chenghui Huang, Jiyuan Lu
Available Online March 2013.
- 10.2991/iccsee.2013.541How to use a DOI?
- storage, multi-dimensional, performance, data structure,
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.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Fang Hou AU - Chenghui Huang AU - Jiyuan Lu PY - 2013/03 DA - 2013/03 TI - A Multi-dimensional Data Storage Using Quad-tree and Z-Ordering BT - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013) PB - Atlantis Press SP - 2149 EP - 2152 SN - 1951-6851 UR - https://doi.org/10.2991/iccsee.2013.541 DO - 10.2991/iccsee.2013.541 ID - Hou2013/03 ER -