A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks
Issue No.04 - April (2004 vol.16)
Kuo-Liang Chung , IEEE
<p><b>Abstract</b>—Decomposing a query window into maximal quadtree blocks is a fundamental problem in quadtree-based spatial database. Recently, Proietti presented the first optimal algorithm for solving this problem. Given a query window of size <tmath>n_1 \times n_2</tmath>, Proietti's algorithm takes <tmath>O(n_l)</tmath> time, where <tmath>n_l = max(n_1, n_2)</tmath>. Based on a strip-splitting approach, this paper presents a new optimal algorithm for solving the same problem. Experimental results reveal that our proposed algorithm is quite competitive with Proietti's algorithm.</p>
Maximal quadtree blocks, optimal algorithm, spatial database, window queries.
Yao-Hong Tsai, Kuo-Liang Chung, Wan-Yu Chen, "A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks", IEEE Transactions on Knowledge & Data Engineering, vol.16, no. 4, pp. 519-523, April 2004, doi:10.1109/TKDE.2004.1269662