KEYWORDS: Databases, Computer simulations, Roads, Associative arrays, Explosives, Data processing, Lithium, Current controlled current source, Multiplexing, Computing systems
Parallelism of spatial index could significantly improve the performance of spatial queries, special for massive spatial
databases, so the research of parallel spatial index takes a important role in high performance spatial databases. Existing
parallel spatial index methods have two main shortcoming: one is accessing hotspot and bottleneck of index items
located in main server, the other is high costs and complicated operations for maintaining index consistency. Aim at
these, a distributed parallel spatial index structure called DPR-tree is proposed. It splits whole index region into partition
sub-regions by using Hilbert space-filling curve grid and organizes index sub-regions according to locality of spatial
objects, then maps index sub-regions to partition sub-regions and assigns these index sub-regions to different computer
nodes by a appointed map function, Each computer node manages a multi-level distributed sub-Rtree which is built from
a index sub-region. Our experimental results indicate that the proposed parallel spatial index can achieve speedup well
and offer significant potential for reducing query response time.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.