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
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
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Constraint-based algorithms for computing clique intersection joins
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
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
On two-dimensional indexability and optimal range search indexing
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
Proceedings of the Seventh International Conference on Data Engineering
A New Algorithm for Computing Joins with Grid Files
Proceedings of the Ninth International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Raster Approximation For Processing of Spatial Joins
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
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Qualitative Spatial Reasoning: A Semi-quantitative Approach Using Fuzzy Logic
SSD '89 Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
The Retrieval of Direction Relations using R-trees
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
Toward Spatial Joins for Polygons
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
An Index Structure for Spatial Joins in Linear Constraint Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximate Processing of Multiway Spatial Joins in Very Large Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
ACM Transactions on Database Systems (TODS)
Cardinal directions between complex regions
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate "region intersection." In modern database applications involving geospatial data such as GIS, efficient evaluation of joins with other spatial predicates is yet to be fully explored. In addition, most existing join algorithms were developed for two-way joins. Traditionally, a multi-way join is treated as a sequence of two-way joins. The goal of this paper is to study evaluation of multi-way spatial joins with direction predicates: complexity bounds and efficient algorithms. We first give I/O efficient plane sweeping based algorithms for 2-way direction joins and show that by combining the plane sweeping technique with external priority search trees, a 2-way direction join of N-tuple relations can be evaluated in O(N logbN/M + k) I/Os in the worst case, where M is the size of the memory, b is the page size and k is the result size. The algorithms are then extended to perform a subclass of multi-way direction joins called "star joins". We show that the I/O complexity of evaluating an m-way star join of N-tuple relations is O(mN logb N/M +K+k), where K 驴 mN2 is the size of the intermediate result, M, b and k (驴 Nm) are the same as above. We also apply the algorithm for star joins to evaluate a more general case of multi-way joins, which are star connections of star joins and show that this can be done in polynomial time. In the general case, we show that testing emptiness of a multi-way direction join is NP-complete. This lower bound holds even when in the join predicate (1) only one attribute for each relation is involved, and (2) each spatial attribute occurs a bounded number of times. It implies that join evaluation in these cases is NP-hard.