Spatial Searching in Geometric Databases
To support spatial searching of multidimensional keys in geometric databases, several efficient index structures, such as the grid file, have been proposed. Much less is known, however, in the case of multidimensional geometric objects of non-zero size. We present a general principle for transforming index structures for points into index structures for non-zero size objects. This transformation fully preserves the advantages of the selected index structure for points, such as efficient update and retrieval operations, especially range queries, as weil as high storage space utilization. We have implemented an index structure for rectangles on the basis of the grid file. A performance evaluation with geographic data, where bounding boxes serve as geometric keys, shows highly encouraging results.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten