Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing

ACM Transactions on Database Systems

Volumn 29, Issue 4, 2004, Pages 789-830

  Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

BV trees; Decoupling; Object hierarchies; PK trees; R trees; Space decomposition; Spatial indexing

Indexed keywords

BV-TREES; DECOUPLING; OBJECT HIERARCHIES; PK-TREES; R-TREES; SPACE DECOMPOSITION; SPATIAL INDEXING;

ALGORITHMS; COMPUTER SCIENCE; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS;

INDEXING (OF INFORMATION);

EID: 11344253943     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1042046.1042052     Document Type: Review

References (87)

1. ABEL, D. J. 1984. A B+-tree structure for large quadtrees. Comput. Vis. Graph. Image Process. 27, 1 (July), 19-31.
2. AGGARWAL, C., WOLF, J., Yu, P., AND EPELMAN, M. 1997. The S-tree: an efficient index for multidimensional objects. In Proceedings of 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. BV-trees and R-trees for collections of extended objects represented by their minimum bounding hyper-rectangles. Tech. Rep. 4632, Department of Computer Science, University of Maryland, College Park, MD.
4. ANDERSSON, A. AND NILSSON, S. 1993. Improved behaviour of tries by adaptive branching. Inf. Process. Lett. 46, 6 (July), 295-300.
5. AREF, W. G. AND SAMET, H. 1992. Uniquely reporting spatial objects: yet another operation for comparing spatial data structures. In Proceedings of the 5th International Symposium on Spatial Data Handling (Charleston, SC). 178-189.
6. AREF, 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 and Systems (Gaithersburg, MD), N. Pissinou and K. Makki, Eds. 60-67.
7. 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.
8. 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.
9. 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, NY), A. Gupta, O. Shmueli, and J. Widom, Eds. 570-581.
10. BAYER, R. AND MCCREIGHT, E. M. 1972. Organization and maintenance of large ordered indexes. Acta Informatica 1, 3, 173-189.
11. 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.
12. BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Commun. Assoc. Comput. Mach. 18, 9 (Sept.), 509-517.
13. BERCHTOLD, S., BÖHM, C., AND KRIEGEL, H.-P. 1998. Improving the query performance of high-dimensional index structures by bulk-load operations. In Advances in Database Technology - EDBT'98, Proceedings of the 6th International Conference on Extending Database Technology (Valencia, Spain). 216-230.
14. BERCHTOLD, S., BÖHM, C., KRIEGEL, H.-R, SANDER, J., AND JAGADISH, H. V. 2000. Independent quantization: An index compression technique for high-dimensional data spaces. In Proceedings of the 16th IEEE International Conference on Data Engineering (San Diego, CA). 577-588.
15. 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.
16. BEYER, K. S., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is "nearest neighbor" meaningful? In Proceedings of the 7th International Conference on Database Theory (ICDT'99, Berlin, Germany), C. Beeri and P. Buneman, Eds. 217-235.
17. 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. Sum. 33, 3 (Sept.), 322-373.
18. BRABEC, F., HJALTASON, G. R., AND SAMET, H. 2001. Indexing spatial objects with the PK-tree. Unpublished manuscript.
19. 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.
20. COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2 (June), 121-137.
21. DE FLORIANI, L., MAHZANO, P., AND PUPPO, E. 1996. Multiresolution models for topographic surface description. Vis. Comput. 12, 7 (Aug.), 317-345.
22. 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.
23. E911. 1996. Compatibility of wireless services with enhanced 911. Federal Register, 40348-40352.
24. E911. 1999. Wireless radio services; compatibility with enhanced 911 emergency calling systems. Federal Register, 60126-60131.
25. EVANGELIDIS, G., LOMET, D., AND SALZBERG, B. 1994. Node deletion in the hB∏-tree. Tech. rep. NU-CCS-94-04. Northeastern University, Boston, MA.
26. EVANGELIDIS, G., LOMET, D., AND SALZBERG, B. 1995. The hB∏-tree: A modified hB-tree supporting concurrency, recovery and node consolidation. 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.
27. EVANGELIDIS, G., LOMET, D., AND SALZBERG, B. 1997. The hB∏-tree: A multi-attribute index supporting concurrency, recovery and node consolidation. VLDB J. 6, 1, 1-25.
28. 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.
29. 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.
30. FERHATOSMANOGLU, H., TUNCEL, E., AGRAWAL, D., AND EL ABBADI, A. 2000. Vector approximation based indexing for non-uniform high dimensional data sets. In Proceedings of the 9th International Conference on Information and Knowledge Management (CIKM, McLean, VA). 202-209.
31. FREESTON, M. 1987. The BANG file: A new kind of grid file. In Proceedings of the ACM SIGMOD Conference (San Francisco, CA). 260-269.
32. FREESTON, M. 1994. A general solution of the n-dimensional B-tree problem. Computer Science Department Report ECRC-94-40. ECRC, Munich, Germany.
33. 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.
34. FREESTON, M. 1997. On the complexity of BV-tree updates. In Constraint Databases and Their Applications-2nd International Workshop on Constraint Database System (CDB'97, Delphi, Greece), V. Gaede, A. Brodsky, O. Günther, D. Srivastava, V. Vianu, and M. Wallace, Eds. 282-293.
35. FREESTON, M. W. 1989. Advances in the design of the BANG file. In Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms (FODO, Paris, France), W. Litwin and H.-J. Schek, Eds. 322-338.
36. 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.
37. 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.
38. GUTTMAN, A. 1984. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference (Boston, MA). 47-57.
39. 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 15th International Conference on Very Large Databases (VLDB, Amsterdam, The Netherlands), P. M. G. Apers and G. Wiederhold, Eds. 45-53.
40. HILBERT, D. 1891. Ueber stetige abbildung einer linie auf flächenstück. Mathematische Annalen 38, 459-460.
41. 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.
42. HUBBARD, P. M. 1995. Collision detection for interactive computer graphics applications. IEEE Trans. Vis. Comput. Graph. 1, 3 (Sept.), 218-230.
43. JAGADISH, H. V. 1990a. Linear clustering of objects with multiple attributes. In Proceedings of the ACM SIGMOD Conference (Atlantic City, NJ). 332-342.
44. JAGADISH, H. V. 1990b. Spatial search with polyhedra. In Proceedings of the 6th IEEE International Conference on Data Engineering (Los Angeles, CA). 311-319.
45. 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.
46. KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed. Academic Press, New York, NY, 303-337.
47. KNOTT, G. D. 1971. Expandable open addressing hash table storage and retrieval. In Proceedings of the SIGFIDET Workshop on Data Description, Access and Control (San Diego, CA). 187-206.
48. KOUDAS, N. AND SEVCIK, K. C. 1997. Size separation spatial join. In Proceedings of the ACM SIGMOD Conference (Tucson, AZ), J. Peckham, Ed. 324-335.
49. KRISHNAMURTHY, R. AND WHANG, K.-Y. 1985. Multilevel grid files. Tech. rep. IBM T. J. Watson Research Center, Yorktown Heights, NY.
50. Li, J., ROTEM, D., AND SRIVASTAVA, J. 1993. Algorithms for loading parallel grid files. In Proceedings of the ACM SIGMOD Conference (Washington, DC). 347-356.
51. Lo, M.-L. AND RAVISHANKAR, C. V. 1994. Spatial joins using seeded trees. In Proceedings of the ACM SIGMOD Conference (Minneapolis, MN). 209-220.
52. Lo, M.-L. AND RAVISHANKAR, C. V. 1996. Spatial hash-joins. In Proceedings of the ACM SIGMOD Conference (Montréal, P.Q., Canada). 247-258.
53. LOMET, D. AND SALZBERG, B. 1989. A robust multi-attribute search structure. In Proceedings of the 5th IEEE International Conference on Data Engineering (Los Angeles, CA), 296-304.
54. LOMET, D. AND SALZBERG, B. 1990. The hB-tree: A multi-attribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4 (Dec.), 625-658. Also Tech. rep. NU-CCS-87-24; Northeastern University, Boston, MA.
55. LOMET, D. AND SALZBERG, B. 1990. The hB-tree: A multi-attribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4 (Dec.), 625-658. Also Tech. rep. NU-CCS-87-24; Northeastern University, Boston, MA.
56. MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Unpublished paper. IBM Ltd., Ottawa, Ont. Canada.
57. NELSON, R. C. AND SAMET, H. 1986. A consistent hierarchical representation for vector data. Comput. Graph. 20, 4 (Aug.), 197-206. Also in Proceedings of the SIGGRAPH'86 Conference (Dallas, TX, August 1986).
58. NELSON, R. C. AND SAMET, H. 1986. A consistent hierarchical representation for vector data. Comput. Graph. 20, 4 (Aug.), 197-206. Also in Proceedings of the SIGGRAPH'86 Conference (Dallas, TX, August 1986).
59. NELSON, R. C. AND SAMET, H. 1987. A population analysis for hierarchical data structures. In Proceedings of the ACM SIGMOD Conference (San Francisco, CA). 270-277.
60. NILSSON, S. AND TIKKANEN, M. 2002. An experimental study of compression methods for dynamic tries. Algorithmica 33, 1, 19-33.
61. OHSAWA, Y. AND SAKAUCHI, M. 1983a. The BD-Tree-a new rc-dimensional data structure with highly efficient dynamic characteristics. In Information Processing'83 (Paris, France), R. E. A. Mason, Ed. North-Holland, Amsterdam, The Netherlands, 539-544.
62. OHSAWA, Y. AND SAKAUCHI, M. 1983b. Multidimensional data management structure with efficient dynamic characteristics. Syst. Comput. Controls 14, 5, 77-87. (Translated from Denshi Tsushin Gakkai Ronbunshi 66-D, 10 Oct. 1983), 1193-1200).
63. OHSAWA, Y. AND SAKAUCHI, M. 1983b. Multidimensional data management structure with efficient dynamic characteristics. Syst. Comput. Controls 14, 5, 77-87. (Translated from Denshi Tsushin Gakkai Ronbunshi 66-D, 10 Oct. 1983), 1193-1200).
64. OMOHUNDRO, S. M. 1989. Five balltree construction algorithms. Tech. rep. TR-89-063. International Computer Science Institute, Berkeley, CA.
65. ORENSTEIN, J. A. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4 (June), 150-157.
66. 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, Ont., Canada). 181-190.
67. OUKSEL, M. A. AND MAYER, O. 1992. A robust and efficient spatial data structure. Acta Informatica 29, 4 (July), 335-373.
68. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proceedings of the ACM SIGMOD Conference (Montréal, P.Q., Canada). 259-270.
69. REDDY, D. R. AND RUBIN, S. 1978. Representation of three-dimensional objects. Computer Science Department Tech. rep. CMU-CS-78-113. Carnegie-Mellon University, Pittsburgh, PA.
70. 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.
71. ROSENFELD, A., SAMET, H., SHAFFER, C., AND WEBBER, R. E. 1983. Application of hierarchical data structures to geographical information systems: phase II. Computer Science Department Tech. rep. TR-1327. University of Maryland, College Park, MD.
72. SALZBERG, B. 1988. File Structures: An Analytic Approach. Prentice-Hall, Englewood Cliffs, NJ.
73. SALZBERG, B. 1994. On indexing spatial and temporal data. Inf. Syst. 19, 6 (Sept.), 447-465.
74. SAMET, H. 1990a. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA.
75. SAMET, H. 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
76. SEEGER, B. AND KRIEGEL, H.-P. 1990. The buddy-tree: An efficient and robust access method for spatial data base systems. In Proceedings of the 16th International Conference on Very Large Databases (VLDB, Brisbane, Australia), D. McLeod, R. Sacks-Davis, and H.-J. Schek, Eds. 590-601.
77. + -tree: A dynamic index for multidimensional objects. In Proceedings of the 13th International Conference on Very Large Databases (VLDB, Brighton, U.K.), P. M. Stocker and W. Kent, Eds. 71-79. Also Computer Science Tech. rep. TR-1795, University of Maryland, College Park, MD.
78. + -tree: A dynamic index for multidimensional objects. In Proceedings of the 13th International Conference on Very Large Databases (VLDB, Brighton, U.K.), P. M. Stocker and W. Kent, Eds. 71-79. Also Computer Science Tech. rep. TR-1795, University of Maryland, College Park, MD.
79. STONEBRAKER, 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, SO. 353-364.
80. THEODORIDIS, Y., STEFANAKIS, E., AND SELLIS, T. K. 2000. Efficient cost models for spatial queries using R-trees. IEEE Trans. Knowl Data Eng. 12, 1 (Jan./Feb.), 19-32.
81. 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 Databases (VLDB, Athens, Greece), M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, Eds. 406-415.
82. VAN OOSTEROM, P. AND ULAASSEN, E. 1990. Orientation insensitive indexing methods for geometric objects. In Proceedings of the 4th International Symposium on Spatial Data Handling (Zurich, Switzerland), Vol. 2. 1016-1029.
83. WANG, W., YANG, J., AND MUNTZ, R. 1998a. 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, Kobe, Japan), K. Tanaka and S. Ghandeharizadeh, Eds. 27-36.
84. WANG, W., YANG, J., AND MUNTZ, R. 1998b. PK-tree: A spatial index structure for high dimensional point data. Computer Science Department report 980032. University of California, Los Angeles, Los Angeles, CA.
85. WEBER, R., SCHEK, H.-J., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB, New York, NY), A. Gupta, O. Shmueli, and J. Widom, Eds. 194-205.
86. WHITE, D. A. AND JAIN, R. 1996. 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.
87. YANG, J., WANG, W., AND MUNTZ, R. 1997. Yet another spatial indexing structure. Computer Science Department Tec. rep. 97040. University of California at Los Angeles (UCLA), Los Angeles, CA. (Also online at http://dml.cs.ucla.edu/ weiwang/paper/TR97040.ps.)