Integrating XML data sources using approximate joins

ACM Transactions on Database Systems

Volumn 31, Issue 1, 2006, Pages 161-207

  Guha, Sudipto ^a   Jagadish, H V ^b   Koudas, Nick ^c   Srivastava, Divesh ^d   Yu, Ting ^e  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

^d AT AND T LABS RESEARCH   (United States)

^e NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Approximate joins; Data integration; Joins; Tree edit distance; XML

Indexed keywords

APPROXIMATE JOINS; DATA INTEGRATION; JOINS; TREE EDIT DISTANCE;

ALGORITHMS; CORRELATION METHODS; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION DISSEMINATION; TREES (MATHEMATICS);

XML;

EID: 33745218927     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1132863.1132868     Document Type: Article

References (37)

1. AL-KHALIFA, S., JAGADISH, H. V., KOUDAS, N., PATEL, J. M., SRIVASTAVA, D., AND WU, Y. 2002. Structural joins: A primitive for efficient XML query pattern matching. Proceedings of ICDE.
2. APOSTOLICO, A. AND GALIL, Z. 1992. Pattern Matching Algorithms. Oxford University Press.
3. BECKMANN, N., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. Proceedings of ACM SIGMOD. 220-231.
4. BILLE, P. 2003. Tree Edit Distance, Alignment Distance and Inclusion. Tech. rep. TR-2003-23 IT, University of Copenhagen.
5. BRINKHOFF, T., KRIEGEL, H.-P., AND SEEGER, B. 1993. Efficient processing of spatial joins using R-trees. Proceedings of ACM SIGMOD. 237-246.
6. BRUNO, N., KOUDAS, N., AND SRIVASTAVA, D. 2002. Holistic twig joins: Optimal XML pattern matching. SIGMOD. 101-112.
7. CHAVEZ, E., NAVARRO, G., BAEZA-YATES, R., AND MARROQUIN, J. 2001. Searching in metric spaces. ACM Comput. Surv. 33, 3, 1-43.
8. CHAWATHE, S. AND MOLINA, H. 1997. Meaningful change detection in structured data. Proceedings of ACM SIGMOD. 26-37.
9. CHAWATHE, S., RAJARAMAN, A., MOLINA, H., AND WIDOM, J. 1996. Change detection in hierarchical structured information. Proceedings of ACM SIGMOD. 493-504.
10. CIACCIA, P., PATELLA, M., AND ZEZULA, P. 1997. M-tree: An Efficient access method for similarity search metric spaces. Proceedings of VLDB. 426-435.
11. COBENA, G., ABIDEBOUL, S., AND MARIAN, A. 2002. Detecting changes in XML documents. Proceedings of ICDE. 41-52.
12. FALOUTSOS, C. 1996. Indexing Multimedia Databases. Kluwer, Academic Publishing.
13. FALOUTSOS, C., RANGANATHAN, M., AND MANOLOPOULOS, I. 1994. Fast subsequence matching in time series databases. Proceedings of ACM SIGMOD. 419-429.
14. GAEDE, V. AND GUNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 170-231.
15. GARCIA, Y., LOPEZ, M., AND LEUTTENEGER, S. 1998. On optimal node splitting for R-trees. Proceedings of VLDB. 230-242.
16. GARHALDAS, H., FLORESCU, D., SHASHA, D., SIMON, E., AND SAITA, E. 2001. Declerative data cleaning. Proceedings of VLDB. 133-145.
17. GRAVANO, L., IPEIROTIS, P., JAGADISH, H., KOUDAS, N., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2001. Approximate strings joins in a database (almost) for free. Proceedings of VLDB. 144-156.
18. GREENE, D. 1989. An implementation and performance analysis of spatial data access methods. International Conference on Data Engineering. 606-615.
19. GRUST, T. 2002. Accelerating XPATH location steps. Proceedings of ACM SIGMOD. 109-120.
20. GUHA, S., JAGADISH, H. V., KOUDAS, N., SRIVASTAVA, D., AND YU, T. 2002. Approximate XML joins. Proceedings of ACM SIGMOD. 287-298.
21. GUHA, S., KOUDAS, N., SRIVASTAVA, D., AND YU, T. 2003. Index based approximate XML joins. International Conference on Data Engineering (ICDE). 303-306.
22. GUHA, S., RASTOGI, R., AND SHIM, K. 1998. CURE: An efficient clustering algorithm for large databases. Proceedings of ACM SIGMOD. 73-84.
23. GUNTHER, O. 1993. Efficient computation of spatial joins. Proceedings of the International Conference on Data Engineering, 50-59.
24. GUSFIELD, D. 1998. Algorithms on Strings, Trees and Sequences. Cambridge University Press.
25. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. Proceedings of ACM SIGMOD. 47-57.
26. HUANG, Y. W., JING, N., AND RUDENSTEINER, E. 1997. Spatial joins using R-trees: Breadth first search traversal with global optimizations. Proceedings of VLDB. 396-405.
27. KAMEL, I. AND FALOUTSOS, C. 1994. Hilbert R-tree: An Improved R-tree using fractals. Proceedings of VLDB. 500-510.
28. KOUDAS, N. AND SEVCIK, K. C. 1998. High dimensional similarity joins: Algorithms and performance evaluation. International Conference on Data Engineering. 466-475.
29. LEVENSHTEIN, V. 1966. Binary codes capable of correcting insertions, deletions and reversals. Cybernetics and Control Theory. 707-710.
30. MARIAN, A., ABIDEBOUL, S., COBENA, G., AND MIGNET, L. 2001. Change centric management of versions in an XML warehouse. Proceedings of VLDB. 581-590.
31. NAVARRO, G. 2001. A guided tour to approximate strings matching. ACM Comput. Surv., 1-20.
32. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry. Springer-Verlag, Berlin, Germany.
33. SANKOFF, D. AND KRUSKAL, J. 1983. Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA.
34. SARAWAGI, S. 2000. Special issue on data cleaning. IEEE Data Engin. Bull. 23, 4.
35. SHIM, K., SRIKANT, R., AND AGRAWAL, R. 1997. High-dimensional similarity joins. Proceedings of the International Conference on Data Engineering. 301-311.
36. ZHANG, K. AND SHASHA, D. 1997. Tree pattern matching. In Pattern Matching Algorithms, Apostolico and Galil, Eds. Oxford Univesity Press.
37. ZHANG, T., RAMAKRISHNAN, R., AND LIVNY, M. 1996. BIRCH: An efficient data clustering method for very large databases. Proceedings of ACM SIGMOD. 103-114.