Stream-based versus structured video objects: issues, solutions, and challenges
Multimedia database systems
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
Virtual Stage: A Location-Based Karaoke System
IEEE MultiMedia
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
The Retrieval of Direction Relations using R-trees
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
Multiple Index Structures for Efficient Retrieval of 2D Objects
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Spatial-Match Iconic Image Retrieval with Ranking in Multimedia Databases
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
Cardinal directions between complex regions
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The representation and processing of spatial queries is important in numerous application domains in the areas of computer-aided design, multimedia databases, spatial and geographic applications. A sample query type in these applications is to find objects that satisfy a specific direction or topological relation with respect to a given object. Due to the large size of these databases and the complexity of geometric algorithms, appropriate indexing techniques and object approximations are crucial. The problem is that the relationships between object approximations are usually a superset of the actual relationships between their corresponding objects, resulting in a number of false hits. A challenge, hence, is to reduce the number of false hits in order to decrease the number of times we invoke the complex geometric algorithms on the actual representations of the objects. In this paper, we describe the support of topological and direction queries using spatial data structures based on the minimum bounding circle approximation {MBC}. By identifying special cases in MBC relations, we propose extra filtering steps to reduce the number of false hits.