Various views on spatial prepositions
AI Magazine
Data models in geographic information systems
Communications of the ACM
Hierarchical reasoning about direction relations
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Direction as a spatial object: a summary of results
Proceedings of the 6th 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
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Qualitative representation of spatial knowledge in two-dimensional space
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
Using Orientation Information for Qualitative Spatial Reasoning
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
The Retrieval of Direction Relations using R-trees
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
Algorithms for discovery of spatial co-orientation patterns from images
Expert Systems with Applications: An International Journal
Viewer-based directional querying for mobile applications
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
| Hi-index | 0.00 |
Direction based spatial relationships are critical in many domains including geographic information systems(GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of queries based on object-orientation-based directional relationships. A new open shape based strategy(OSS) is proposed. OSS converts the processing of the direction predicates to the processing of topological operations between open shapes and closed geometry objects. Since OSS models the direction region as an OpenShape, it does not need to know the boundary of the embedding world, and also eliminating the computation related to the world boundary. The experimental evaluations show that OSS consistently outperforms classical range query strategy both in I/O and CPU cost. This paper is a summary of the results.