spatial data declustering is an important data processing method for parallel spatial database especially in shared nothing parallel architecture. spatial data declustering can achieve parallel dataflow to exploit the...
详细信息
spatial data declustering is an important data processing method for parallel spatial database especially in shared nothing parallel architecture. spatial data declustering can achieve parallel dataflow to exploit the I/O bandwidth of multiple parallel nodes by reading and writing them in parallel,which can improve the performance of parallel spatial database evidently. Aiming at the unique spatial objects locality,this paper presents a novel spatial data declustering method,which uses Hilbert space-filling curve to impose a linear ordering on multidimensional spatial objects,and to partition spatial objects logical segments according to this ordering to preserve spatial locality of spatial objects,and then to allocate logical segments to physical parallel nodes based on round-robin rule. Experimental results show that the proposed method can obtain well spatial data declustering results.
In order to handle massive spatial data quickly and efficiently, a superior solution is to store and handle them in parallel spatial database management systems under the environment of PC cluster at present, and thus...
详细信息
ISBN:
(纸本)9780819465290
In order to handle massive spatial data quickly and efficiently, a superior solution is to store and handle them in parallel spatial database management systems under the environment of PC cluster at present, and thus its spatial partitioning strategy of data needs solving first. Hilbert spatial ordering code based on Hilbert space-filling curve is an excellent linear mapping method, and gets wider and wider applications in processing spatial data. After studying Hilbert curve, this paper proposes a new and efficient algorithm for the generation of Hilbert code, and it has overcome drawbacks of the traditional algorithm. Then Hilbert code is applied to spatial partitioning with the method of cluster analysis, and a concrete method is given, which fully considers characteristics of spatial data, such as the aggregation of spatial data, reduces the time of disks accesses, and achieves better performance by experiments than the compulsory partitioning of ORACLE spatial based on X coordinate values and (or) Y coordinate values in subsequent parallel processing of spatial data.
A novel Hilbert-curve is introduced for parallelspatial data partitioning, with consideration of the huge-amount property of spatial information and the variable-length characteristic of vector data items. Based on t...
详细信息
A novel Hilbert-curve is introduced for parallelspatial data partitioning, with consideration of the huge-amount property of spatial information and the variable-length characteristic of vector data items. Based on the improved Hilbert curve, the algorithm can be designed to achieve almost-uniform spatial data partitioning among multiple disks in parallel spatial databases. Thus, the phenomenon of data imbalance can be significantly avoided and search and query efficiency can be enhanced.
暂无评论