An efficient method for the retrieval of objects by topological relations in spatial database systems

Abstract

In this paper, we present a new method to improve the performance of query processing in a spatial database. The previous approach can process the retrieval of spatial objects by topological relations using R-tree structures based on minimum bounding rectangles. In our approach, we add internal rectangle to the leaf nodes of the R-tree as additional information for helping objects retrieval. As a result, the number of false hits can be reduced and part of the true hits can be identified at the early stage of searching. The experiments demonstrated that the performance of database systems can be improved because both the number of objects accessed and the number of objects requiring detailed inspection are much less than those in the previous approach.