On-line construction of the convex hull of a simple polyline
Information Processing Letters
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
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
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
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
$\mathcal{I}$-SQE: A Query Engine for Answering Range Queries over Incomplete Spatial Databases
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
A new enhancement to the R-tree node splitting
Journal of Information Science
Assessing the role of spatial relations for the object recognition task
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Multimedia Tools and Applications
Hi-index | 0.00 |
In this paper, we present a new method to improve the performance of query processing in a spatial database. The previous approach can process the retrieval of spatial objects by topological relations using R-tree structures based on minimum bounding rectangles. In our approach, we add internal rectangle to the leaf nodes of the R-tree as additional information for helping objects retrieval. As a result, the number of false hits can be reduced and part of the true hits can be identified at the early stage of searching. The experiments demonstrated that the performance of database systems can be improved because both the number of objects accessed and the number of objects requiring detailed inspection are much less than those in the previous approach.