Approximate joins for data-centric XML

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 814-823

  Augsten, Nikolaus ^a   Bohlen, Michael ^a   Dyreson, Curtis ^b   Gamper, Johann ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b Utah State University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT; INTEGRATION; MARKUP LANGUAGES; TECHNOLOGY; XML;

DATA ENGINEERING; DATA INTEGRATION APPLICATIONS; DATA SOURCING; DATA-CENTRIC; DUMMY NODES; INTERNATIONAL CONFERENCES; JOIN ALGORITHMS; REAL-WORLD DATA; THREE-STEP PROCESS; TREE EDIT DISTANCES; TREE MATCHING; UNORDERED TREES; XML DATA;

TREES (MATHEMATICS);

EID: 52649127789     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497490     Document Type: Conference Paper

References (24)

1. G. Cobéna, S. Abiteboul, and A. Marian, "Detecting changes in XML documents," in Proceedings of the International Conference on Data Engineering (ICDE). San Jose, California: IEEE Computer Science Press, 2002, pp. 41-52.
2. S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu, "Approximate XML joins," in Proceedings of the ACM SIGMOD International Conference on Management of Data. Madison, Wisconsin: ACM Press, 2002, pp. 287-298.
3. K.-H. Lee, Y.-C. Choy, and S.-B. Cho, "An efflcient algorithm to compute differences between structured documents," IEEE Transactions on Knowledge and Data Engineering (TKDE), vol. 16, no. 8, pp. 965-979, Aug. 2004.
4. K. Zhang, R. Statman, and D. Shasha, "On the editing distance between unordered labeled trees," Information Processing Letters, vol. 42, no. 3, pp. 133-139, 1992.
5. K.-C. Tai, "The tree-to-tree correction problem," Journal of the ACM (JACM), vol. 26, no. 3, pp. 422-433, July 1979.
6. W. Chen, "New algorithm for ordered tree-to-tree correction problem," Journal of Algorithms, vol. 40, no. 2, pp. 135-158, Aug. 2001.
7. E. D. Demaine, S. Mozes, B. Rossman, and O. Weimann, "An optimal decomposition algorithm for tree edit distance," in Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland, 2007.
8. P. N. Klein, "Computing the edit-distance between unrooted ordered trees," in Proceedings of the 6th European Symposium on Algorithms, ser. Lecture Notes in Computer Science, vol. 1461. Venice, Italy: Springer, 1998, pp. 91-102.
9. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM Journal on Computing, vol. 18, no. 6, pp. 1245-1262, 1989.
10. M. Garofalakis and A. Kumar, "XML stream processing using tree-edit distance embeddings," ACM Transactions on Database Systems, vol. 30, no. 1, pp. 279-332, 2005.
11. N. Augsten, M. Böhlen, and J. Gamper, "Approximate matching of hierarchical data using pq-grams," in Proceedings of the International Conference on Very Large Databases (VLDB). Trondheim, Norway: Morgan Kaufmann Publishers Inc., Sept. 2005, pp. 301-312.
12. S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom, "Change detection in hierarchically structured information," in Proceedings of the ACM SIGMOD International Conference on Management of Data. Montreal, Canada: ACM Press, June 1996, pp. 493-504.
13. S. S. Chawathe and H. Garcia-Molina, "Meaningful change detection in structured data," in Proceedings of the ACM SIGMOD International Conference on Management of Data. Tucson, Arizona, United States: ACM Press, May 1997, pp. 26-37.
14. Y. Wang, D. J. DeWitt, and J. Cai, "X-Diff: An effective change detection algorithm for XML documents." in Proceedings of the International Conference on Data Engineering (ICDE). Bangalore, India: IEEE Computer Science Press, Mar. 2003, pp. 519-530.
15. M. Weis and F. Naumann, "DogmatiX tracks down duplicates in XML," in Proceedings of the ACM SIGMOD International Conference on Management of Data. Baltimore, Maryland, USA: ACM Press, June 2005, pp. 431-442.
16. S. Puhlmann, M. Weis, and F. Naumann, "XML duplicate detection using sorted neighborhoods," in Proceedings of the International Conference on Extending Database Technology (EDBT), ser. Lecture Notes in Computer Science, vol. 3896. Munich, Germany: Springer, Mar. 2006.
17. I. Sanz, M. Mesiti, G. Guerrini, and R. Berlanga, "Fragment-based approximate retrieval in highly heterogeneous XML collections," Data & Knowledge Engineering, vol. 64, no. 1, pp. 266-293, Jan. 2008.
18. N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: Optimal XML pattern matching," in Proceedings of the ACM SIGMOD International Conference on Management of Data. Madison, Wisconsin: ACM Press, June 2002, pp. 310-321.
19. H. Jiang, W. Wang, H. Lu, and J. X. Yu, "Holistic twig joins on indexed XML documents," in Proceedings of the International Conference on Very Large Databases (VLDB). Berlin, Germany: Morgan Kaufmann Publishers Inc., Sept. 2003, pp. 273-284.
20. T. Dalamagas, T. Cheng, K.-J. Winkel, and T. Sellis, "A methodology for clustering XML documents by structure," Information Systems, vol. 31, no. 3, pp. 187-228, May 2006.
21. S. Flesca, G. Manco, E. Masciari, L. Pontieri, and A. Pugliese, "Fast detection of XML structural similarity," IEEE Transactions on Knowledge and Data Engineering (TKDE), vol. 17, no. 2, pp. 160-175, Feb. 2005.
22. A. Nierman and H. V. Jagadish, "Evaluating structural similarity in XML documents," in Proceedings of the Fifth International Workshop on the Web and Databases (WebDB 2002), Madison, Wisconsin, USA, June 2002.
23. C. J. van Rijsbergen, Information Retrieval, 2nd ed. Butterworth-Heinemann, Mar. 1979, ch. 3.
24. R. M. Karp and M. O. Rabin, "Efficient randomized pattern-matching algorithms," IBM Journal of Research and Development, vol. 31, no. 2, pp. 249-260, Mar. 1987.