The complexity of data exchange

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

Volumn , Issue , 2006, Pages 30-39

  Kolaitis, Phokion G ^a,b   Panttaja, Jonathan ^b   Tan, Wang Chiew ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Complexity; Data exchange; Database dependencies; Schema mappings; Undecidability

Indexed keywords

DATA COMPLEXITY; POLYNOMIAL TIME; SCHEMA MAPPING; UNIVERSAL ALGEBRA;

ALGORITHMS; DATA STRUCTURES; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEMATIC DIAGRAMS;

ELECTRONIC DATA INTERCHANGE;

EID: 33947312337     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142357     Document Type: Conference Paper

References (27)

1. M. Arenas and L. Libkin. XML Data Exchange: Consistency and Query Answering. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 13-24, 2005.
2. C. Beeri and M. Y. Vardi. The Implication Problem for Data Dependencies. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), pages 73-85, 1981.
3. C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. Journal of the Association for Computing Machinery (JACM), 31(4):718-741, 1984.
4. P. A. Bernstein. Applying Model Management to Classical Meta Data Problems. In Proceedings of the Conference on Innovative Data Systems Research (CIDR), pages 209-220, 2003.
5. A. Cali, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data integration under integrity constraints. Information Systems, 29:147-163, 2004.
6. S. S. Cosmadakis and P. C. Kanellakis. Functional and Inclusion Dependencies: A Graph Theoretic Approach. In Advances in Computing Research, volume 3, pages 163-184. JAI Press, 1986.
7. A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In International Conference on Database Theory (ICDT), pages 225-241, 2003.
8. T. Evans. The word problem for abstract algebras. Journal of the London Mathematical Society, 26:64-71, 1951.
9. T. Evans. Embeddability and the word problem. Journal of the London Mathematical Society, 28:76-80, 1953.
10. T. Evans. Word Problems. Bulletin of the American Mathematical Society, 84(5):789-802, 1978.
11. R. Fagin. Horn clauses and database dependencies. Journal of the Association for Computing Machinery (JACM), 29(4):952-985, 1982.
12. 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.
13. R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. ACM Transactions on Database Systems (TODS), 30(1): 174-210, 2005.
14. R. Fagin, P. G. Kolaitis, L. Popa, and W. Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 83-94, 2004.
15. G. Gottlob. Computing cores for data exchange: Hard cases and practical solutions. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 148-159, 2005.
16. G. Gottlob and C. Papadimitriou. On the complexity of single-rule datalog queries. Information and Computation, 183(1):104-122, 2003.
17. G. Grätzer. Universal Algebra, Second Edition. Springer-Verlag, 1979.
18. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
19. Y. Gurevich. The word problem for certain classes of semigroups. Algebra and Logic, 5:25-35, 1966.
20. Y. Gurevich and H. R. Lewis. The Inference Problem for Template Dependencies. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 221-229, 1982.
21. Y. Gurevich and H. R. Lewis. The word problem for cancellation semigroups with zero. Journal of Symbolic Logic, 49(1): 184-191, 1984.
22. M. Lenzerini. Data Integration: A Theoretical Perspective. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 233-246, 2002.
23. A. Nash, P. Bernstein, and S. Melnik. Composition of Mappings Given by Embedded Dependencies. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pages 172-183, 2005.
24. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
25. L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernández, and R. Fagin. Translating Web Data. In Proceedings of the International Conference on Very Large Data Bases (VLDB), pages 598-609, 2002.
26. E. L. Post. Recursive Unsolvability of a Problem of Thue. Journal of Symbolic Logic, 12(1): 1-11, 1947.
27. M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 137-146, 1982.