On Sampling Regional Data

Abstract The region quadtree is a very popular hierarchical data structure for the representation of binary images (regional data) and it is heavily used at the physical level of many spatial databases. Random sampling algorithms obtain approximate answers of aggregate queries on these databases efficiently. In the present report, we examine how four different sampling methods are applied to specific quadtree implementations (to the most widely used linear implementations). In addition, we examine how two probabilistic models (a parametric model of random images and a model of random trees) can be used for analysing the cost of these methods.

[1]  Clifford A. Shaffer,et al.  A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Y. Manolopoulos,et al.  Analytical Comparison of Two Spatial Data Structures , 1994, Inf. Syst..

[3]  Doron Rotem,et al.  Sampling from spatial databases , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[4]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[5]  Doron Rotem,et al.  Random Sampling from Database Files: A Survey , 1990, SSDBM.

[6]  Yannis Manolopoulos,et al.  Analytical Results on the Quadtree Storage-Requirements , 1993, CAIP.

[7]  Hanan Samet,et al.  Recent developments in linear quadtree-based geographic information systems , 1987, Image Vis. Comput..

[8]  Yannis Manolopoulos,et al.  A random model for analyzing region quadtrees , 1995, Pattern Recognit. Lett..

[9]  Clifford A. Shaffer,et al.  QUILT: a geographic information system based on quadtrees , 1990, Int. J. Geogr. Inf. Sci..

[10]  D. J. Abel,et al.  A B+-tree structure for large quadtrees , 1983, Comput. Vis. Graph. Image Process..

[11]  Derek Thompson,et al.  Fundamentals of spatial information systems , 1992, A.P.I.C. series.