TASM: Top-k approximate subtree matching

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 353-364

  Augsten, Nikolaus ^a   Barbosa, Denilson ^b   Böhlen, Michael ^a   Palpanas, Themis ^c  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF ALBERTA   (Canada)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BEST MATCH; BEST-KNOWN ALGORITHMS; CANONICAL TREE; CORE PROBLEMS; DOCUMENT TREES; EXPERIMENTAL EVALUATION; QUERY TREE; RUNTIMES; SIMILARITY MEASURE; SPACE COMPLEXITY; SUB TREE MATCHING; SUBTREES; TREE EDIT DISTANCE; UPPER BOUND; XML TREES;

ALGORITHMS; MARKUP LANGUAGES;

XML;

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

References (25)

1. S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu, "Approximate XML joins," in SIGMOD, 2002, pp. 287-298.
2. S. Melnik, H. Garcia-Molina, and E. Rahm, "Similarity flooding: A versatile graph matching algorithm and its application to schema matching," in ICDE, 2002, pp. 117-128.
3. N. Augsten, M. H. Böhlen, C. E. Dyreson, and J. Gamper, "Approximate joins for data-centric XML," in ICDE, 2008, pp. 814-823.
4. E. Rahm and P. A. Bernstein, "A survey of approaches to automatic schema matching." VLDB J., vol. 10, no. 4, pp. 334-350, 2001.
5. M. Weis and F. Naumann, "Dogmatix tracks down duplicates in XML," in SIGMOD, 2005, pp. 431-442.
6. N. Agarwal, M. G. Oliveras, and Y. Chen, "Approximate structural matching over ordered XML documents," in IDEAS, 2007, pp. 54-62.
7. L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram, "XRANK: Ranked keyword search over XML documents," in SIGMOD, 2003.
8. K.-C. Tai, "The tree-to-tree correction problem," J. of the ACM (JACM), vol. 26, no. 3, pp. 422-433, 1979.
9. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM J. on Computing, vol. 18, no. 6, pp. 1245-1262, 1989.
10. I. F. Ilyas, G. Beskales, and M. A. Soliman, "A survey of top-k query processing techniques in relational database systems," ACM Computing Surveys, vol. 40, no. 4, 2008.
11. S. Amer-Yahia, N. Koudas, A. Marian, D. Srivastava, and D. Toman, "Structure and content scoring for XML," in VLDB, 2005, pp. 361-372.
12. A. Marian, S. Amer-Yahia, N. Koudas, and D. Srivastava, "Adaptive processing of top-k queries in XML," in ICDE, 2005, pp. 162-173.
13. M. Theobald, H. Bast, D. Majumdar, R. Schenkel, and G. Weikum, "TopX: Efficient and versatile top-k query processing for semistructured data," VLDB J., vol. 17, no. 1, pp. 81-115, 2008.
14. E. D. Demaine, S. Mozes, B. Rossman, and O. Weimann, "An optimal decomposition algorithm for tree edit distance," in ICALP, ser. LNCS, vol. 4596. Springer, 2007, pp. 146-157.
15. M. S. Ali, M. P. Consens, X. Gu, Y. Kanza, F. Rizzolo, and R. K. Stasiu, "Efficient, effective and flexible XML retrieval using summaries," in INEX, 2006, pp. 89-103.
16. Z. Liu and Y. Chen, "Identifying meaningful return information for XML keyword search," in SIGMOD, 2007, pp. 329-340.
17. R. Kaushik, R. Krishnamurthy, J. F. Naughton, and R. Ramakrishnan, "On the integration of structure indexes and inverted lists," in SIGMOD, 2004, pp. 779-790.
18. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," J. of Computer and System Sciences, vol. 66, no. 4, pp. 614-656, 2003.
19. D. Barbosa, L. Mignet, and P. Veltri, "Studying the XML Web: Gathering statistics from an XML sample," World Wide Web J., vol. 8, no. 4, pp. 413-438, 2005.
20. R. Yang, P. Kalnis, and A. K. H. Tung, "Similarity evaluation on tree-structured data," in SIGMOD, 2005, pp. 754-765.
21. N. Augsten, M. Böhlen, and J. Gamper, "The pq-gram distance between ordered labeled trees," ACM Trans. Database Systems (TODS), to appear.
22. J. R. Ullmann, "An algorithm for subgraph isomorphism," J. of the ACM (JACM), vol. 23, no. 1, pp. 31-42, 1976.
23. Y. Tian and J. M. Patel, "TALE: A tool for approximate large graph matching," in ICDE, 2008, pp. 963-972.
24. I. Tatarinov, S. D. Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, and C. Zhang, "Storing and querying ordered XML using a relational database system," in SIGMOD, 2002, pp. 204-215.
25. A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse, "XMark: A benchmark for XML data management," in VLDB, 2002, pp. 974-985.