The Community for Technology Leaders
Green Image
<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.

Y. Tsai, W. Chen and K. Chung, "A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 519-523, 2004.
80 ms
(Ver 3.3 (11022016))