Object-based and image-based object representations

ACM Computing Surveys

Volumn 36, Issue 2, 2004, Pages 159-217

  Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Access methods; Feature query; Geographic information systems (GIS); Image space; Location query; Object space; Octrees; Pyramids; Quadtrees; R trees; Space filling curves; Spatial databases

Indexed keywords

ACCESS METHODS; FEATURE QUERY; IMAGE SPACE; LOCATION QUERY; OBJECT SPACE; OCTREES; PYRAMIDS; QUADTREES; R-TREES; SPACE-FILLING CURVES;

IMAGE ANALYSIS; JAVA PROGRAMMING LANGUAGE; KNOWLEDGE REPRESENTATION; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES;

DATABASE SYSTEMS;

EID: 33745168634     PISSN: 03600300     EISSN: 03600300     Source Type: Journal    
DOI: 10.1145/1031120.1031123     Document Type: Review

References (171)

1. ABEL, D. J. AND SMITH, J. L. 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Computer Vision, Graphics, and Image Processing 24, 1 (Oct.), 1-13.
2. AGGARWAL, C., WOLF, J., Yu, P., AND EPELMAN, M. 1997. The S-tree: An efficient index for multidimensional objects. In Advances in Spatial Databases - 5th International Symposium, SSD'97 (Berlin, Germany). M. Scholl and A. Voisard, Eds. 350-373.
3. ALBORZI, H. AND SAMET, H. 2004. Execution time analysis of a top-down r-tree construction algorithm. University of Maryland Computer Science TR-4623, College Park, MD.
4. ANG, C. H. AND TAN, T. C. 1997. New linear node splitting algorithm for R-trees. In Advances in Spatial Databases - 5th International Symposium, SSD'97 (Berlin, Germany). M. Scholl and A. Voisard, Eds. 339-349.
5. AREF, W. G. AND ILYAS, I. F. 2001. Sp-gist: An extensible database index for supporting space partitioning trees. Journal of Intelligent Information Systems 17, 2-3 (Dec.), 215-240.
6. AREF, W. G. AND SAMET, H. 1990. Efficient processing of window queries in the pyramid data structure. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) (Nashville, TN). 265-272.
7. Also Proceedings of the 5th Brazilian Symposium on Databases (Rio de Janeiro, Brazil, Apr.). 1990, 15-26.
8. AREF, W. G. AND SAMET, H. 1992. Uniquely reporting spatial objects: Yet another operation for comparing spatial data structures. In Proceedings of the 6th International Symposium on Spatial Data Handling (Charleston, SC). 178-189.
9. ABEF, W. G. AND SAMET, H. 1994a. A cost model for query optimization using r-trees. In Proceedings of the 2nd ACM Workshop on Geographic Information Systems (Gaithersburg, MD). N. Pissinou and K. Makki, Eds. 60-67.
10. AREF, W. G. AND SAMET, H. 1994b. Hashing by proximity to process duplicates in spatial databases. In Proceedings of the 3rd International Conference on Information and Knowledge Management (CIKM) (Gaithersburg, MD). 347-354.
11. ARGE, L. 1996. Efficient external-memory data structures and applications. Ph.D. dissertation. Computer Science Department, University of Aarhus, Aarhus, Denmark. Also BRICS Dissertation Series, DS-96-3.
12. ARGE, L., HINRICHS, K. H., VAHRENHOLD, J., AND VITTER, J. S. 1999. Efficient bulk operations on dynamic R-trees. In Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation (ALENEX'99) (Baltimore, MD). M. T. Goodrich and C. C. McGeoch, Eds. 328-348.
13. ARGE, L., PROCOPIUC, O., RAMASWAMY, S., SUEL, T., AND VITTER, J. S. 1998. Scalable sweeping-based spatial join. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB) (New York). A. Gupta, O. Shmueli, and J. Widom, Eds. 570-581.
14. ARMAN, R. AND AGGARWAL, J. K. 1993. Model-based object recognition in dense range images - A review. ACM Computing Surveys 25, 1 (Mar.), 543.
15. ASANO, T., RANJAN, D., Roos, T., WELZL, E., AND WIDMAYER, P. 1997. Space-filling curves and their use in the design of geometric data structures. Theoretical Computer Science 181, 1 (July), 3-15.
16. BAIRD, H. S. 1976. Design of a family of algorithms for large scale integrated circuit mask artwork analysis. Tech. Rep. PRRL-76-TR-062, RCA Laboratories, Princeton, NJ. May.
17. BALLARD, D. H. 1981. Strip trees: A hierarchical representation for curves. Communications of the ACM 24, 5 (May), 310-321. Also corrigendum, Communications of the ACM 25, 3 (Mar.), 213, 1982.
18. BAUMGART, B. G. 1975. A polyhedron representation for computer vision. In Proceedings of the 1975 National Computer Conference. Vol. 44. Anaheim, CA, 589-596.
19. BECKER, B., FRANCIOSA, P. G., GSCHWIND, S., OHLER, T., THIEMT, G., AND WIDMAYER, P. 1992. Enclosing many boxes by an optimal pair of boxes. In Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (Cachan, France). A. Finkel and M. Jantzen, Eds. 475-486.
20. BECKMANN, N., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD Conference (Atlantic City, NJ). 322-331.
21. BELL, S. B. M., DIAZ, B. M., HOLROYD, F., AND JACKSON, M. J. 1983. Spatially referenced methods of processing raster and vector data. Image and Vision Computing 1, 4 (Nov.), 211-220.
22. BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 9 (Sept.), 509-517.
23. BERCHTOLD, S., KEIM, D. A., AND KRIEGEL, H.-P. 1996. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB) (Mumbai (Bombay), India). T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, Eds. 28-39.
24. BÖHM, C., BERCHTOLD, S., AND KEIM, D. A. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 3 (Sept.), 322-373.
25. BRABEC, F. AND SAMET, H. 1998. Visualizing and animating R-trees and spatial operations in spatial databases on the worldwide web. In Visual Database Systems (VDB4), Y. Ioannidis and W. Klas, Eds. Chapman and Hall, London, United Kingdom, 123-140.
26. BRABEC, F., SAMET, H., AND YILMAZ, C. 2003. VASCO: Visualizing and animating spatial constructs and operations. In Proceedings of the 19th Annual Symposium on Computational Geometry (San Diego, CA). 374-375.
27. BRINKHOFF, T., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1994. Multi-step processing of spatial joins. In Proceedings of the ACM SIGMOD Conference (Minneapolis, MN). 197-208.
28. BRODSKY, A., LASSEZ, C., LASSEZ, J., AND MAHER, M. J. 1995. Separability of polyhedra for optimal filtering of spatial and constraint data. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) (San Jose, CA). 54-65.
29. BURT, P. J. 1980. Tree and pyramid structures for coding hexagonally sampled binary images. Computer Graphics and Image Processing 14, 3 (Nov.), 271-280.
30. BURTON, F. W., KOLLIAS, J. G., AND ALEXANDRIDIS, N. A. 1984. Implementation of the exponential pyramid data structure with application to determination of symmetries in pictures. Computer Vision, Graphics, and Image Processing 25, 2 (Feb.), 218-225.
31. CHAKRABARTI, K. AND MEHROTRA, S. 1998. High dimensional feature indexing using hybrid trees. Tech. Rep. TR-MARS-98-14, Department of Information and Computer Science, University of California, Irvine, CA. July.
32. CHAKHABARTI, K. AND MEHROTRA, S. 1999. The hybrid tree: An index structure for high dimensional feature spaces. In Proceedings of the 15th IEEE International Conference on Data Engineering (Sydney, Australia). 440-447.
33. CHAUDHURI, S. AND DAYAL, U. 1997. Data warehousing and olap technology. SIGMOD RECORD 26, 1 (Mar.), 65-74.
34. CHEN, L., CHOUBEY, R., AND RUNDENSTEINER, E. A. 1998. Bulk-insertions into R-trees using the Small-Tree-Large-Tree approach. In Proceedings of the 6th International Symposium on Advances in Geographic Information Systems (Washington, DC). R. Laurini, K. Makki, and N. Pissinou, Eds. 161-162.
35. CHOUBEY, R., CHEN, L., AND RUNDENSTEINER, E. A. 1999. GBI: A generalized R-tree bulk-insertion strategy. In Advances in Spatial Databases - 6th International Symposium, SSD'99 (Hong Kong). R. H. Güting, D. Papadias, and F. H. Lochovsky, Eds. 91-108.
36. DE BERG, M., VAN KREVELD, M., OVERMARS, M., AND SCHWARZKOPF, O. 1997. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany.
37. DEMILLO, R. A., EISENSTAT, S. C., AND LIPTON, R. J. 1978. Preserving average proximity in arrays. Communications of the ACM 21, 3 (Mar.), 228-231.
38. DENGEL, A. 1991. Self-adapting structuring and representation of space. Tech. Rep. RR-91-22, Deutsches Forschungszentrum für Künstliche Intelligenz, Kaiserslautern, Germany. Sept.
39. DEWITT, D. J., KABRA, N., LUO, J., PATEL, J. M., AND Yu, J. B. 1994. Client-server paradise. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB) (Santiago, Chile). J. Bocca, M. Jarke, and C. Zaniolo, Eds. 558-569.
40. DI PASQUALE, A., FORLIZZI, L., JENSEN, C. S., MANOLOPOULOS, Y., NARDELLI, E., PFOSER, D., PROIETTI, G., SALTENIS, S., THEODORIDIS, Y., TZOURAMANIS, T., AND VASSILAKOPOULOS, M. 2003. Acces methods and query processing techniques. In Spatiotemporal Databases: The CHOROCHRONOS Approach (Berlin, Germany). M. Koubarakis, T. K. Sellis, A. U. Frank, S. Grumbach, R. H. Güting, C. S. Jensen, N. A. Lorentzos, Y. Manolopoulos, E. Nardelli, B. Pernici, H.-J. Schek, M. Scholl, B. Theodoulidis, and N. Tryfona, Eds. Chap. 6, 203-261.
41. DILLENCOURT, M. B., SAMET, H., AND TAMMINEN, M. 1992. A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM 39, 2 (Apr.), 253-280. Also Corrigendum, Journal of the ACM, 39(4):985, October 1992; University of Maryland Computer Science TR-2303.
42. DITTRICH, J.-P. AND SEEGER, B. 2000. Data redundancy and duplicate detection in spatial join processing. In Proceedings of the 16th IEEE International Conference on Data Engineering. (San Diego, CA). 535-546.
43. DORI, D. AND BEN-BASSAT, M. 1983. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Computer Vision, Graphics, and Image Processing 24, 2 (Nov.), 131-159.
44. DOUGLAS, D. H. 1990. It makes me so CROSS. In Introductory Readings in Geographic Information Systems, D. J. Peuquet and D. F. Marble, Eds. Taylor & Francis, London, United Kingdom, Chapter 21, 303-307. (Originally published as Internal Memorandum, Harvard University Laboratory for Computer Graphics and Spatial Analysis, 1974.)
45. DOUGLAS, D. H. AND PEUCKER, T. K. 1973. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10, 2 (Dec.), 112-122.
46. DYER, C. R. 1981. A VLSI pyramid machine for hierarchical parallel image processing. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing'81 (Dallas, TX). 381-386.
47. DYER, C. R. 1982. Pyramid algorithms and machines. Multicomputers and Image Processing Algorithms and Programs, 409-420.
48. ESPERANCA, C. AND SAMET, H. 1994. Representing orthogonal multidimensional objects by vertex lists. In Aspects of Visual Form. Processing, C. Arcelli, L. P. Cordella, and G. S. di Baja, Eds. World Scientific, Singapore, 209-220.
49. ESPEHANÇA, C. 1995. Orthogonal objects and their application in spatial databases. Ph.D. thesis, Computer Science Department, University of Maryland, College Park, MD. Also Computer Science TR-3566.
50. ESPERANÇA, C. AND SAMET, H. 1997. Orthogonal polygons as bounding structures in filter-refine query processing strategies. In Advances in Spatial Databases - 5th International Symposium, SSD'97 (Berlin, Germany). M. Scholl and A. Voisard, Eds. 197-220.
51. FALOUTSOS, C. AND ROSEMAN, S. 1989. Fractals for secondary key retrieval. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) (Philadelphia, PA). 247-252.
52. FALOUTSOS, C., SELLIS, T., AND ROUSSOPOULOS, N. 1987. Analysis of object oriented spatial access methods. In Proceedings of the ACM SIGMOD Conference. (San Francisco, CA). 426-439.
53. FINKEL, R. A. AND BENTLEY, J. L. 1974. Quad trees: A data structure for retrieval on composite keys. Acta Informatica 4, 1, 1-9.
54. FOLEY, J. D., VAN DAM, A., FEINER, S. K., AND HUGHES, J. F. 1990. Computer Graphics: Principles and Practice, Second ed. Addison-Wesley, Reading, MA.
55. FRANKLIN, W. R. 1984. Adaptive grids for geometric operations. Cartographica 21, 2&3 (Summer & Autumn), 160-167.
56. FREEMAN, H. 1974. Computer processing of line-drawing images. ACM Computing Surveys 6, 1 (Mar.), 57-97.
57. FREESTON, M. 1995. A general solution of the n-dimensional B-tree problem. In Proceedings of the ACM SIGMOD Conference. (San Jose, CA). 80-91.
58. FRIEDMAN, J. H., BENTLEY, J. L., AND FINKEL, R. A. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software 3, 3 (Sept.), 209-226.
59. FUCHS, H., KEDEM, Z. M., AND NAYLOR, B. F. 1980. On visible surface generation by a priori tree structures. Computer Graphics 14, 3 (July), 124-133.
60. Also Proceedings of the SIGGRAPH'80 Conference (Seattle, WA, July).
61. GAEDE, V. 1995. Optimal redundancy in spatial database systems. In Advances in Spatial Databases - 4th International Symposium, SSD'95 (Portland, ME). M. J. Egenhofer and J. R. Herring, Eds. 96-116.
62. GARCÍA, Y. J., LÓPEZ, M. A., AND LEUTENEGGER, S. T. 1998a. A greedy algorithm for bulk loading R-trees. In Proceedings of the 6th International Symposium, on Advances in Geographic Information Systems (Washington, DC). R. Laurini, K. Makki, and N. Pissinou, Eds. 163-164.
63. (Also extended version University of Denver, Computer Science Department Technical Report 97-02.)
64. GARCIA, Y. J., LÓPEZ, M. A., AND LEUTENEGGER, S. T. 1998b. On optimal node splitting for R-trees. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB) (New York). A. Gupta, O. Shmueli, and J. Widom, Eds. 334-344.
65. GARCIA, Y. J., LOPEZ, M. A., AND LEUTENEGGER, S. T. 1999. Post-optimization and incremental refinement of r-trees. In Proceedings of the 7th International Symposium on Advances in Geographic Information Systems (Kansas City, MO). C. B. Medeiros, Ed. 91-96.
66. GARGANTINI, I. 1982. An effective way to represent quadtrees. Communications of the ACM 25, 12 (Dec.), 905-910.
67. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. OBBTree: A hierarchical structure for rapid interference detection. In Proceedings of the SIGGRAPH'96 Conference (New Orleans, LA). 171-180.
68. GRAY, F. 1953. Pulse code communication. United States Patent Number 2632058 March 17, 1953.
69. GREENE, D. 1989. An implementation and performance analysis of spatial data access methods. In Proceedings of the 5th IEEE International Conference on Data Engineering. Los Angeles, 606-615.
70. GUIBAS, L. J. AND STOLFI, J. 1985. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graphics 4, 2 (Apr.), 74-123.
71. (Also Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pages 221-234, Boston, April 1983.)
72. GÜNTHER, O. 1987. Efficient structures for geometric data management. Ph.D. dissertation, University of California at Berkeley, Berkeley, CA.
73. (Also Lecture Notes in Computer Science 337, Springer-Verlag, Berlin, West Germany, 1988; UCB/ERL M87/77.)
74. GÜNTHER, O. AND BILMES, J. 1991. Tree-based access methods for spatial databases: Implementation and performance evaluation. IEEE Transactions on Knowledge and Data Engineering 3, 3 (Sept.), 342-356.
75. (Also Department of Computer Science TRCS88-23, University of California at Santa Barbara, Santa Barbara, CA.)
76. GÜNTHER, O. AND NOLTEMEIER, H. 1991. Spatial database indices for large extended objects. In Proceedings of the 7th IEEE International Conference on Data Engineering (Kobe, Japan). 520-526.
77. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference (Boston, MA). 47-57.
78. HELLERSTEIN, J. M., NAUGHTON, J. F., AND PFEFFER, A. 1995. Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB), U. Dayal, P. M. D. Gray, and S. Nishio, Eds. Zurich, Switzerland, 562-573.
79. h-tree: An access structure for feature vectors. In Proceedings of the 14th IEEE International Conference on Data Engineering. Orlando, FL, 362-369.
80. HENRICH, A., SIX, H.W., AND WIDMAYER, P. 1989. The LSD tree: Spatial access to multidimensional point and non-point data. In Proceedings of the 16th International Conference on Very Large Databases (VLDB) (Amsterdam, The Netherlands). P. M. G. Apers and G. Wiederhold, Eds. 45-53.
81. HILBERT, D. 1891. Ueber stetige abbildung einer linie auf flächenstück. Mathematische Annalen 38, 459-460.
82. HOEL, E. G. AND SAMET, H. 1992. A qualitative comparison study of data structures for large line segment databases. In Proceedings of the ACM SIGMOD Conference (San Diego, CA), M. Stonebraker, Ed. 205-214.
83. HOEL, E. G. AND SAMET, H. 1995. Benchmarking spatial join operations with spatial output. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB) (Zurich, Switzerland). U. Dayal, P. M. D. Gray, and S. Nishio, Eds. 606-618.
84. HUBBARD, P. M. 1995. Collision detection for interactive computer graphics applications. IEEE Transactions on Visualization and Computer Graphics 1, 3 (Sept.), 218-230.
85. HUBBARD, P. M. 1996. Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Graphics 15, 3 (July), 179-210.
86. HUNTER, G. M. 1978. Efficient computation and data structures for graphics. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ.
87. ICHIKAWA, T. 1981. A pyramidal representation of images and its feature extraction facility. IEEE Transactions on Pattern Analysis and Machine Intelligence 3, 3 (May), 257-264.
88. JAGADISH, H. V. 1990a. Linear clustering of objects with multiple attributes. In Proceedings of the ACM SIGMOD Conference (Atlantic City, NJ). 332-342.
89. JAGADISH, H. V. 1990b. Spatial search with polyhedra. In Proceedings of the 6th IEEE International Conference on Data Engineering (Los Angeles, CA). 311-319.
90. JOY, K. I., LEGAKIS, J., AND MACCRACKEN, R. 2003. Data structures for multiresolution representation of unstructured meshes. In Hierarchical and Geometrical Methods in Scientific Visualization, G. Farin, B. Hamman, and H. Hagen, Eds. Springer-Verlag, Berlin, Germany, 143-170.
91. KAMEL, I. AND FALOUTSOS, C. 1993. On packing R-trees. In Proceedings of the 2nd International Conference on Information and Knowledge Management (CIKM) (Washington, DC). 490-499.
92. KAMEL, I. AND FALOUTSOS, C. 1994. Hilbert R-tree: An improved R-tree using fractals. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB) (Santiago, Chile). J. Bocca, M. Jarke, and C. Zaniolo, Eds. 500-509.
93. KAMEL, I., KHALIL, M., AND KOURAMAJIAN, V. 1996. Bulk insertion in dynamic R-trees. In Proceedings of the 7th International Symposium on Spatial Data Handling, M. J. Kraak and M. Molenaar, Eds. International Geographical Union Commission on Geographic Information Systems, Association for Geographical Information, Delft, The Netherlands, 3B.31-3B.42.
94. KATAYAMA, N. AND SATOH, S. 1997. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference (Tucson, AZ). J. Peckham, Ed. 369-380.
95. KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed. Academic Press, New York, 303-337.
96. KLOSOWSKI, J. T., HELD, M., MITCHELL, J. S. B., SOWIZRAL, H., AND ZIKAN, K. 1998. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and. Computer Graphics 4, 1 (Jan.), 21-36.
97. KNOWLTON, K. 1980. Progressive transmission of grey-scale and binary pictures by simple efficient, and lossless encoding schemes. Proceedings of the IEEE 68, 7 (July), 885-896.
98. KNUTH, D. E. 1997. The Art of Computer Programming: Fundamental Algorithms, Third ed. Vol. 1. Addison-Wesley, Reading, MA.
99. KNUTH, D. E. 1998. The Art of Computer Programming: Sorting and Searching, Second ed. Vol. 3. Addison-Wesley, Reading, MA.
100. KOUDAS, N. AND SEVCIK, K. C. 1997. Size separation spatial join. In Praceedings of the ACM SIGMOD Conference (Tucson, AZ). J. Peckham, Ed. 324-335.
101. KRIEGEL, H.-P., HORN, H., AND SCHIWIETZ, M. 1991. The performance of object decomposition techniques for spatial query processing. In Advances in Spatial Databases - 2nd Symposium, SSD'91, O. Günther and H.-J. Schek, Eds. Zurich, Switzerland, 257-276.
102. LEA, D. 1988. Digital and hilbert k-d trees. Information Processing Letters 27, 1 (Feb.), 35-41.
103. LEE, Y.-J. AND CHUNG, C.-W. 2001. The DR-tree: A main memory data structure for complex multi-dimensional objects. Geoinformatica 6, 2 (June), 181-207.
104. LEUTENEGGER, S. T., LÓPEZ, M. A., AND EDGINOTON, J. 1997. STR: A simple and efficient algorithm for R-tree packing. In Proceedings of the 13th IEEE International Conference on Data Engineering, A. Gray and P.-Å. Larson, Eds. Birmingham, United Kingdom, 497-506.
105. LIU, X. AND SCHRACK, G. F. 1998. A new ordering strategy applied to spatial data processing. International Journal Geographical Information Science 12, 1, 3-22.
106. Lo, M.-L. AND RAVISHANKAR, C. V. 1994. Spatial joins using seeded trees. In Proceedings of the ACM SIGMOD Conference (Minneapolis, MN). 209-220.
107. Lo, M.-L. AND RAVISHANKAR, C. V. 1996. Spatial hash-joins. In Proceedings of the ACM SIGMOD Conference (Montréal, Ont., Canada). 247-258.
108. MEAGHER, D. 1982. Geometric modeling using octree encoding. Computer Graphics and Image Processing 19, 2 (June), 129-147.
109. MILLER, R. AND STOUT, Q. F. 1985. Pyramid computer algorithms for determining geometric properties of images. In Proceedings of the Symphosium on Computational Geometry. Baltimore, MD, 263-269.
110. MOITRA, A. 1993. Spatio-temporal data management using R-trees. In Proceedings of the ACM Workshop on Advances in Geographic Information Systems, N. Pissinou, Ed. Arlington, VA, 28-33.
111. MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. IBM Ltd., Ottawa, Canada.
112. NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K. C. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Transactions on Database Systems 9, 1 (Mar.), 38-71.
113. OMOHUNDRO, S. M. 1989. Five balltree construction algorithms. Tech. Rep. TR-89-063, International Computer Science Institute, Berkeley, CA. Dec.
114. ORENSTEIN, J. A. AND MERRETT, T. H. 1984. A class of data structures for associative searching. In Proceedings of the 3rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) (Waterloo, Ontario, Canada). 181-190.
115. O'ROURKE, J. AND SLOAN JR., K. R. 1984. Dynamic quantization: Two adaptive data structures for multidimensional spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 3 (May), 266-280.
116. OTTMANN, T. AND WOOD, D. 1980. 1-2 brother trees or AVL trees revisited. Computer Journal 23, 3 (Aug.), 248-255.
117. PARK, C. M. AND ROSENFELD, A. 1971. Connectivity and genus in three dimensions. Computer Science TR-156, University of Maryland, College Park, MD. May.
118. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proceedings of the ACM SIGMOD Conference (Montréal, Ont., Canada). 259-270.
119. PEANO, G. 1890. Sur une courbe qui remplit toute une aire plaine. Mathematische Annalen 36, 157-160.
120. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
121. REDDY, D. R. AND RUBIN, S. 1978. Representation of three-dimensional objects. Computer Science Department CMU-CS-78-113, Carnegie-Mellon University, Pittsburgh. Apr.
122. RIGAUX, P., SCHOLL, M., AND VOISARD, A. 2001. Spatial Database Management Systems: Applications to GIS. Morgan-Kaufmann, San Francisco.
123. ROBINSON, J. T. 1981. The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the ACM SIGMOD Conference. Ann Arbor, MI, 10-18.
124. ROSENFELD, A. 1980. Quadtrees and pyramids. In Proceedings of the 5th International Conference on Pattern Recognition. Miami Beach, 802-811.
125. ROSENFELD, A. 1984. Some useful properties of pyramids. In Multiresolution Image Processing and Analysis, A. Rosenfeld, Ed. Springer-Verlag, Berlin, West Germany, 2-5.
126. ROSENFELD, A. AND PFALTZ, J. L. 1966. Sequential operations in digital picture processing. Journal of the ACM 13, 4 (Oct.), 471-494.
127. ROSS, K. A., SITZMANN, I., AND STUCKEY, P. J. 2001. Cost-based unbalanced R-trees. In Proceedings of the 13th International Conference on Scientific and Statistical Database Management. Fairfax, VA, 203-212.
128. ROUSSOPOLOS, N., KOTIDIS, Y., AND ROUSSOPOLOS, M. 1997. Cubetree: Organization of and bulk incremental updates on the data cube. In Proceedings of the ACM SIGMOD Conference, J. Peckham, Ed. Tucson, AZ, 89-111.
129. ROUSSOPOULOS, N. AND LEIFKER, D. 1985. Direct spatial search on pictorial databases using packed R-trees. In Proceedings of the ACM SIGMOD Conference. Austin, TX, 17-31.
130. RUTOVITZ, D. 1968. Data structures for operations on digital images. In Pictorial Pattern Recognition, G. C. Cheng, R. S. Ledley, D. K. Pollock, and A. Rosenfeld, Eds. Thompson Book Co., Washington, DC, 105-133.
131. SAALFELD, A. 1987. It doesn't make me nearly as CROSS, some advantages of the point-vector representation of line segments in automated cartography. International Journal of Geographical Information Systems 1, 4, 379-386.
132. SAGAN, H. 1994. Space-Filling Curves. Springer-Verlag, New York.
133. SAKURAI, Y., YOSHIKAWA, M., UEMURA, S., AND KOJIMA, H. 2000. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB) (Cairo, Egypt). A. El Abbadi, M. L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, and K.-Y. Whang, Eds. 516-526.
134. SAMET, H. 1990a. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA.
135. SAMET, H. 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
136. SAMET, H. 1995. Spatial data structures. In Modern Database Systems, The Object Model, Interoperability and Beyond, W. Kim, Ed. ACM Press and Addison-Wesley, New York, 361-385.
137. SAMET, H. 2004. Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing. ACM Trans. Database Syst. 29, 4 (Dec.).
138. Also University of Maryland Computer Science TR-4526.
139. SAMET, H. 2005. Foundations of Multidimensional and Metric Data Structures. To appear.
140. SAMET, H. AND AREF, W. G. 1995. Spatial data models and query processing. In Modern Database Systems, The Object Model, Interoperability and Beyond, W. Kim, Ed. ACM Press and Addison-Wesley, New York, 338-360.
141. SAMET, H. AND TAMMINEN, M. 1988. Efficient component labeling of images of arbitrary dimension represented by linear bintrees. IEEE Transactions on Pattern Analysis and Machine Intelligence 10, 4 (July), 579-586.
142. SCHIWIETZ, M. 1993. Organization and query processing of spatial objects. Ph.D. thesis, Ludwig-Maximilians Universität München, Munich, Germany. In German.
143. SCHIWIETZ, M. AND KRIEGEL, H.-P. 1993. Query processing of spatial objects: Complexity versus redundancy. In Advances in Spatial Databases-3rd International Symposium, SSD'93, D. Abel and B. C. Ooi, Eds. Singapore, 377-396.
144. SCHNEIDER, R. AND KRIEGEL, H.-P. 1991. The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations. In Computational Geometry - Methods, Algorithms and Applications, H. Bieri and H. Noltemeier, Eds. Bern, Switzerland, 249-264.
145. SCHRACK, G. AND LIU, X. 1995. The spatial u-order and some of its mathematical characteristics. In Proceedings of the Pacific Rim Conference on Communications, Computers, and Signal Processing (Victoria, British Columbia, Canada). 416-419.
146. +-tree: A dynamic index for multi-dimensional objects. In Proceedings of the 13th International Conference on Very Large Databases (VLDB), P. M. Stocker and W. Kent, Eds. Brighton, United Kingdom, 71-79.
147. (Also Computer Science TR-1795, University of Maryland, College Park, MD.)
148. SHAFFER, C. A. AND SAMET, H. 1987. An in-core hierarchical data structure organization for a geographic database. Computer Science Department TR 1886, University of Maryland, College Park, MD. July.
149. SHAMOS, M. I. AND HOEY, D. 1976. Geometric intersection problems. In Proceedings of the 17th IEEE Annual Symposium on Foundations of Computer Science (Houston, TX). 208-215.
150. SHEKHAR, S. AND CHAWLA, S. 2003. Spatial Databases: A Tour. Prentice-Hall, Englewood Cliffs, NJ.
151. SLOAN JR., K. R. 1981. Dynamically quantized pyramids. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Vancouver, Canada). 734-736.
152. SOLNTSEFF, N. AND WOOD, D. 1977. Pyramids: A data type for matrix representation in PASCAL. BIT 17, 3, 344-350.
153. SRIHARI, S. N. 1984. Pyramid representation for solids. Information Sciences 34, 25-46.
154. STONEBRAKEH, M., SELLIS, T., AND HANSON, E. 1986. An analysis of rule indexing implementations in data base systems. In Proceedings of the 1st International Conference on Expert Database Systems. Charleston, SC, 353-364.
155. SUETENS, P., FUA, P., AND HANSON, A. J. 1992. Computational strategies for object recognition. ACM Computing Surveys 24,1 (Mar.), 5-61.
156. TAMMINEN, M. 1984. Comment on quad- and oct-trees. Communications of the ACM 27, 3 (Mar.), 248-249.
157. TANIMOTO, S. L. AND PAVLIDIS, T. 1975. A hierarchical data structure for picture processing. Computer Graphics and Image Processing 4, 2 (June), 104-119.
158. THEODORIDIS, Y. AND SELLIS, T. 1993. Optimization issues in R-tree construction. Knowledge and Database Systems Laboratory Report KDBSLAB-TR-93-08, National Technical University of Athens, Athens, Greece. Oct.
159. THEODORIDIS, Y. AND SELLIS, T. 1994. Optimization issues in R-tree construction. In IGIS'94: Geographic Information Systems, International Workshop on Advanced Research in Geographic Information Systems, J. Nievergelt, T. Roos, H.-J. Schek, and P. Widmayer, Eds. Monte Verità, Ascona, Switzerland, 270-273.
160. THEODORIDIS, Y., STEFANAKIS, E., AND SELLIS, T. K. 2000. Efficient cost models for spatial queries using R-trees. IEEE Transactions on Knowledge and Data Engineering 12, 1 (January/February), 19-32.
161. TOMLIN, C. D. 1990. Geographic information systems and cartographic modelling. Prentice Hall, Englewood Cliffs, NJ.
162. TROPF, H. AND HERZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angewandte Informatik 23, 2 (Feb.), 71-77.
163. VAN DEN BERCKEN, J., BLOHSFELD, B., DITTRICH, J.-P., KRÄMER, J., SCHÄFER, T., SCHNEIDER, M., AND SEEGER, B. 2001. XXL - a library approach to supporting efficient implementations of advanced database queries. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB), P. M. G. Apers, P. Atzeni, S. Ceri, S. Paraboschi, K. Ramamohanarao, and R. T. Snodgrass, Eds. Roma, Italy, 39-48.
164. VAN DEN BERCKEN, J., SEEGER, B., AND WIDMAYER, P. 1997. A generic approach to bulk loading multidimensional index structures. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, Eds. Athens, Greece, 406-415.
165. VAN OOSTEROM, P. 1990. Reactive data structures for geographic information systems. Ph.D. the sis, Department of Computer Science, Leiden University, Leiden, The Netherlands.
166. VAN OOSTEROM, P. AND CLAASSEN, E. 1990. Orientation insensitive indexing methods for geometric objects. In Proceedings of the 4th International Symposium on Spatial Data Handling. Vol. 2. Zurich, Switzerland, 1016-1029.
167. WANG, W., YANG, J., AND MUNTZ, R. 1998. PK-tree: A spatial index structure for high dimensional point data. In Proceedings of the 5th International Conference on Foundations of Data Organization and Algorithms (FODO), K. Tanaka and S. Ghandeharizadeh, Eds. Kobe, Japan, 27-36.
168. WANG, W., YANG, J., AND MUNTZ, R.R. 1997. STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, Eds. Athens, Greece, 186-195.
169. WHITE, D. A. AND JAIN, R. 1996a. Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, Visual Computing Laboratory, University of California, San Diego, CA. (see http://vision.ucsd.edu/papers/simret).
170. WHITE, D. A. AND JAIN, R. 1996b. Similarity indexing with the SS-tree. In Proceedings of the 12th IEEE International Conference on Data Engineering (New Orleans, LA). S. Y. W. Su, Ed. 516-523.
171. WHITE, M. 1982. N-trees: Large ordered indexes for multi-dimensional space. Statistical research division, US Bureau of the Census, Washington, DC.