The pq-gram distance between ordered labeled trees

ACM Transactions on Database Systems

Volumn 35, Issue 1, 2010, Pages

  Augsten, Nikolaus ^a   Böhlen, Michael ^a   Gamper, Johann ^a  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

Author keywords

Approximate matching; Database algorithms; Distance metric; Hierarchical data; Similarity search; Tree edit distance; XML

Indexed keywords

APPROXIMATE MATCHING; DATA ITEMS; DATABASE ALGORITHM; DISTANCE METRICS; EXACT MATCH; FAN-OUT; HIERARCHICAL DATA; LOWER BOUNDS; ORDERED LABELED TREES; REAL WORLD DATA; REAL-WORLD OBJECTS; STRUCTURAL INFORMATION; TRIANGLE INEQUALITY; WEIGHTED TREE;

MARKUP LANGUAGES;

XML;

EID: 77249122728     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1670243.1670247     Document Type: Article

References (46)

1. AL-KHALIFA, S., JAGADISH,H.V., PATEL, J. M.,WU, Y.,KOUDAS,N., AND SRIVASTAVA,D. 2002. Structural joins: A primitive for efficient XML query pattern matching. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Science Press, 141-152.
2. AUGSTEN, N., BöHLEN, M., DYRESON, C., AND GAMPER, J. 2008. Approximate joins for data-centric XML. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Society, 814-823.
3. AUGSTEN, N., BöHLEN, M., AND GAMPER, J. 2004. Reducing the integration of public administration databases to approximate tree matching. In Proceedings of the 3rd International Conference on Electronic Government. R. Traunmüller Ed., Lecture Notes in Computer Science vol. 3183. Springer, 102-107.
4. AUGSTEN, N., BöHLEN, M., AND GAMPER, J. 2005. Approximate matching of hierarchical data using pq-grams. In Proceedings of the International Conference on Very Large Databases (VLDB). ACM Press, 301-312.
5. BRUNO, N., KOUDAS, N., AND SRIVASTAVA, D. 2002. Holistic twig joins: Optimal XML pattern matching. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM Press, 310-321.
6. CELKO, J. 1994. Trees, databases and SQL. Datab. Program. Des. 7, 10, 48-57.
7. CELKO, J. 2004. Trees and Hierarchies in SQL for Smarties. Morgan Kaufmann, San Francisco, CA.
8. CHAWATHE, S. S.,RAJARAMAN, A., GARCIA-MOLINA, H., ANDWIDOM, J. 1996. Change detection in hierarchically structured information. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM Press, 493-504.
9. CHEN, W. 2001. New algorithm for ordered tree-to-tree correction problem. J. Algor. 40, 2, 135-158.
10. COB́ENA, G., ABITEBOUL, S., AND MARIAN, A. 2002. Detecting changes in XML documents. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Science Press, 41-52.
11. DALAMAGAS, T., CHENG, T., WINKEL, K.-J., AND SELLIS, T. 2006. A methodology for clustering XML documents by structure. Inform. Syst. 31, 3, 187-228.
12. DEHAAN, D., TOMAN, D., CONSENS, M. P., AND öZSU, M. T. 2003. A comprehensive XQuery to SQL translation using dynamic interval encoding. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 623-634.
13. DEMAINE, E. D., MOZES, S., ROSSMAN, B., AND WEIMANN, O. 2007. An optimal decomposition algorithm for tree edit distance. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07). Lecture Notes in Computer Science, vol.4596. Springer, 146-157.
14. FLESCA, S., MANCO, G., MASCIARI, E., PONTIERI, L., AND PUGLIESE, A. 2005. Fast detection of XML structural similarity. IEEE Trans. Knowl. Data Engin. 17, 2, 160-175.
15. GAROFALAKIS, M. AND KUMAR, A. 2005. XML stream processing using tree-edit distance embeddings. ACM Trans. Datab. Syst. 30, 1, 279-332.
16. GRAVANO, L., IPEIROTIS, P.G., JAGADISH,H. V.,KOUDAS,N.,MUTHUKRISHNAN, S., AND SRIVASTAVA,D. 2001. Approximate string joins in a database (almost) for free. In Proceedings of the International Conference on Very Large Databases (VLDB). Morgan Kaufmann, 491-500.
17. GRUST, T. 2002. Accelerating XPath location steps. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 109-120.
18. GUHA, S., JAGADISH, H. V.,KOUDAS, N., SRIVASTAVA, D., AND YU, T. 2002. Approximate XML joins. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM Press, 287-298.
19. HELMER, S. 2007. Measuring the structural similarity of semistructured documents using entropy. In Proceedings of the International Conference on Very Large Databases (VLDB). ACM Press, 1022-1032.
20. JIANG, H.,WANG,W., LU, H., AND YU, J. X. 2003. Holistic twig joins on indexed XML documents. In Proceedings of the International Conference on Very Large Databases (VLDB).Morgan Kaufmann, 273-284.
21. JIANG, T., WANG, L., AND ZHANG, K. 1995. Alignment of trees-An alternative to tree edit. Theor. Comput. Sci. 143, 1, 137-148.
22. KLEIN, P. N. 1998. Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th European Symposium on Algorithms. Lecture Notes in Computer Science, vol.1461. Springer, 91-102.
23. LEE, K.-H., CHOY, Y.-C., AND CHO, S.-B. 2004. An efficient algorithm to compute differences between structured documents. IEEE Trans. Knowl. Data Engin. 16, 8, 965-979.
24. NAVARRO, G. 2001. A guided tour to approximate string matching. ACM Comput. Surv. 33, 1, 31-88. (Pubitemid 33768480)
25. NIERMAN, A. AND JAGADISH, H. V. 2002. Evaluating structural similarity in XML documents. In Proceedings of the 5th International Workshop on the Web and Databases (WebDB).
26. OHKURA, N., HIRATA, K., KUBOYAMA, T., AND HARAO, M. 2005. The q-gram distance for ordered unlabeled trees. In Proceedings of the International Conference on Discovery Science (DS). A. G.
27. Hoffmann, H. Motoda, and T. Scheffer Eds., Lecture Notes in Computer Science, vol.3735. Springer, 189-202.
28. O'NEIL, P., O'NEIL, E., PAL, S., CSERI, I., SCHALLER, G., ANDWESTBURY, N. 2004. ORDPATHs: Insert-Friendly XML node labels. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 903-908.
29. POLYZOTIS, N., GAROFALAKIS, M., AND IOANNIDIS, Y. 2004. Approximate XML query answers. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM Press, 263-274.
30. PUHLMANN, S., WEIS, M., AND NAUMANN, F. 2006. XML duplicate detection using sorted neighborhoods. In Proceedings of the International Conference on Extending Database Technology (EDBT). Lecture Notes in Computer Science, vol.3896. Springer, 773-791.
31. RIBEIRO, L. AND HÄRDER, T. 2008. Evaluating performance and quality of XML-based similarity joins. In Proceedings of the Conference on Advances in Databases and Information Systems (ADBIS). Lecture Notes in Computer Science, vol.5207. Springer, 246-261.
32. SANZ, I.,MESITI, M., GUERRINI, G., AND BERLANGA, R. 2008. Fragment-Based approximate retrieval in highly heterogeneous XML collections. Data Knowl. Engin. 64, 1, 266-293.
33. SELKOW, S. M. 1977. The tree-to-tree editing problem. Inform. Process. Lett. 6, 6, 184-186.
34. TAI, K.-C. 1979. The tree-to-tree correction problem. J. ACM 26, 3, 422-433.
35. TATARINOV, I., VIGLAS, S., BEYER, K. S., SHANMUGASUNDARAM, J., SHEKITA, E. J., AND ZHANG, C. 2002. Storing and querying ordered XML using a relational database system. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 204-215.
36. UKKONEN, E. 1992. Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci. 92, 1, 191-211.
37. VALIENTE, G. 2001. An efficient bottom-up distance between trees. In Proceedings of the 8th Symposium on String Processing and Information Retrieval. IEEE Computer Science Press, 212-219.
38. VAN RIJSBERGEN, C. J. 1979. Information Retrieval, 2nd Ed. Butterworth-Heinemann, UK.
39. WEIS, M. AND NAUMANN, F. 2005. DogmatiX tracks down duplicates in XML. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 431-442.
40. YANG, R., KALNIS, P., AND TUNG, A. K. H. 2005. Similarity evaluation on tree-structured data. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM Press, 754-765.
41. YANG,W. 1991. Identifying syntactic differences between two programs. Softw. Pract. Exper. 21, 7, 739-755.
42. YIANILOS, P. N. 1991,2002. Normalized forms for two common metrics. Tech. rep., NEC Research Institute.
43. ZEZULA, P., AMATO, G., DOHNAL, V., AND BATKO, M. 2006. Similarity Search-The Metric Space Approach. Advances in Database Systems, vol.32. Springer.
44. ZHANG, C.,NAUGHTON, J. F., DEWITT, D. J., LUO, Q., AND LOHMAN, G.M. 2001. On supporting containment queries in relational database management systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 425-436.
45. ZHANG, K. 1995. Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recogn. 28, 3, 463-474.
46. ZHANG, K. AND SHASHA, D. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 6, 1245-1262.