Kim Yong Hyun, Lee Hyung Soo, Lee Sung Soo, Kim Ung Mo

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 7, pp. 1753-1762, Dec. 1996
10.3745/KIPSTE.1996.3.7.1753,   PDF Download:

Abstract

Since the number of spatial objects go easily into millions, they are sored on a secondary storage. In order to speed up accessing the geometric objects, we investigate spatial database system. The spatial objects are organized and accessed by spatial access methods(SAMs). But, SAMs are not able to organize polygons directly. The mose popular approach for handling polygon in SAMs is to use MBR approximation as a geometric key. MBR provides a fast but inaccurate answers to approximation-based query processing. The performance of approximation-based spatial query processing depends on which type of approximation is chosen for the spatial objects. A suitable approximation is crucial for reducing the sixe of the candidate set. The better the approximation quality, the fewer accesses to the exact object are necessary. In this paper, I proposed a new multicontainer approximation named Slice decomposition. The performance of proposed method is compared with other method.

Statistics
Cite this article