Spatial partitioning of massive data based on Hilbert spatial ordering code

Geomatics and Information Science of Wuhan University

Volumn 32, Issue 7, 2007, Pages 650-653

  Wang, Yongjie ^a   Meng, Lingkui ^a   Zhao, Chunyu ^a  

^a WUHAN UNIVERSITY   (China)

Author keywords

Hilbert spatial ordering code; PC cluster; Spatial partitioning of data

Indexed keywords

CLUSTERING ALGORITHMS; CODES (SYMBOLS); DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS;

HILBERT SPATIAL ORDERING CODE; LINEAR MAPPING; SPATIAL PARTITIONING;

MAPPING;

ALGORITHM; CLUSTER ANALYSIS; DATABASE; EFFICIENCY MEASUREMENT; MAPPING METHOD; PERFORMANCE ASSESSMENT; SPATIAL ANALYSIS; SPATIAL DATA;

EID: 34548268636     PISSN: 16718860     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Chinese source.
2. Chinese source.
3. Tetsuo A, Desh R, Thomas R, et al. Space-Filling Curves and Their Use in the Design of Geometric Data Structures[J]. Theoretical Computer Science, 1997, 181(1): 3-15
4. Lawder J K, King P J H. Using Space-Filling Curves for Multi-dimensional Indexing [C]. The 17th British National Conference on Databases: Advances in Databases, London, 2000
5. Breinholt G, Schierz C. Algorithm 781: Generating Hilbert' s Space-Filling Curve by Recursion [J]. ACM Transactions on Mathematical Software, 1998, 24(2): 184-189
6. Kamel I, Faloutsos C. Hilbert R-tree: an Improved R-tree Using Fractals[C]. The 1994 International Conference on VLDB, Morgan Kaufmann, 1994
7. Faloutsos C, Roseman S. Fractals for Secondary Key Retrieval [C]. The 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database System, New York, 1989
8. Kamel I, Faloutsos C. On Packing R-trees[C]. The 2nd International Conference on Information and Knowledge Management, New York, 1993