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
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Computing a maximum axis-aligned rectangle in a convex polygon
Information Processing Letters
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Indexing medium-dimensionality data in Oracle
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th 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
A Topological Data Model for Spatial Databases
SSD '89 Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
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
Selectivity Estimation for Spatial Joins with Geometric Selections
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Hardware acceleration for spatial selections and joins
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Filtering with raster signatures
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Fast computation of spatial selections and joins using graphics hardware
Information Systems
Hardware acceleration in commercial databases: a case study of spatial operations
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Ad-hoc HW/SW architectures for DBMSs: a co-design approach
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
A network aware privacy model for online requests in trajectory data
Data & Knowledge Engineering
Geodetic point-in-polygon query processing in oracle spatial
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Estimating the overlapping area of polygon join
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Topological relationship query processing for complex regions in Oracle Spatial
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Spatial data in CAD/CAM and geographic information systems involve arbitrarily-shaped 2- and 3-dimensional geometries. Queries on such complex geometry data involve identification of data geometries that interact with a specified query geometry. Since geometry-geometry comparisons are expensive due to the large sizes of the data geometries, spatial engines avoid unnecessary comparisons by first comparing the MBRs and filtering out irrelevant geometries. If the query geometry is large compared to the data geometries, this filtering technique may not be effective in improving the performance. In this paper, we describe how to reduce geometry-geometry comparisons by first filtering using the interior approximations of geometries (in addition to and after comparing the exteriors, i.e., the MBRs). We implemented this technique as part of the R-tree indexes in Oracle Spatial and observed that the query performance improves by more than 50% (or a factor of 2) for most queries on real spatial datasets.