Time and Space Efficient Secondary Memory Representation of Quadtrees
暂无分享,去创建一个
[1] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[2] Clifford A. Shaffer,et al. A Paging Scheme for Pointer-Based Quadtrees , 1993, SSD.
[3] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .
[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[5] Charles R. Dyer. The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..
[6] Clifford A. Shaffer,et al. A formula for computing the number of quadtree node fragments created by a shift , 1988, Pattern Recognit. Lett..
[7] Oliver Günther,et al. The design of the cell tree: an object-oriented index structure for geometric databases , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[8] Rafig P. Agaev,et al. Interval Choice under Constraints on Error Functions , 1994, Inf. Sci..
[9] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[10] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[11] Enrico Nardelli,et al. Efficient Secondary Memory Processing of Window Queries on Spatial Data , 1995, Inf. Sci..
[12] Christos Faloutsos,et al. Analysis of object oriented spatial access methods , 1987, SIGMOD '87.
[13] D. J. Abel,et al. A B+-tree structure for large quadtrees , 1983, Comput. Vis. Graph. Image Process..
[14] Peter Scheuermann,et al. Encoding and Manipulating Pictorial Data with S+-trees , 1991, SSD.
[15] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[16] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.