Abstract
A comparison is made of the space requirements of pointer and a number of pointer-less implementations of multidimensional quadtree-based file structures. The database is assumed to be static. In order to make the comparison realistic, considerations such as computer byte sizes are taken into account, and fields are constrained to start on bit and byte boundaries where appropriate. In many practical cases, the pointer quadtree requires less space than the pointer-less quadtree. This effect is more pronounced for octrees and data of higher dimension. Empirical data from a cartographic batabase are used to support the analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ayala D, Brunet P, Juan R, Navazo I (1985) Object respresentation by means of nonminimal division quadtrees and octrees. ACM Trans Graph 4(1):41–59
Beckley DA, Evens MW, Raman VK (1985) Multikey retrieval from k-d trees and quad-trees. Proc SIGMOD Conf, Austin, Texas (May 1985), pp 291–301
Bentley JL (1975) Multidimensional binary search trees used for associative scarching. Commun ACM 18(9):509–517
Carlbom I, Chakravarty I, Vanderschel D (1985) A hierarchical data structure for representing the spatial decomposition of 3-D objects. IEEE Comput Graph Appl 5(4):24–31
Comer D (1979) The Ubiquitous B-tree. ACM Comput Surv 11(2):121–137
Doctor LJ, Torborg JG (1981) Display techniques for octreeencoded objects. IEEE Comput Graph Appl 1(1):29–38
Faloutsos C, Sellis T, Roussopoulos N (1987) Analysis of object oriented spatial access methods. Proc SIGMOD Conf, San Francisco (May 1987), pp 426–439
Finkel RA, Bentley JL (1974) Quad trees: a data structure for retrieval on composite keys. Acta Inf 4(1):1–9
Fujimura K, Kunii TL (1985) A hierarchical space indexing method. Proc Comput Graph '85 (Tokyo 1985), T1-4, pp 1–14
Gargantini I (1982a) An effective way to represent quadtrees. Commun ACM 25(12):905–910
Gargantini I (1982b) Linear octtrees for fast processing of three dimensional objects. Comput Graph Image Proc 20(4):365–374
Gargantini I (1982c) Detection of connectivity for regions represented by linear quadtrees. Comput Mathe Appl 8(4):319–327
Guttman A (1984) R-trees: a dynamic index structure for spatial searching Proc SIGMOD Conf, Boston (June 1984), pp 47–57
Hunter GM (1978) Efficient computation, and data structures for graphics. PhD Dissertation, Dep Electrical Eng Comput Sci, Princeton Univ, Princeton NJ
Jackins CL, Tanimoto SL (1980) Oct-trees and their use in representing three-dimensional objects. Comput Graph Image Proc 14(3):249–270
Jones L, Iyengar SS (1984) Space and time efficient virtual quadtrees. IEEE Trans Pattern Anal Mach Intell 6(2):244–247
Kawaguchi E, Endo T (1980) On a method of binary picture representation and its application to data compression. IEEE Trans Pattern Anal Mach Intell 2(1):27–35
Klinger A (1971) Patterns and search statistics. In: Rustagi JS (ed) Optimizing Methods in Statistics, Academic Press, New York, pp 303–337
Knowlton K (1980) Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes. Proc IEEE 68(7):885–896
Knuth DE (1973) The art of computer programming, vol 1. Fundamental algorithms (2nd edn). Addison-Wesley, Reading, MA
Lauzon JP, Mark DM, Kikuchi L, Guevara JA (1985) Twodimensional run-encoding for quadtree representation. Comput Vision Graph Image Proc 30(1):56–69
Matsuyama T, Hao LV, Nagao M (1984) A file organization for geographic information systems based on spatial proximity. Coraput Vision Graph Image Proc 26(3):303–318
Meagher D (1982a) Geometric modeling using octree encoding. Comput Graph Image Proc 19(2):129–147
Meagher D (1982b) The octree encoding method for efficient solid modeling. Electrical and Systems Engineering Rep IPL-TR-032, Rensselaer Polytechnic Institute, Troy, NY (August 1982)
Nelson RC, Samet H (1987) A population analysis for hierarchical data structures. Proc SIGMOD Conf, San Francisco (May 1987), pp 270–277
Okawara F, Shimizu K, Nishitani Y (1988) Data compression of the region quadtree and algorithms for set operations. Dept Comput Sci Rep CS-88-6, Gunma Univ, Gunma, Japan (July 1988) (translated from Proc 36th All-Japan Conf on Information Processing, Information Processing Society of Japan, Tokyo, Japan (March 1988) pp 73–74)
Oliver MA, Wiseman NE (1983) Operations on quadtree-encoded images. Comput J 26(1):83–91
Orenstein JA (1982) Multidimensional tries used for associative searching. Inf Proc Lett 14(4):150–157
Robinson JT (1981) The k-d-B-tree: a search structure for large multidimensional dynamic indexes. Proc SIGMOD Conf, Ann Arbor, Michigan (April 1981), pp 10–18
Roussopoulos N, Leifker D (1985) Direct spatial search on pictorial databases using Packed R-trees. Proc SIGMOD Conf, Austin, Texas (May 1985), pp 17–31
Samet H (1984) The quadtree and related hierarchical data structures. ACM Comput Surv 16(2):187–260
Samet H (1985) Data structures for quadtree approximation and compression. Commun ACM 28(9):973–993
Samet H (1990a) The design and analysis of spatial data structures. Addison-Wesley, Reading, MA
Samet H (1990b) Applications of spatial data structures: Computer graphics, image processing, and GIS, Addison-Wesley, Reading, MA
Samet H, Tamminen M (1985) Bintrees, CSG trees, and time. Comput Graph 19(3):121–130
Samet H, Tamminen M (1988) Efficient component labeling of images of arbitrary dimension represented by linear bintrees. ZEEE Trans Pattern Anal Mach Intell 10(4):579–586
Samet H, Webber RE (1985) Storing a collection of polygons using quadtrees. ACM Trans Graph 4(3):182–222
Samet H, Rosenfeld A, Shaffer CA, Webber RE (1984) A geographic information system using quadtrees. Pattern Recognition 17(6):647–656
Samet H, Shaffer CA, Nelson RC, Huang YG, Fujimura K, Rosenfeld A (1987) Recent developments in linear quadtreebased geographic information systems. Image Vision Comput 5(3):187–197
Tamminen M (1984) Comment on quad-and octtrees. Commun ACM 27(3):248–249
Yau M, Srihari SN (1983) A hierarchical data structure for multidimensional digital images. Commun ACM 26(7):504–515
Author information
Authors and Affiliations
Additional information
The support of the National Science Foundation under Grant IRI8802457 is gratefully acknowledged
Rights and permissions
About this article
Cite this article
Samet, H., Webber, R.E. A comparison of the space requirements of multi-dimensional quadtree-based file structures. The Visual Computer 5, 349–359 (1989). https://doi.org/10.1007/BF01999102
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01999102