Share Email Print
cover

Proceedings Paper

Fully distributed R-tree for efficient range query dissemination in peer-to-peer spatial data grid
Author(s): Dafei Yin; Bin Chen; Yu Fang; Zhou Huang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 25 July 2007
PDF: 8 pages
Proc. SPIE 6753, Geoinformatics 2007: Geospatial Information Science, 67530G (25 July 2007); doi: 10.1117/12.761369
Show Author Affiliations
Dafei Yin, Peking Univ. (China)
Bin Chen, Peking Univ. (China)
Yu Fang, Peking Univ. (China)
Zhou Huang, Peking Univ. (China)


Published in SPIE Proceedings Vol. 6753:
Geoinformatics 2007: Geospatial Information Science

© SPIE. Terms of Use
Back to Top