Computing cores for data exchange: New algorithms and practical solutions

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 148-159

  Gottlob, Georg ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DATA EXCHANGE; TARGET CONSTRAINTS;

ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES;

DATA TRANSFER;

EID: 33244472162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065187     Document Type: Conference Paper

References (40)

1. S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases, Addison-Wesley Publishing Company, 1995.
2. A. Aho, J. Hopcroft, and J. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading MA, 1983.
3. A. Aho, J. Sagiv, and J. Ullman. Equivalence of Relational Expressions, SIAM J. Comput. 8:2, 1979.
4. A. Aho, J. Sagiv, and J. Ullman. Efficient Optimisation of a Class of Relational Expressions, TODS 4:4, 1979.
5. M. Arenas, P. Barceló, R. Fagin, and L. Libkin, Locally Consistent Transformations and Query Answering in Data Exchange, Proc. ACM PODS 2004, pp. 229-240.
6. P. Atzeni and E.P.F. Chan. Independent Database Schemes under Functional and Inclusion Dependencies. Acta Informatica 28:8, pp. 777-779, 1991.
7. C. Beeri and M. Vardi. A Proof Procedure for Data Dependencies. J. ACM. 31:4, PP. 718-741, 1984.
8. M.A. Casanova, R. Fagin, and C.H. Papadimitriou. Inclusion Dependencies and Their Interaction with Functional Dependencies. JCSS 28:1, 1984.
9. A.K. Chandra and P.M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Databases. STOC 1977.
10. C. Chekuri and A. Rajaraman. Conjunctive Query Containment Revisited. TCS 239:2, 2000.
11. R.G. Downey and M.R. Follows. Parameterized Complexity. Springer, 1999.
12. R.G. Downey and M.R. Fellows and U.Tailor. The parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. In D.S. Bridges et al., editors, Combinatorics, Complexity, and Logic - Proc. DMTCS'96.
13. R. Fagin, Ph. Kolaitis, R. Miller, and L. Popa, Data Exchange: Semantics and Query Answering, ICDT'03, pp. 207-224. Full version to appear in TCS.
14. R. Fagin, Ph. Kolaitis, and L. Popa, Data Exchange: Getting to the Core. In Proc. PODS'03, pp. 90-101, 2003. Full version to appear in ACM TODS.
15. J. Flum, M. Frick, and M. Grohe. Query Evaluation via Tree-Decompositions, J. ACM 49:6, 2002.
16. G. Gottlob. Computing Cores for Data Exchange: New Algorithms and Practical Solutions. Extended version of the present paper. Currently available at: www.dbai.tuwien.ac.at/staff/gottlob/extcore.pdf
17. G. Gottlob and A. Leitsch. On the efficiency of Subsumption Algorithms. J. ACM 32:2, 1985.
18. G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable queries. Journal of Computer and System Sciences 64:3, pp. 579-627, 2002.
19. G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries. J.ACM 48:3, pp. 431-498, 2001.
20. G. Gottlob, N. Leone, and F. Scarcello. Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. Journal of Computer and System Sciences 66(4): 775-808, 2003.
21. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124:2, pp. 243-282, 2000.
22. G. Gottlob, R. Pichler. Hypergraphs in Model Checking: Acyclicity in Hypertree-Width versus Clique-Width. SIAM J. Comput., 33:2, 2004.
23. C. Gutiérrez, C. Hurtado, and A. Mendelzon. Foundations of Semantic Web Databases. ACM PODS 2004, pp. 95-106, 2004.
24. M. Grohe. Parameterized Complexity for the Database Theorist. ACM SIGMOD Record, 31:4, December 2002, pp.86-96, 2002.
25. T. Imielinski. Abstraction in Query Processing, Journal of the ACM 38:3, pp. 534-558, 1991.
26. Ph. Kolaitis, Data Exchange: Schema Mappings, Data Exchange, and Metadata Management.PODS'05.
27. Ph.G. Kolaitis, M.Y. Vardi, Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences 61:2, pp. 302-332, 2000.
28. M. Levene, G. Loizou, How to Prevent Interaction of Functional and Inclusion Dependencies, Information Processing Letters 71:3-4, pp.115-125, 1999.
29. M. Levene, G. Loizou, Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. TCS 254:1-2, 2001.
30. A.Y. Levy, A. O. Mendelzon, Y. Sagiv, D. Srivastava. Answering Queries Using Views. PODS 1995. pp.95-104, 1995.
31. H. Mannila and K.-J. Räihä. The Design of Relational Datases. Addison Wesley 1992.
32. D. Maier, A. Mendelzon, and Y. Sagiv. Testing Implication of Data Dependencies, ACM TODS4:4, pp. 455-469, 1979.
33. R. Miller, L. Haas, and M. Hernández. Schema Mapping as Query Discovery. VLDB 2000.
34. L. Popa, Y. Velegrakis, R. Miller, M. Hernández, and R. Fagin. Translating Web Data. VLDB 2002.
35. C.H. Papadimitriou and M. Yannakakis. On the Complexity of Database Queries. Journal of Computers and System Sciences, 58:407-427, 1999.
36. X. Qian. Query Folding. ICDE 1996.
37. N. Robertson and P.D. Seymour. Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7:309-322, 1986.
38. F. Scarcello, G. Greco, and N. Leone. Weighted Hypertree Decompositions and Optimal Query Plans. PODS 2004.
39. J.D. Ullman. Principles of Database and Knowledge Base Systems, Computer Science Press, Rockville, MD, vol. I, 1988, and vol. II, 1989.
40. M. Yannakakis. Algorithms for Acyclic Database Schemes. VLDB 1981, pp. 82-94.