Computational geometry: an introduction
Computational geometry: an introduction
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
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 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
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 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
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 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
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the Seventh International Conference on Data Engineering
Distance-Associated Join Indices for Spatial Range Search
Proceedings of the Eighth 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
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Improving Spatial Intersect Joins Using Symbolic Intersect Detection
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Detection of spatial conflicts between rivers and contours in digital map updating
International Journal of Geographical Information Science
Hi-index | 0.00 |
Due to the increasing popularity of spatial databases, researchershave focused their efforts on improving the query processing performance ofthe most expensive spatial database operation: the spatial join. While mostprevious work focused on optimizing the filter step, it has been discoveredrecently that, for typical GIS data sets, the refinement step of spatialjoin processing actually requires a longer processing time than the filterstep. Furthermore, two-thirds of the time in processing the refinement stepis devoted to the computation of polygon intersections. To address thisissue, we therefore introduce a novel approach to spatial join optimizationthat drastically reduces the time of the refinement step. We propose a newapproach called Symbolic Intersect Detection (SID) for early detection oftrue hits. Our SID optimization eliminates most of the expensive polygonintersect computations required by a spatial join by exploiting the symbolictopological relationships between the two candidate polygons and theiroverlapping minimum bounding rectangle. One important feature of our SIDoptimization is that it is complementary to the state-of-the-art methods inspatial join processing and therefore can be utilized by these techniques tofurther optimize their performance. In this paper, we also develop ananalytical cost model that characterizes SID’s effectiveness undervarious conditions. Based on real map data, we furthermore conduct anexperimental evaluation comparing the performance of the spatial joins withSID against the state-of-the-art approach. Our experimental results showthat SID can effectively identify more than 80% of the true hits withnegligible overhead. Consequently, with SID, the time needed for resolvingpolygon intersect in the refinement step is improved by over 50% overknown techniques, as predicted by our analytical model.