Approximate structural matching over ordered XML documents

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn , Issue , 2007, Pages 54-62

  Agarwal, Nitin ^a   Oliveras, Magdiel Galan ^a   Chen, Yi ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE ENGINEERING; SUBSEQUENCE MATCHING; TREE PATTERNS; TREE STRUCTURES; XML DATA; XML DOCUMENTS; XML QUERYING;

DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION MANAGEMENT; KETONES; MARKUP LANGUAGES; TECHNOLOGY; XML;

TREES (MATHEMATICS);

EID: 47949092121     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2007.4318089     Document Type: Conference Paper

References (17)

1. N. Agarwal, M. Galan, and Y. Chen. Approximate Structural Matching over XML Documents. Technical report, Arizona State University, 2006.
2. S.A. Aghili, H. Li, D. Agrawal, and A. El Abbadi. TWIX: Twig Structure and Content Matching of Selective Queries using Binary Labeling. In Proceedings of INFOSCALE, 2006.
3. S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis. Automated Ranking of Database Query Results. In Proceedings of CIDR, 2003.
4. N. Augsten, M. Bohlen, and J. Gamper. Approximate matching of hierarchical data using pq-grams. In Proceedings of VLDB, 2005.
5. S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu. Approximate XML joins. In Proceedings of SIGMOD, pages 287-298, 2002.
6. S. Guha, R. Rastogi, and K. Shim. ROCK: A Robust Clustering Algorithm for Categorical Attributes. Information Systems, 25(5):345-366, 2000.
7. K. Kailing, H. P. Kriegel, S. Schfnauer, and T. Seidl. Efficient Similarity Search for Hierarchical Data in Large Databases. In Proceedings of EDBT, 2004.
8. A. Marian, S. A. Yahia, N. Koudas, and D. Srivastava. Adaptive Processing of Top-k Queries in XML. In Proceedings of ICDE, 2005.
9. U. Nambiar and S. Kambhampati. Answering Imprecise Queries over Autonomous Web Databases. In ICDE, 2006.
10. N. Polyzotis, M. Garofalakis, and Y. Ioannidis. Approximate XML Query Answers. In SIGMOD, 2004.
11. H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik and Physik, 27:142-144, 1918.
12. P. Rao and B. Moon. PRIX: Indexing and querying XML using Prfer sequences. In Proceedings of ICDE, 2004.
13. D. Shasha and K. Zhang. Approximate Tree Pattern Matching. In Pattern Matching Algorithms. Oxford University Press, 1997.
14. M. Theobald, R. Schenkel, and G. Weikum. An efficient and versatile query engine for TopX search. In Proceedings of VLDB, 2005.
15. S. A. Yahia, N. Koudas, A. Marian, D. Srivastava, and D. Toman. Structure and Content Scoring for XML. In Proceedings of VLDB, 2005.
16. S. A. Yahia, Laks V. S. Lakshmanan, and S. Pandit. FleXPath: Flexible Structure and Full-text Querying for XML. In Proceedings of SIGMOD, 2004.
17. R. Yang, P. Kalnis, and A. K. H. Tung. Similarity Evaluation on Tree-Structured Data. In SIGMOD, 2005.