Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 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
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Fundamentals of Computer Alori
Fundamentals of Computer Alori
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Querying by Spatial Structure
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Approximate spatio-temporal retrieval
ACM Transactions on Information Systems (TOIS)
ACM Transactions on Database Systems (TODS)
Complex Spatial Query Processing
Geoinformatica
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
A Joinless Approach for Mining Spatial Colocation Patterns
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on Database Systems (TODS)
Multi-way spatial join selectivity for the ring join graph
Information and Software Technology
On estimating result sizes of multi-way spatial joins
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
| Hi-index | 0.00 |
We propose a new multi-way spatial join algorithm called M-way R-tree join which synchronously traverses M R-trees. The M-way R-tree join can be considered as a generalization of the 2-way R-tree join. Although a generalization of the 2-way R-tree join has recently been studied, it did not properly take into account the optimization techniques of the original algorithm. Here, we extend these optimization techniques for M-way joins. Since the join ordering was considered to be important in the M-way join literature (e.g., relational join), we especially consider the ordering of the search space restriction and the plane sweep. Additionally, we introduce indirect predicates in the M-way join and propose a further optimization technique to improve the performance of the M-way R-tree join. Through experiments using real data, we show that our optimization techniques significantly improve the performance of the M-way spatial join.