Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Robust Plane Sweep for Intersecting Segments
SIAM Journal on Computing
Proceedings of the Ninth International Conference on Data Engineering
A Raster Approximation For Processing of Spatial Joins
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Processing of Large Spatial Queries Using Interior Approximations
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Toward Spatial Joins for Polygons
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
SECONDO: An Extensible DBMS Platform for Research Prototyping and Teaching
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
An interactive framework for raster data spatial joins
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
| Hi-index | 0.01 |
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predicate. However, the exact intersection test of two spatial objects is the most time-consuming and I/O-consuming step in processing spatial joins. On the other hand, the use of approximations can reduce the need for examining the exact geometry of spatial objects in order to find the intersecting ones. This work proposes a new raster approximation (Three-Color Raster Signature - 3CRS) for representing different data types (polygons, polylines and points), and to be used as filter in the second step of the Multi-Step Query Processor. We have also executed experimental tests over real datasets, the results having demonstrated the effectiveness of our approach.