Fully distributed R-tree for efficient range query dissemination in peer-to-peer spatial data grid

Abstract

To make the diverse organizations access the massive distributed heterogeneous spatial data easily, we build a Spatial Data Grid in peer-to-peer way, which composed of several spatial datacenters distributed in different agencies. Given a query, which often a range query in spatial application, the query parser will decompose the global query into several sub-queries and disseminate them to the peers who take responsibility for storing data of that area. In order to accelerate the query dissemination process, we utilize distributed index to locate object more quickly and accurately. We propose an adaptive indexing mechanism, Fully Distributed R-Tree Index, which is appropriate for efficient range query dissemination. It composes of two layers, on top of which is the spatial range of each peer. The under layer stores part of the R-Tree of each peer's neighbors, which can be adjusted according to the capacity of peer. There is no centralized control on top of the entire system, and it could adaptive to the environment change.

Architecture and key technologies of grid geographic information system

“…We designed and then accomplished a relation model based global directory organization method, which offers an effective way for geospatial resource directory data management, manipulation and update [17] . At the same time, we brought forward a novel index method for finding geospatial computation resource fast [11] . Furthermore, we designed the methods to achieve consistency of the global resource directory [17] (Figure 3).…”

“…Global resource directory abstracts many concrete parameters like data schema, metadata, read/write status, etc., to a series of keywords. It also dynamically aggregates the MBR of nodes while they join or leave the system to build the globally distributed geospatial index which supports the complex geospatial query [11] .…”