Yong Hun Park , Kyoung Soo Bok , Jae Soo Yoo

The KIPS Transactions:PartD, Vol. 14, No. 5, pp. 471-482, Aug. 2007
10.3745/KIPSTD.2007.14.5.471,   PDF Download:

Abstract

In this paper, we propose an efficient continuous range query processing scheme using a modified grid based query indexing to reduce storage spaces and to accelerate processing time. The proposed method has two major features. First, each query has a bit identifier and each cell in a grid has a bit pattern that consists of the bit identifiers of the queries. The bit patterns present the relationship between cells and queries. Using the bit patterns, we can compute quickly what queries overlap a cell in a grid and reduce the number of unnecessary operations by comparing the bit patterns without comparing the query identifiers when we compute the relation between cells and queries. Second, the management of cells in the grid by groups prevents from wasting the storage space through the increase of the length of the bit pattern and increasing the comparison costs of bit patterns. We show through the performance evaluation that the proposed method outperforms the existing methods.

Statistics
Cite this article