Optimizing distributed spatial joins using R-Trees

Authors:
Orlando Karam;Fred Petry
Affiliations:
Southern Polytechnic State University;Tulane University
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Year:
2005

Citing 10
Cited 1

Redundancy in spatial databases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Cost Models for Spatial Queries Using R-Trees

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
Cost Models for Join Queries in Spatial Databases

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Spatial Join Strategies in Distributed Spatial DBMS

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Optimizing distributed spatial joins

Optimizing distributed spatial joins

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the basic problems in distributed databases is how to efficiently perform distributed joins. Spatial databases are particularly appropriate for distribution, but we need special techniques to deal with spatial data efficiently.In this work we study the distributed spatial join problem and how to perform this operation efficiently. We develop cost models for estimating the cost of this operation. We study the issues involved in optimizing it and develop specific techniques using R-Trees. Our techniques outperform other widely-used approaches for this operation.