Learning schema mappings

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 182-195

  Ten Cate, Balder ^a   Dalmau, Víctor ^b   Kolaitis, Phokion G ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Computational learning theory; Data exchange; Schema mappings

Indexed keywords

ALGORITHMIC METHODS; COMPUTATIONAL LEARNING THEORY; DATA EXAMPLES; EQUIVALENCE QUERIES; EXACT LEARNING; HIGH LEVEL SPECIFICATION; LEARNABILITY; LEARNING MODELS; LEARNING THEORY; MEMBERSHIP QUERY; SCHEMA MAPPINGS; UNARY RELATIONS;

ALGORITHMS; ELECTRONIC DATA INTERCHANGE;

DATABASE SYSTEMS;

EID: 84863911135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2274576.2274596     Document Type: Conference Paper

References (43)

1. M. Alekhnovich, M. Braverman, V. Feldman, A. R. Klivans, and T. Pitassi. The complexity of properly learning simple concept classes. J. Comput. Syst. Sci., 74(1):16-34, 2008.
2. B. Alexe, L. Chiticariu, R. J. Miller, and W. C. Tan. Muse: Mapping Understanding and deSign by Example. In ICDE, pages 10-19, 2008.
3. B. Alexe, P. G. Kolaitis, and W. C. Tan. Characterizing schema mappings via data examples. In PODS, pages 261-272, 2010.
4. B. Alexe, B. ten Cate, P. G. Kolaitis, and W. C. Tan. Designing and refining schema mappings via data examples. In SIGMOD, pages 133-144, 2011.
5. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1987.
6. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
7. D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of horn clauses. Mach. Learn., 9:147-164, July 1992.
8. D. Angluin and M. Kharitonov. When won't membership queries help? J. Comput. Syst. Sci., 50(2):336-355, 1995.
9. M. Anthony and N. Biggs. An Introduction to Computational Learning Theory. Cambridge University Press, 1992.
10. P. Barceló. Logical foundations of relational data exchange. SIGMOD Record, 38(1):49-58, 2009.
11. P. A. Bernstein, T. J. Green, S. Melnik, and A. Nash. Implementing Mapping Composition. VLDB Journal, 17(2):333-353, 2008.
12. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's Razor. Inf. Process. Lett., 24(6):377-380, 1987.
13. A. Bonifati, E. Q. Chang, T. Ho, V. S. Lakshmanan, and R. Pottinger. HePToX: Marrying XML and Heterogeneity in Your P2P Databases. In VLDB, pages 1267-1270, 2005.
14. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90, 1977.
15. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. Theor. Comput. Sci., 239:211-229, May 2000.
16. W. W. Cohen. PAC-learning non-recursive prolog clauses. Artif. Intell., 79(1):1-38, 1995.
17. W. W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. J. Artif. Intell. Res. (JAIR), 2:501-539, 1995.
18. W. W. Cohen. PAC-learning recursive logic programs: Negative results. J. Artif. Intell. Res. (JAIR), 2:541-573, 1995.
19. A. Das Sarma, A. G. Parameswaran, H. Garcia-Molina, and J. Widom. Synthesizing view definitions from data. In ICDT, pages 89-103, 2010.
20. A. Doan. Learning to Map between Structured Representations of Data. PhD thesis, Computer Science and Engineering, University of Washington, University of Pennsylvania, 2002.
21. A. Doan, J. Madhavan, P. Domingos, and A. Y. Halevy. Learning to map between ontologies on the semantic web. In WWW, pages 662-673, 2002.
22. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. Theoretical Computer Science (TCS), 336(1):89-124, 2005.
23. W. Fan, F. Geerts, L. V. S. Lakshmanan, and M. Xiong. Discovering conditional functional dependencies. In ICDE, pages 1231-1234, 2009.
24. V. Feldman. Hardness of approximate two-level logic minimization and PAC learning with membership queries. J. Comput. Syst. Sci., 75(1):13-26, 2009.
25. P. A. Flach and I. Savnik. Database dependency discovery: A machine learning approach. AI Commun., 12(3):139-160, 1999.
26. G. H. L. Fletcher, M. Gyssens, J. Paredaens, and D. V. Gucht. On the expressive power of the relational algebra on finite sets of relation pairs. IEEE Trans. Knowl. Data Eng., 21(6):939-942, 2009.
27. G. Gottlob and P. Senellart. Schema mapping discovery from data instances. J. ACM, 57(2), 2010.
28. W. Gutjahr, E. Welzl, and G. Woeginger. Polynomial graph-colorings. Discrete Appl. Math., 35:29-46, 1992.
29. L. M. Haas, M. A. Hernández, H. Ho, L. Popa, and M. Roth. Clio Grows Up: From Research Prototype to Industrial Tool. In SIGMOD, pages 805-810, 2005.
30. D. Haussler. Learning conjunctive concepts in structural domains. Mach. Learn., 4:7-40, 1989.
31. L. Hellerstein, K. Pillaipakkamnatt, V. V. Raghavan, and D. Wilkins. How many queries are needed to learn? J. ACM, 43(5):840-862, 1996.
32. K. Hirata. On the hardness of learning acyclic conjunctive queries. In ALT, pages 238-251, 2000.
33. M. J. Kearns and L. G. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. J. ACM, 41(1):67-95, 1994.
34. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press, 1997.
35. P. G. Kolaitis. Schema Mappings, Data Exchange, and Metadata Management. In ACM Symposium on Principles of Database Systems (PODS), pages 61-75, 2005.
36. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., pages 302-332, 2000.
37. M. Lenzerini. Data Integration: A Theoretical Perspective. In ACM Symposium on Principles of Database Systems (PODS), pages 233-246, 2002.
38. E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB J., 10(4):334-350, 2001.
39. R. E. Schapire. The strength of weak learnability. Machine Learning, 5:197-227, 1990.
40. B. ten Cate, P. G. Kolaitis, and W. C. Tan. Database constraints and homomorphism dualities. In CP, 2010.
41. L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
42. L. G. Valiant. Learning disjunctions of conjunctions. In IJCAI, pages 560-566, 1985.
43. L. Yan, R. J. Miller, L. M. Haas, and R. Fagin. Data-Driven Understanding and Refinement of Schema Mappings. In SIGMOD, pages 485-496, 2001.