This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
September 1991 (vol. 3 no. 3)
pp. 342-356

Experiences with the implementation of the cell tree dynamic access method for spatial databases are reported, and the results of an experimental performance comparison with the R-tree of A. Guttman (1984) and with the R-tree of T. Sellis et al. (1987) are given. Cell tree design and implementation are discussed. Although the cell tree often requires more storage space and more CPU time to answer a search query, it usually obtains the results with a lower number of disk accesses than the two rival structures.

[1] D. Ayala, P. Brunet, R. Juan, and I. Navazo, "Object Representation by Means of Nonminimal Division Quadtrees and Octrees,"ACM Trans. Graphics, Jan. 1985, pp. 41-59.
[2] R. Bayer and E. M. McCreight, "Organization and maintenance of large ordered indices,"Acta Informatica, vol. 1, no. 3, pp. 1-21, 1972.
[3] K.Q. Brown, "Geometric transformations for fast geometric algorithms," Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, Dec. 1979.
[4] A. Buchmann, O. Günther, T.R. Smith, and Y.-F. Wang, Eds.,Design and Implementation of Large Spatial Databases, Lecture Notes in Computer Science No. 409. Berlin, Germany: Springer-Verlag, 1990.
[5] B. Chazelle, "A theorem on polygon cutting with applications," inProc. 23rd Annu. Symp. Foundations Comput. Sci., 1982.
[6] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[7] M. J. Egenhofer, A. U. Frank, and J. P. Jackson, "A topological data model for spatial databases," inDesign and Implementation of Large Spatial Databases, Lecture Notes in Computer Science No. 409. Berlin, Germany: Springer-Verlag, 1990.
[8] C. Faloutsoset al., "Analysis of object oriented spatial access methods." inProc. 1987 ACM SIGMOD Conf. Management Data, San Francisco, CA, May 1987.
[9] H. Fuchs, Z. Kedem, and B. Naylor, "On visible surface generation by a priori tree structures,"Comput. Graphics, vol. 14, no. 3, June 1980.
[10] H. Fuchs, G. D. Abram, and E. D. Grant, "Near real-time shaded display of rigid objects,"Comput. Graphics, vol. 17, no. 3, pp. 65-72, Summer 1983.
[11] D. Greene, "An implementation and performance analysis of spatial data access methods," inProc. IEEE 5th Int. Conf. Data Eng., 1989.
[12] O. Günther and E. Wong, "A dual space representation for geometric data," inProc. 13th Int. Conf. Very Large Data Bases, 1987.
[13] O. Günther and E. Wong, "A dual approach to detect polyhedral intersections in arbitrary dimensions,"BIT, vol. 31, pp. 2-14, 1991.
[14] O. Günther,Efficient Structures for Geometric Data Management, Lecture Notes in Computer Science No. 337. Berlin, Germany: Springer-Verlag, 1988.
[15] O. Günther and E. Wong, "Convex polyhedral chains: A representation for geometric data,"Computer-Aided Design, vol. 21, no. 3, 1989.
[16] O. Günther, "The design of the cell tree: An object-oriented index structure for geometric databases, "inProc. IEEE 5th Int. Conf. Data Eng., 1989.
[17] H. Guttman, "R-trees: A dynamic index structure for spatial searching," inProc. ACM/SIGMOD Conf., 1984, pp. 47-56.
[18] K. H. Hinrichs, "The grid file system: Implementation and case studies of applications," Ph.D. dissertation no. 7734, ETH Zurich, Switzerland, 1985.
[19] H. P. Kriegel and B. Seeger, "Multidimensional order preserving linear hashing with partial expansions," inProc. Int. Conf. Database Theory, Lecture Notes in Computer Science No. 243. Berlin, Germany: Springer-Verlag, 1986.
[20] P. W. Hutto and M. Ahamad, "Slow memory: weakening consistency to enhance concurrency in distributed shared memories," inProc. 10th Int. Conf. on Distrib. Comput. Syst.(Paris), May 1990, pp. 302-309.
[21] D. T. Lee and F. P. Preparata, "Computational geometry--A survey,"IEEE Trans. Comput., vol. C-33, pp. 1072-1101, Dec. 1984.
[22] J. Nieverglt, H. Hinterberger, and K. Sevcik, "The grid file: An adaptable, symmetric multikey file structure,"ACM TODS, Mar. 1984.
[23] J. Nievergelt and K. Hinrichs, "Storage and access structures for geometric data bases," inProc. Int. Conf. Foundations Data Organization 1985, S. Ghosh, Y. Kambayashi, and K. Tanaka, Eds. New York: Plenum, 1987.
[24] J. Nievergelt, "7±2 criteria for assessing and comparing spatial data structures," inDesign and Implementation of Large Spatial Databases, Lecture Notes in Computer Science No. 409. Berlin, Germany: Springer-Verlag, 1990.
[25] J. Orenstein, "Spatial query processing in an object-oriented database system," inProc. ACM SIGMOD Conf., Washington, DC, May 1986, pp. 326-336.
[26] J. 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, May 1988.
[27] F. P. Preparata and D. E. Muller, "Finding the intersection of a set ofNhalf-spaces in timeO(NlogN),"Theoret. Comput. Sci., vol. 8, pp. 45-55, 1979.
[28] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[29] J. T. Robinson, "The k-D-B-tree: A search structure for large multidimensional dynamic indexes," inProc. ACM SIGMOD, 1981, pp. 10-18.
[30] N. Roussopoulos and D. Leifker, "Direct spatial search on pictorial databases using packed R-trees," inProc. ACM SIGMOD, Austin, TX, May 1985.
[31] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[32] H. Samet and R.E. Webber, "Storing a collection of polygons using quadtrees,"ACM Trans. Graphics, vol. 4, no. 3, pp. 182-222, July 1985.
[33] B. Seeger and H.P. Kriegel, "Design and implementation of spatial access methods," inProc. 14th Int. Conf. Very Large Databases, 1988.
[34] T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-tree: A dynamic index for multi-dimensional objects," inProc. VLDB, 1987.
[35] H.-W. Six and P. Widmayer, "Hintergrundspeicherstrukturen für ausgedehnte Objekte," inTagungsband GI - 16. Jahrestagung, Informatik-Fachberichte No. 126. Berlin, Germany: Springer-Verlag, 1986.
[36] M. Stonebraker, T. Sellis, and E. Hanson, "An analysis of rule indexing implementations in data base systems," inProc. 1st Int. Conf. Expert Data Base Syst., 1986.
[37] M. Stonebraker and L. Rowe, "The design of POSTGRES," inProc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986.
[38] M. Tamminen and R. Sulonen, "The EXCELL method for efficient geometric access to data," inProc. 19th ACM Design Automat. Conf., 1982.
[39] H. Whitney,Geometric Integration Theory. Princeton, NJ: Princeton University Press, 1957.

Index Terms:
spatial databases; performance evaluation; cell tree dynamic access method; R-tree; R-tree; search query; data structures; database management systems; performance evaluation; query languages; trees (mathematics)
Citation:
O. Günther, J. Bilmes, "Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 3, pp. 342-356, Sept. 1991, doi:10.1109/69.91064
Usage of this product signifies your acceptance of the Terms of Use.