Topological relations in the world of minimum bounding rectangles
Open Access
- 22 May 1995
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 24 (2) , 92-103
Abstract
Recent developments in spatial relations have led to their use in numerous applications involving spatial databases. This paper is concerned with the retrieval of topological relations in Minimum Bounding Rectangle-based data structures. We study the topological information that Minimum Bounding Rectangles convey about the actual objects they enclose, using the concept of projections. Then we apply the results to R-trees and their variations, R + -trees and R*-trees in order to minimise disk accesses for queries involving topological relations. We also investigate queries that involve complex spatial conditions in the form of disjunctions and conjunctions and we discuss possible extensions.Keywords
This publication has 11 references indexed in Scilit:
- Nearest neighbor queries1995
- Qualitative representation of spatial knowledge in two-dimensional spaceThe VLDB Journal, 1994
- Multi-step processing of spatial joins1994
- Spatial SQL: a query and presentation languageIEEE Transactions on Knowledge and Data Engineering, 1994
- Computational ImageryCognitive Science, 1992
- Temporal reasoning based on semi-intervalsArtificial Intelligence, 1992
- A model for expressing topological integrity constraints in geographic databases1992
- The R*-tree: an efficient and robust access method for points and rectangles1990
- R-trees1984
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983