Data Exchange: Getting to the Core

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

Volumn 22, Issue , 2003, Pages 90-101

  Fagin, Ronald ^a   Kolaitis, Phokion G ^b   Popa, Lucian ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA EXCHANGE; QUERY PROCESSING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA PROCESSING; DECISION MAKING; GRAPH THEORY; POLYNOMIALS; QUERY LANGUAGES;

DATA STRUCTURES;

EID: 1142287596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S. Abiteboul and O. M. Duschka. Complexity of Answering Queries Using Materialized Views. In PODS, pages 254-263, 1998.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. C. Beeri and M. Y. Vardi. A Proof Procedure for Data Dependencies. Journal of the ACM, 31(4):718-741, 1984.
4. A. K. Chandra and P. M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In STOC, pages 77-90, 1977.
5. S. Cosmadakis. The Complexity of Evaluating Relational Queries. Information and Control, 58:101-112, 1983.
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, L. Popa, and V. Tannen. Physical Data Independence, Constraints and Optimization with Universal Plans. In VLDB, pages 459-470, 1999.
8. A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In ICDT, pages 225-241, 2003.
9. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. In ICDT, pages 207-224, 2003.
10. M. Friedman, A. Y. Levy, and T. D. Millstein. Navigational Plans For Data Integration. In AAAI, pages 67-73, 1999.
11. A. Halevy. Answering Queries Using Views: A Survey. VLDB Journal, pages 270-294, 2001.
12. P. Hell and J. Nešetřil. The Core of a Graph. Discrete Mathematics, 109:117-126, 1992.
13. P. C. Kanellakis. Elements of Relational Database Theory. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 1073-1156. Elsevier and MIT Press, 1990.
14. M. Lenzerini. Data Integration: A Theoretical Perspective. In PODS, pages 233-246, 2002.
15. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS, 4(4):455-469, Dec. 1979.
16. R. J. Miller, L. M. Haas, and M. Hernández. Schema Mapping as Query Discovery. In VLDB, pages 77-88, 2000.
17. C. Papadimitriou and M. Yannakakis. The Complexity of Facets and Some Facets of Complexity. In STOC, pages 229-234, 1982.
18. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
19. L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernandez, and R. Fagin. Translating Web Data. In VLDB, pages 598-609, 2002.
20. N. C. Shu, B. C. Housel, R. W. Taylor, S. P. Ghosh, and V. Y. Lum. EXPRESS: A Data Extraction, Processing, amd REStructuring System. ACM TODS, 2(2):134-174, 1977.
21. R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In Logics for Databases and Information Systems, pages 307-356. Kluwer, 1998.