Metric space similarity joins

ACM Transactions on Database Systems

Volumn 33, Issue 2, 2008, Pages

  Jacox, Edwin H ^a   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Distance based indexing; External memory algorithms; Nearest neighbor queries; Range queries; Ranking; Similarity join

Indexed keywords

(2+1) DIMENSIONS; DISTANCE-BASED; FORMAL ANALYSIS; HIGH-DIMENSIONAL; JOIN ALGORITHMS; MAXIMUM DISTANCE; METRIC SPACES; MULTIDIMENSIONAL INDEXING; NEW METHODS; QUICK SORT; SPATIAL JOINS; TECHNIQUES USED; VECTOR SPACES;

DIFFRACTIVE OPTICAL ELEMENTS; SET THEORY; TOPOLOGY; VECTORS;

INDEXING (OF INFORMATION);

EID: 46649104057     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1366102.1366104     Document Type: Article

References (69)

1. AGGARWAL, C. C. 2003. Towards systematic design of distance functions for data mining applications. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, D.C., 9-18.
2. AGRAWAL, R., FALOUTSOS, C., AND SWAMI, A. N. 1993. Efficient similarity search in sequence databases. In Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms (FODO). D. B. Lomet, Ed. Lecture Notes in Computer Science, vol. 730. Springer-Verlag, 69-84.
3. AGRAWAL, R., PSAILA, G., WIMMERS, E. L., AND ZAÏT, M. 1995. Querying shapes of histories. In Proceedings of 21st VLDB International Conference on Very Large Data Bases. U. Dayal, P. M. D. Gray, and S. Nishio, Eds. Zurich, Switzerland, 502-514.
4. AREF, W. G. AND SAMET, H. 1994. 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.
5. 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). A. Gupta, O. Shmueli, and J. Widom, Eds. New York, NY, 570-581.
6. BÖHM, C., BRAUNMÜLLER, B., BREUNIG, M., AND KRIEGEL, H.-P. 2000. High performance clustering based on the similarity join. In Proceedings of the 9th CIKM International Conference on Information and Knowledge Management. McLean, VA, 298-305.
7. BÖHM, C., BRAUNMÜLLER, B., KREBS, F., AND KRIEGEL, H.-P. 2001. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In Proceedings of the ACM SIGMOD Conference. Santa Barbara, CA, 379-390.
8. BÖHM, C. AND KRIEGEL, H.-P. 2001. A cost model and index architecture for the similarity join. In Proceedings of the 17th IEEE International Conference on Data Engineering. Heidelberg, Germany, 411-420.
9. BRIN, S. 1995. Near neighbor search in large metric spaces. 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, 574-584.
10. BRINKHOFF, T., KRIEGEL, H.-P., AND SEEGER, B. 1993. Efficient processing of spatial joins using R-trees. In Proceedings of the ACM SIGMOD Conference. Washington, DC, 237-246.
11. CHÁVEZ, E., NAVARRO, G., BAEZA- YATES, R., AND MARROQUÍN, J. 2001. Searching in metric spaces. ACM Comput. Surv. 33, 3, 273-322.
12. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms, 2nd Ed. MIT Press/McGraw-Hill, Cambridge, MA.
13. 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.
14. DITTRICH, J.-P. AND SEEGER, B. 2001. GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Francisco, CA, 47-56.
15. DOHNAL, V., GENNARO, C., SAVINO, P., AND ZEZULA, P. 2003. D-Index: Distance searching index for metric data sets. Multimedia Tools Appl. 21, 1, 9-33.
16. DOHNAL, V., GENNARO, C., SAVINO, P., AND ZEZULA, P. 2003a. Similarity join in metric spaces. In Proceedings of the 25th European Conference on IR Research (Advances in Information Retrieval) (ECIR'03). Pisa, Italy, 452-467.
17. DOHNAL, V., GENNARO, C., AND ZEZULA, P. 2003b. Similarity join in metric spaces using eD-Index. In Proceedings of the 14th International Conference on Database and Expert Systems Applications. (DEXA'03). Prague, Czech Republic, 484-493.
18. ELMASRI, R.AND NAVATHE,S.B. 2004. Fundamentals of Database Systems, 4th Ed. Addison-Wesley, Upper Saddle River, NJ.
19. ENDERLE, J., HAMPEL, M., AND SEIDL, T. 2004. Joining interval data in relational databases. In Proceedings of the ACM SIGMOD Conference. Paris, France, 683-694.
20. FALOUTSOS, C., BARBER, R., FLICKNER, M., HAFNER, J., NIBLACK, W., PETKOVIC, D., AND EQUITZ, W. 1994. Efficient and effective querying by image content. J. Intell. Info. Syst. 3, 3/4, 231-262.
21. FALOUTSOS, C. AND LIN, K.-I. 1995. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD Conference. San Jose, CA, 163-174.
22. GUTTMAN, A. 1984. R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference. Boston, MA, 47-57.
23. HARADA, L., NAKANO, M., KITSUREGAWA, M., AND TAKAGI, M. 1990. Query processing for multiattribute clustered records. In Proceedings of the 16th International Conference on Very Large Data Bases. D. McLeod, R. Sacks-Davis, and H.-J. Schek, Eds. Brisbane, Queensland, Australia, 59-70.
24. HETTICH, S. AND BAY,S. D. 1999. The UCI KDD archive. Department of Information and Computer Science. University of California, Irvine, CA. [http://kdd.ics.uci.edu].
25. HJALTASON, G. R. AND SAMET, H. 2003. Index-driven similarity search in metric spaces.ACM Trans. Datab. Syst. 28, 4, 517-580.
26. HOARE, C. A. R. 1962. Quicksort. Comput. J. 5, 1, 10-15.
27. HRISTESCU, G. AND FARACH-COLTON, M. 1999. Cluster-preserving embedding of proteins. Tech. rep., Department of Computer Science, Rutgers University, Piscataway, NJ.
28. HUANG, Y.-W., JING, N., AND RUNDENSTEINER, E. A. 1997. Integrated query processing strategies for spatial path queries. In Proceedings of the 13th IEEE International Conference on Data Engineering. A. Gray and P.-A. Larson, Eds. Birmingham, UK, 477-486.
29. HUTTENLOCHER,D.P., KEDEM, K.,AND KLEINBERG,J.M. 1992. On dynamic voronoi diagrams and the minimum Hausdorff distance for point sets under euclidean motion in the plane. In Proceedings of the 8th Annual Symposium on Computational Geometry (SCG '92). Berlin, Germany, 110-119.
30. JACOX, E. AND SAMET, H. 2003. Iterative spatial join. ACM Trans. Datab. Syst. 28, 3, 268-294.
31. JACOX, E. AND SAMET, H. 2007. Spatial join techniques. ACM Trans. Datab. Syst. 32, 1, 7.
32. JAGADISH, H. V. 1990. Linear clustering of objects with multiple attributes. In Proceedings of the ACM SIGMOD Conference. Atlantic City, NJ, 332-342.
33. JA'JA', J. 2000. A perspective on quicksort. Comput. Science Engin. 2, 1, 43-49.
34. KAHVECI, T., LANG, C., AND SINGH, A. K. 2003. Joining massive high-dimensional datasets. In Proceedings of the 19th IEEE International Conference on Data Engineering. Bangalore, India, 264-276.
35. KALASHNIKOV, D. AND PRABHAKAR, S. 2003. Similarity joins for low- and high-dimensional data. In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA'03). Kyoto, Japan, 7-16.
36. KEDEM, G. 1982. The quad-CIF tree: a data structure for hierarchical on-line algorithms. In Proceedings of the 19th Design Automation Conference. Las Vegas, NV, 352-357.
37. KITSUREGAWA, M., HARADA, L., AND TAKAGI, M. 1989. Join strategies on KD-tree indexed relations. In Proceedings of the 5th IEEE International Conference on Data Engineering. Los Angeles, CA, 85-93.
38. KOPERSKI, K. AND HAN, J. 1995. Discovery of spatial association rules in geographic information systems. In Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD'95). M. J. Egenhofer and J. R. Herring, Eds. Lecture Notes in Computer Science. vol. 951, Springer-Verlag, 47-66.
39. KORN, F., SIDIROPOULOS, N., FALOUTSOS, C., SIEGEL, E., AND PROTOPAPAS, Z. 1996. Fast nearest neighbor search in medical image databases. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB). T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, Eds. Mumbai (Bombay), India, 215-226.
40. KOUDAS, N. AND SEVCIK, K. C. 1997. Size separation spatial join. In Proceedings of the ACM SIGMOD Conference. J. Peckham, Ed. Tucson, AZ, 324-335.
41. KOUDAS, N. AND SEVCIK, K. C. 1998. High dimensional similarity joins: algorithms and performance evaluation. In Proceedings of the 14th IEEE International Conference on Data Engineering. Orlando, FL, 466-475.
42. KOUDAS, N. AND SEVCIK, K. C. 2000. High dimensional similarity joins: algorithms and performance evaluation. IEEE Trans. Knowl. Data Engin. 12, 1, 3-18.
43. LEVENSHTEIN, V. A. 1966. Binary codes capable of correcting deletions, insertion, and reversals. Cybern. Control Theory 10, 8, 707-710.
44. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15, 215-245.
45. LO, M.-L. AND RAVISHANKAR, C. V. 1995. Generating seeded trees from data sets. In Proceedings of the 4th International Symposium on Advances in Spatial Databases (SSD'95). M. J. Egenhofer and J. R. Herring, Eds. Lecture Notes in Computer Science, vol. 951, Springer-Verlag, 328-347.
46. MERRETT, T. H., KAMBAYASHI, Y., AND YASUURA, H. 1981. Scheduling of page-fetches in join operations. In Proceedings of the 7th International Conference on Very Large Data Bases. Cannes, France, 488-498.
47. NEYER, G. AND WIDMAYER, P. 1997. Singularities make spatial join scheduling hard. In Proceedings of the 8th International Symposium on Algorithms and Computation (ISAAC). Singapore, 293-302.
48. NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K. C. 1984. The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Datab. Syst. 9, 1, 38-71.
49. ORENSTEIN, J. A. 1986. Spatial query processing in an object-oriented database system. In Proceedings of the ACM SIGMOD Conference. Washington, DC, 326-336.
50. ORENSTEIN, J. A. 1989. Strategies for optimizing the use of redundancy in spatial databases. In Proceedings of the 1st Symposium on Design and Implementation of Large Spatial Databases (SSD'89).A.Buchmann,O. Günther,T.R.Smith, and Y.-F. Wang, Eds. Lecture NotesinComputer Science, vol. 409, Springer-Verlag, 115-134.
51. PAPADIAS, D. AND ARKOUMANIS, D. 2002. Approximate processing of multiway spatial joins in very large databases. In Proceedings of the 8th International Conference on Extending Database Technology, (EDBT'02). C. S. Jensen, K. G. Jeffery, J. Pokorný, S. Saltenis, E. Bertino, K. Böhm, and M. Jarke, Eds. Lecture Notes in Computer Science, vol. 2287, 179-196.
52. PATEL, J. M. AND DEWITT, D. J. 1996. Partition based spatial-merge join. In Proceedings of the ACM SIGMOD Conference. Montréal, Canada, 259-270.
53. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, Berlin, Germany.
54. 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.
55. RUCKLIDGE, W. J. 1995. Locating objects using the Hausdorff distance. In Proceedings of the 5th International Conference on Computer Vision (ICCV'95). Boston, MA, 457-464.
56. RUCKLIDGE, W. J. 1996. Efficient Visual Recognition Using the Hausdorff Distance. Springer-Verlag, Berlin, Germany.
57. SAMET, H. 1990a. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA.
58. SAMET, H. 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.
59. SAMET, H. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA.
60. SHIM, K., SRIKANT, R., AND AGRAWAL, R. 1997. High-dimensional similarity joins. In Proceedings of the 13th IEEE International Conference on Data Engineering. Birmingham U.K., 301-311.
61. SHIM, K., SRIKANT, R., AND AGRAWAL, R. 2002. High-dimensional similarity joins. IEEE Trans. Knowl. Data Engin. 14, 1, 156-171.
62. TASAN, M. AND ÖZSOYOGLU, Z. M. 2004. Improvements in distance-based indexing. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management. M. Hatzopoulos and Y. Manolopoulos, Eds. Santorini, Greece, 161-170.
63. UHLMANN, J. K. 1991. Satisfying general proximity/similarity queries with metric trees. Inform. Process. Lett. 40, 4, 175-179.
64. VORONOI, G. 1909. Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxiême mémoire: Recherches sur les parallèlloèdres primitifs. Seconde partie. Journal für die Reine und Angewandte Mathematik 136, 2, 67-181.
65. WANG, J. T., WANG, X., LIN, K.-I., SHASHA, D., SHAPIRO, B. A., AND ZHANG, K. 1999. Evaluating a class of distance-mapping algorithms for data mining and clustering. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Diego, CA, 307-311.
66. XIA, C., LU, J., OOI, B. C., AND HU, J. 2004. Gorder: an efficient method for KNN join processing. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). M. A. Nascimento, M. T. Özsu, D.Kossmann, R. J.Miller,J. A. Blakely, and K. B.Schiefer, Eds. Toronto, Canada, 756-767.
67. YIANILOS, P. N. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. Austin, TX, 311-321.
68. ZEZULA, P., AMATO, G., DOHNAL, V., AND BATKO, M. 2006. Similarity search: The metric space approach. Advances in Database Systems, Vol. 32. Springer, Berlin, Germany.
69. ZHANG, J., MAMOULIS, N., PAPADIAS, D., AND TAO, Y. 2004. All-nearest-neighbors queries in spatial databases. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management, M. Hatzopoulos and Y. Manolopoulos, Eds. Santorini, Greece, 297-306.