A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks

IEEE Transactions on Knowledge and Data Engineering

Volumn 16, Issue 4, 2004, Pages 519-523

  Tsai, Yao Hong ^a   Chung, Kuo Liang ^a   Chen, Wan Yu ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Maximal quadtree blocks; Optimal algorithm; Spatial database; Window queries

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; GEOGRAPHIC INFORMATION SYSTEMS; IMAGE PROCESSING; PROBLEM SOLVING; ROBOTICS; SET THEORY;

MAXIMAL QUADTREE BLOCKS; OPTIMAL ALGORITHMS; SPATIAL DATABASES; WINDOW QUERIES;

DATABASE SYSTEMS;

EID: 2142815757     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/tkde.2004.1269662     Document Type: Article

References (9)

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 n-Dimensional Quadtree Decomposition of Arbitrary Rectangles," 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 Eng., vol. 14, no. 5, pp. 611-629, 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.