This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks
April 2004 (vol. 16 no. 4)
pp. 519-523

Abstract—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 n_1 \times n_2, Proietti's algorithm takes O(n_l) time, where n_l = max(n_1, n_2). 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.

[1] W.G. Aref and H. Samet, Decomposing a Window into Maximal Quadtree Blocks Acta Informatica, vol. 30, pp. 425-439, 1993.
[2] K.L. Chung and J.G. Wu, Improved Image Compression Using S-Tree and Shading Approach IEEE Trans. Comm., vol. 48, no. 5, pp. 748-751, 2000.
[3] C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos, “Analysis of the N-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 373–383, May/June 1997.
[4] E. Nardelli and G. Proietti, Efficient Secondary Memory Processing of Window Queries on Spatial Data Information Sciences, vol. 84, pp. 67-83, 1995.
[5] E. Nardelli and G. Proietti, Time and Space Efficient Secondary Memory Representation of Quadtrees Information Systems, vol. 22, pp. 25-37, 1997.
[6] J.A. Orenstein and F.A. Manola, "PROBE Spatial Data Modeling and Query Processing in an Image Database Application," IEEE Trans. Software Engineering, vol. 14, no. 5, pp. 611-629, May 1988.
[7] G. Proietti, An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks Acta Informatica, vol. 36, no. 4, pp. 257-266, 1999.
[8] H. Samet, Applications of Spatial Data Structures. Addison Wesley, 1990.
[9] C.A. Shaffer, A Formula for Computing the Number of Quadtree Node Fragments Created by a Shift Pattern Recognition Letters, vol. 7, no. 1, pp. 45-49, 1988.

Index Terms:
Maximal quadtree blocks, optimal algorithm, spatial database, window queries.
Citation:
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 and Data Engineering, vol. 16, no. 4, pp. 519-523, April 2004, doi:10.1109/TKDE.2004.1269662
Usage of this product signifies your acceptance of the Terms of Use.