Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Building a scaleable geo-spatial DBMS: technology, implementation, and evaluation
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Distributing a database for parallelism
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Data Partitioning for Parallel Spatial Join Processing
Geoinformatica
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
IEEE Transactions on Knowledge and Data Engineering
Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Parallel Processing of Spatial Joins Using R-trees
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Spatial Join Strategies in Distributed Spatial DBMS
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Data Partitioning for Parallel Spatial Join Processing
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Parallel Spatial Join Algorithms Using Grid Files
DANTE '99 Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments
Data-parallel primitives for spatial operations using PM quadtrees
CAMP '95 Proceedings of the Computer Architectures for Machine Perception
Parallel Spatial Joins Using Grid Files
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
A strategy for optimizing a multi-site query in a distributed spatial database
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
In recent years, there have been needs of accessing spatial data from distributed and preexisting spatial database systems interconnected through a network. In a distributed environment, spatial joins for two spatial relations residing at geographically separated sites are expensive in terms of computation and transmission cost because of the large size and complexity of spatial data. Previous distributed algorithm based on the spatial semijoin has accomplished performance improvements by eliminating objects before transmission to reduce both transmission and local processing costs. But with a widespread of a high bandwidth data transmission, the parallelism through data redistribution may improve the performance of spatial joins in spite of additional transmission costs. Hence, we propose a parallel spatial join processing for distributed spatial databases. We apply the task distribution method minimizing the data transmission and the solution for task distribution using a graph partitioning method. In experiments, we showed that the proposed method provides useful reductions in the cost of evaluating a join.