An efficient region retrieval using R-tree on spatio-temporal database system hawks

摘要

We proposed a spatial and spatio-temporal data representation model Universe for dealing with spatial data and spatio-temporal data. Universe is based on the cell complex. The cell complex is a set of cells. We design that the system makes R-tree for every cell complex. Because a cell is convex figure, some operations between two convex figures substitute for an operation between two cell complexes. In this paper, we propose. a method of efficient refining of retrieval of cell complexes from database by making the best use of these feat urea of cell complex.