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

  • Authors:

  • Dimitris Papadias;Timos Sellis;Yannis Theodoridis;Max J. Egenhofer

  • Affiliations:

  • Department of Computer Science and Engineering, University of California, San Diego, CA;Department of Electrical and Computer Engineering, National Technical University of Athens, Greece 15773;Department of Electrical and Computer Engineering, National Technical University of Athens, Greece 15773;National Center for Geographic Information and Analysis, University of Maine, Orono, ME

  • Venue:
  • SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.