A machine learning approach to rapid development of XML mapping queries

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 276-287

  Morishima, Atsuyuki ^a   Kitagawa, Hiroyuki ^a   Matsumoto, Akira ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA GROWTH; DATA MAPPING; MAPPING QUERIES; SEMISTRUCTURED DATA;

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; DATA REDUCTION; GRAPH THEORY; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES;

XML;

EID: 2442584438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1320004     Document Type: Conference Paper

References (21)

1. T. Amoth, P. Cull, P. Tadepalli. Exact Learning of Unordered Tree Patterns from Queries. Proc. Computational Learning Theory, pp. 323-332, 1999.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, 1987
3. D. Angluin. Computational Learning Theory: Survey and Selected Bibliography. Proc. 24th Annual ACM Symposium on Theory of Computing, pp. 351-369, 1992.
4. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with Data Values: Typechecking Revisited. Proc. PODS, pp. 138-149, 2001.
5. H. Arimura, H. Sakamoto, S. Arikawa. Efficient Learning of Semi-structured Data from Queries. Proc. Algorithmic Learning Theory, pp. 315-331, 2001.
6. A. Blum, S. Rudich. Fast Learning of k-Term DNF Formulas with Queries. Proc. ACM Symp. on Theory of Computing, pp. 382-389, 1992.
7. A. Doan, P. Domingos, A. Halevy. Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach. Proc. SIGMOD, pp. 509-520, 2001.
8. E.M. Gold. Complexity of Automaton Identification from Given Data. Information and Control, 37, pp.302-320, 1978.
9. H. Ishizaka. Learning simple deterministic languages. Proc. Computational Learning Theory, pp. 162-174, 1989.
10. R. Kosala, J. Van den Bussche, M. Bruynooghe and H. Blocked. Information Extraction in Structured Documents using Tree Automata Induction. Proc. Principles of Data Mining and Knowledge Discovery, 2002.
11. A. Morishima, S. Koizumi, H. Kitagawa and S. Takano. Enabling End-users to Construct Data-intensive Web-sites from XML Repositories: An Example-based Approach. Proc. VLDB, pp. 703-704, 2001.
12. A. Morishima, A. Matsumoto, H. Kitagawa. XLearner: A System to Learn XML Queries from Examples. Technical Report, University of Tsukuba.
13. Online Computer Library Center. Introduction to Dewey Decimal Classification. http://www.oclc.org/oclc/fp/about/about_the_ddc.htm
14. L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernandez, R. Fagin. Translating Web Data. VLDB 2002: 598-609
15. Yasubumi Sakakibara. Learning Context-Free Grammars from Structural Data in Polynomial Time. Theoretical Computer Science, 76(2-3), pp. 223-242, 1990.
16. A. Schmidt, F. Waas, M. Kersten, D. Florescu, M. Carey, I. Manolescu, R. Busse. Why And How To Benchmark XML Databases. SIGMOD Record 30(3): 27-32 (2001)
17. W3C. XQuery 1.0 and XPath 2.0 Data Model. http://www.w3.org/TR/query- datamodel/.
18. W3C. XML Query Use Cases. http://www.w3.org/TR/xmlquery-use-cases.
19. W3C. XML Path Language (XPath). http://www.w3.org/TR/xpath.
20. W3C. XQuery 1.0: An XML Query Language. http://www.w3.org/ TR/xquery/.
21. W3C. XML Query Requirements. http://www.w3.org/TR/xmlquery-req.