scholarly journals OpenCL Implementation of a Parallel Universal Kriging Algorithm for Massive Spatial Data Interpolation on Heterogeneous Systems

2016 ◽  
Vol 5 (6) ◽  
pp. 96 ◽  
Author(s):  
Fang Huang ◽  
Shuanshuan Bu ◽  
Jian Tao ◽  
Xicheng Tan
Keyword(s):  
Spatial Data ◽  
Heterogeneous Systems ◽  
Universal Kriging ◽  
Data Interpolation ◽  
Massive Spatial Data

Parallel Queries of Cluster-Based k Nearest Neighbor in MapReduce

2016 ◽  
pp. 163-182
Author(s):  
Wei Yan
Keyword(s):  
Spatial Data ◽  
Spatial Databases ◽  
Nearest Neighbor ◽  
Programming Model ◽  
K Nearest Neighbor ◽  
K Nearest Neighbors ◽  
Data Intensive ◽  
Parallel Queries ◽  
Massive Spatial Data ◽  
Nearest Neighbor Queries

Parallel queries of k Nearest Neighbor for massive spatial data are an important issue. The k nearest neighbor queries (kNN queries), designed to find k nearest neighbors from a dataset S for every point in another dataset R, is a useful tool widely adopted by many applications including knowledge discovery, data mining, and spatial databases. In cloud computing environments, MapReduce programming model is a well-accepted framework for data-intensive application over clusters of computers. This chapter proposes a parallel method of kNN queries based on clusters in MapReduce programming model. Firstly, this chapter proposes a partitioning method of spatial data using Voronoi diagram. Then, this chapter clusters the data point after partition using k-means method. Furthermore, this chapter proposes an efficient algorithm for processing kNN queries based on k-means clusters using MapReduce programming model. Finally, extensive experiments evaluate the efficiency of the proposed approach.

Research on Multiple Spatial Data Gathering Mechanism Based on Geo-Information Browser

2013 ◽  
Vol 765-767 ◽  
pp. 1287-1290
Author(s):  
Ken Chen ◽  
Fang Wang ◽  
Fang Miao ◽  
Fu Chao Cheng
Keyword(s):  
Spatial Data ◽  
Data Exchange ◽  
Data Gathering ◽  
Basic Research ◽  
Information Gathering ◽  
Digital Earth ◽  
Organization And Management ◽  
And Performance ◽  
S Model ◽  
Massive Spatial Data

The spatial data presented several characteristics of mass, multiple, isomerism and multiple tenses, its organization and management mechanism is an important direction of research for Digital Earth. The management of grave emergency with regards to a series of spatial and non-spatial data concerning gathering and handling, having put a higher demand forward the ability of information gathering mechanism on client. The current existing client access mechanism such as C/S model lacks of unified data exchange standards, similarly, B/S model cannot handle the spatial data effectively. It is also difficulty to display for complex and massive spatial data in visualized and real-time. That efficiency depends entirely on the network environment and performance of storage equipment. In order to realize the massive spatial data unified dispatching and efficient sharing based on the principle of Information-gathering and Service-polymerization. We put forward a concept of Spatial-data-cloud which based on G/S model, supported by HGML as the standard and criterion of spatial data exchange, presentation, organization, storage and management. It could also be set up a new work mechanism which use Geo-information browser polymerization multiple and massive complex spatial and non-spatial data. This will provide us a lightweight client called Geo-information browser with which is by the principle Information-gathering and Service-polymerization. It provides emergency management for technical supports such as intelligent decision support, comprehensive research and judgment, and rapid disposal etc. It is the development of basic research of a novel model of Digital Earth.

Research on the Metadata Storage Mode and Efficiency of Distributed File System Based on HGML

2010 ◽  
Vol 40-41 ◽  
pp. 221-227 ◽  
Author(s):  
Fang Miao ◽  
Fu Chao Cheng ◽  
Wen Hui Yang ◽  
Li Tan
Keyword(s):  
Spatial Data ◽  
File System ◽  
Distributed File System ◽  
Entire System ◽  
The Core ◽  
Different Characteristics ◽  
Massive Spatial Data ◽  
Access Efficiency

In the G / S mode, in order to meet the storage demands of massive spatial data, the requirements of the distributed file system (DFS) on back-end servers are extremely high. As one of the core tasks of DFS, the metadata storage is the necessary premise which ensures the reliability and efficiency of the entire system. This paper introduces a metadata storage mode based on HGML, and then designs and implements two solutions, which are scattered storage and integrated storage. According to the different characteristics of the two solutions, access efficiency of the metadata has been tested respectively. The result shows that the new metadata storage mode can basically satisfy the storage demands of massive spatial data.

scholarly journals SPATIAL DATA INTERPOLATION

2018 ◽  
Vol 2 (4) ◽  
Author(s):  
Prof.RAE ZH Aliyev
Keyword(s):  
Heavy Metals ◽  
Heavy Metal ◽  
Spatial Distribution ◽  
Spatial Data ◽  
Movement Speed ◽  
Data Interpolation ◽  
Heavy Metal Concentrations ◽  
Groundwater Movement ◽  
Record Data ◽  
Inverse Distance

During the study and adjustment, techniques revealed our analysis of spatial data in vector format. The latter is best suited for the spatial analysis of discrete objects. However, when the spatial variable is represented as a field of scalar or vector greatness (for example, the spatial distribution of concentrations of heavy metal concentrations in soils or groundwater movement speed field). Convenient ways to record data is bitmap format. This approach is most often used for phenomena of processes that are characterized by considerable anisotropy. However, the characteristic feature of the method of inverse distance is the fact that the interpolated value in measured point is equal to the measured value. Key words: erosion, soil; heavy metals, extremum, spatial data, raster data anti-erosion measures

Sign in / Sign up

Export Citation Format

Share Document