The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
On local heuristics to speed up polygon-polygon intersection tests
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Pagination of B*-trees with variable-length records
Communications of the ACM
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Proceedings of the Ninth International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
Parallel Processing of Spatial Joins Using R-trees
ICDE '96 Proceedings of the Twelfth 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
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
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Optimisation of Spatial Joins Using Filters
BNCOD 13 Proceedings of the 13th British National Conference on Databases: Advances in Databases
Generating Seeded Trees from Data Sets
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Improving Spatial Intersect Joins Using Symbolic Intersect Detection
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Object-relational management of complex geographical objects
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Hi-index | 0.00 |
The main subject of spatial joins is polygons and polylines. Typical polygons and polylines can occupy several Kbytes. Since approximations use much less space, the processing of spatial joins can be greatly improved by the use of filters that reduce the need for examining the exact geometry of spatial objects in order to find the intersecting ones. Candidate pairs of approximations of spatial objects are evaluated using such filters. As a result, three possible sets of answers are identified: the positive one, composed of intersecting pairs; the negative one, composed of non-intersecting pairs; and the inconclusive one, composed of the remaining pairs of candidates. There are many approximations designed for polygons, but few are suitable for approximating polylines. This paper presents a spatial join processor based on the multi step query processor (MSQP) architecture [24]. We have developed a new polyline approximation, named five color direction raster signature (5CDRS) [18]. It is used as the filter of MSQP’s second step. The performance of the join processor and the approximation was evaluated with real world data sets. The results showed that our approach, when compared to others presented in the literature, reduced the inconclusive answers by 29% in the average. Consequently, the need for retrieving the representation of polylines and carrying out exact geometry tests is reduced by the same factor. As the exact geometry test is the most time consuming step, we have noticed that the overall time is also reduced by 38% in the average. The disk accesses are reduced by 41% in the average.