Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Topological relations in the world of minimum bounding rectangles: a study with R-trees

Topological relations in the world of minimum bounding rectangles: a study with R-trees 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMOD Record Association for Computing Machinery

Topological relations in the world of minimum bounding rectangles: a study with R-trees

Loading next page...
 
/lp/association-for-computing-machinery/topological-relations-in-the-world-of-minimum-bounding-rectangles-a-yTuv04Qyoo

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1995 by ACM Inc.
ISSN
0163-5808
DOI
10.1145/568271.223798
Publisher site
See Article on Publisher Site

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.

Journal

ACM SIGMOD RecordAssociation for Computing Machinery

Published: May 22, 1995

There are no references for this article.