An object calculus for geographic databases
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Second-order signature: a tool for specifying data models, query processing, and optimization
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Composite regions in topological queries
Information Systems
Information Sciences: an International Journal
Realm-based spatial data types: the ROSE algebra
The VLDB Journal — The International Journal on Very Large Data Bases
A Formal Definition of Binary Topological Relationships
FOFO '89 Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms
A Small Set of Formal Topological Relationships Suitable for End-User Interaction
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
A simple but effective improvement to the plumb-line algorithm
Information Processing Letters
SECONDO: An Extensible DBMS Platform for Research Prototyping and Teaching
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Topological relationships between complex spatial objects
ACM Transactions on Database Systems (TODS)
Pro Oracle Spatial for Oracle Database 11g (Expert's Voice in Oracle)
Pro Oracle Spatial for Oracle Database 11g (Expert's Voice in Oracle)
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
Current database systems cannot only store standard data like $\underline{integer}$ , $\underline{string}$ , and $\underline{real}$ values, but also spatial data like $\underline{points}$ , $\underline{lines}$ , and $\underline{regions}$ . The importance of topological relationships between spatial objects has been recognized a long time ago. Using the well known 9-intersection model for describing such relationships, a lot of different topological relationships can be distinguished. For the query language of a database system it is not desirable to have such a large number of topological predicates. Particularly the query language should not be extended by a lot of predicate names. It is desirable to build new relationships from existing ones, for example to coarse the granularity. This paper describes how a database system user can define and use her own topological predicates. We show algorithms for computing such predicates in an efficient way. Last, we compare these general versions with specialized implementations of topological predicates.