Time and space efficient secondary memory representation of quadtrees

Information Systems

Volumn 22, Issue 1, 1997, Pages 25-37

  Nardelli, Enrico ^a,b   Proietti, Guido ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CNR   (Italy)

Author keywords

Algorithms; Quadtrees; Spatial Data Structures; Window Queries

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL SYSTEMS; QUERY LANGUAGES;

QUADTREES; SECONDARY MEMORY REPRESENTATION; SPATIAL DATA STRUCTURES; WINDOW QUERIES;

DATA STRUCTURES;

EID: 0031097321     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0306-4379(97)00002-1     Document Type: Article

References (19)

1. +-tree structure for large quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19-31 (1984).
2. W.G. Aref and H. Samet. Efficient processing of window queries in the pyramid data. In Proc. of the 9th ACM-SIGMOD Symposium on Principles of Database Systems, pp. 265-272, Nashville, TN (1990).
3. W.G. Aref and H. Samet. Decomposing a window into maximal quadtree blocks. ACTA Informatica, 30(5):425-440 (1993).
4. N. Beckmann, R. Schneider, H. Kriegel and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of the 9th ACM-SIGMOD Symposium on Principles of Database Systems, pp. 322-331, Nashville, TN (1990).
5. C.R. Dyer. The space efficiency of quadtrees. Computer Graphics and Image Processing, 19(4):335-348 (1982).
6. C. Faloutsos, T. Sellis and N. Roussopoulos. Analysis of object oriented spatial access methods. In Proc. of the 6th ACM-SIGMOD Symposium on Principles of Database Systems, pp. 426-439, San Francisco, CA (1987).
7. O. Günther. The design of the cell tree: An object oriented index structure for geometric databases. In Proc. of the Fifth IEEE Intl. Conf. on Data Engineering, pp. 598-605, Los Angeles, CA (1989).
8. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of SIGMOD Conference, pp. 47-57, Boston (1984).
9. P. Kanellakis, D. Vengroff, S. Ramaswamy and J. Vitter. Indexing for data models In Proc. of the 12th ACM Symp. on Principles of Database Systems, pp. 233-243, Washington, DC (1993).
10. D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Reading, MA (1973).
11. +-trees. In Advances in Spatial Databases, Lecture Notes in Computer Science 525, O. Gunther and H.J. Schek, editors, pp. 401-419, Springer Verlag (1991).
12. I. Gargantini. An effective way to represent quadtrees. IEEE Trans. on Pattern Analysis and Machine Intelligence, 25(12):905-910 (1982).
13. E. Kawaguchi, T. Endo and M. Yokota. Depth-first expression viewed from digital picture processing. IEEE Trans. on Pattern Analysis and Machine Intelligence, pp. 373-384 (1983).
14. E. Nardelli and G. Proietti. Efficient secondary memory processing of window queries on spatial data. Information Sciences, 80:1-17 (1984).
15. J. Nievergelt, H. Hinterberger and K.C. Sevcik. The grid file: an adaptable symmetric, multikey file structure. ACM Trans. on Database Systems, 9:38-71 (1984).
16. H. Samet. The quadtree and related hierarchical data structures. Computing Surveys, 16(2):187-260 (1984).
17. H. Samet and R.E. Webber. A comparison of the space requirements of multi-dimensional quadtree-based file structures. Visual Computer, 5(6):349-359 (1989).
18. C.A. Shaffer. A formula for computing the number of quadtree node fragments created by a shift. Pattern Recognition Letters, 7(1):45-49 (1988).
19. C.A. Shaffer and P.R. Brown. A paging scheme for pointer-based quadtrees. In Advances in Spatial Databases, Lecture Notes in Computer Science 692, D. Abel and B.C. Ooi, editors, pp. 89-104, Springer Verlag (1993).