Phokion G. Kolaitis
ABSTRACT
Schema mappings are high-level specifications that describe the relationship between database schemas. Schema mappings are prominent in several different areas of database management, including database design, information integration, data exchange, metadata management, and peer-to-peer data management systems. Our main aim in this paper is to present an overview of recent advances in data exchange and metadata management, where the schema mappings are between relational schemas. In addition, we highlight some research issues and directions for future work.
- S. Abiteboul and O. M. Duschka. Complexity of Answering Queries Using Materialized Views. In ACM Symposium on Principles of Database Systems (PODS), pages 254--263, 1998. Google Scholar
Digital Library
- K. R. Apt. Logic programming. In J. van Leeuween, editor, Handbook of Theoretical Computer Science, volume B, pages 493--474. The MIT Press/Elsevier, 1990. Google ScholarDigital Library
- M. Arenas and L. Libkin. XML data exchange: Consistency and query answering. In ACM Symposium on Principles of Database Systems (PODS), 2005. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- C. Beeri and M. Y. Vardi. Formal Systems for Tuple and Equality Generating Dependencies. SIAM J. on Computing, 13(1):76--98, 1984.Google Scholar
- P. A. Bernstein. Applying Model Management to Classical Meta-Data Problems. In Conference on Innovative Data Systems Research (CIDR), pages 209--220, 2003.Google Scholar
- P. A. Bernstein. Generic Model Management: A Database Infrastructure for Schema Manipulation. Keynote Address, IDM 2003 Workshop, Seattle, Washington, September 2003. Google ScholarDigital Library
- A. K. Chandra and P. M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In ACM Symposium on Theory of Computing (STOC), pages 77--90, 1977. Google ScholarDigital Library
- E. F. Codd. Further normalization of the data base relational model. In R. Rustin, editor, Data Base Systems, pages 33--64. Prentice-Hall, 1972.Google Scholar
- 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.Google Scholar
- A. Dawar. A Restricted Second Order Logic for Finite Structures. Information and Computation, 143(2):154--174, 1998. Google ScholarDigital Library
- R. Fagin. Horn Clauses and Database Dependencies. Journal of the Association for Computing Machinery (JACM), 29(4):952--985, Oct. 1982. Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. In International Conference on Database Theory (ICDT), pages 207--224, 2003. Full version to appear in a Special Issue of Theoretical Computer Science with selected papers from ICDT 2003. Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. In ACM Symposium on Principles of Database Systems (PODS), pager, 90--101, 2003. Full version invited to ACM Transactions on Database Systems (TODS). Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue. In ACM Symposium on Principles of Database Systems (PODS), pages 83--94, 2004. Full version invited to ACM Transactions on Database Systems (TODS). Google ScholarDigital Library
- T. Feder and M. Y. Vardi. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. on Computing, 28:57--104, 1998. Preliminary version in Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 612--622. Google ScholarDigital Library
- A. Fuxman, P. G. Kolaitis, R. Miller, and W.-C. Tan. Peer Data Exchange. In ACM Symposium on Principles of Database Systems (PODS), 2005. Google ScholarDigital Library
- G. Gottlob. Computing Cores for Data Exchange: New Algorithms and Practical Solutions. In ACM Symposium on Principles of Database Systems (PODS), 2005. Google ScholarDigital Library
- L. Haas, M. Hernandez, H. Ho, L. Popa, and M. Roth. Clio grows up: from research prototype to industrial tool. In ACM SIGMOD International Conference on Management of Data (SIGMOD), 2005. Google ScholarDigital Library
- P. Hell and J. Nešetřil. The Core of a Graph. Discrete Mathematics, 109:117--126, 1992. Google ScholarDigital Library
- P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford University Press, 2004.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- M. Lenzerini. Data Integration: A Theoretical Perspective. In ACM Symposium on Principles of Database Systems (PODS), pages 233--246, 2002. Google ScholarDigital Library
- T. Luczak and J. Nešetřil. A probabilistic approach to the dychotomy problem. Technical Report 640, Charles University, Prague, 2003.Google Scholar
- J. Madhavan and A. Y. Halevy. Composing Mappings Among Data Sources. In International Conference on Very Large Data Bases (VLDB), pages 572--583, 2003. Google ScholarDigital Library
- D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM Transactions on Database Systems (TODS), 4(4):455--469, Dec. 1979. Google ScholarDigital Library
- A. Madry. Data exchange: on complexity of answering queries with inequalities. Information Processing Letters, 2005. In press. Google ScholarCross Ref
- S. Melnik. Generic Model Management: Concepts and Algorithms. Lecture Notes in Computer Science 2967. Springer, 2004. Google ScholarDigital Library
- R. J. Miller, L. M. Haas, and M. Hernàndez. Schema Mapping as Query Discovery. In International Conference on Very Large Data Bases (VLDB), pages 77--88, 2000. Google ScholarDigital Library
- A. Nash, P. A. Bernstein, and S. Melnik. Composition of mappings given by embedded dependencies. In ACM Symposium on Principles of Database Systems (PODS), 2005. Google ScholarDigital Library
- C. Papadimitriou and M. Yannakakis. The Complexity of Facets and Some Facets of Complexity. In ACM Symposium on Theory of Computing (STOC), pages 229--234, 1982. Google ScholarDigital Library
- C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernandez, and R. Fagin. Translating Web Data. In International Conference on Very Large Data Bases (VLDB), pages 598--609, 2002. Google ScholarDigital Library
- N. C. Shu, B. C. Housel, R. W. Taylor, S. P. Ghosh, and V. Y. Lum. EXPRESS: A Data EXtraction, Processing, and REStructuring System. ACM Transactions on Database Systems (TODS), 2(2):134--174, 1977. Google ScholarDigital Library
- R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In Logics for Databases and Information Systems, pages 307--356. Kluwer, 1998. Google ScholarDigital Library
- M. Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137--146, 1982. Google ScholarDigital Library
Recommendations
Reflections on Schema Mappings, Data Exchange, and Metadata Management
PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsA schema mapping is a high-level specification of the relationship between two database schemas. For the past fifteen years, schema mappings have played an essential role in the modeling and analysis of data exchange, data integration, and related data ...
Management of executable schema mappings for XML data exchange
EDBT'06: Proceedings of the 2006 international conference on Current Trends in Database TechnologyExecutable schema mappings between XML schemas are essential to support numerous data management tasks such as data exchange, data integration and schema evolution. The novelty of this paper consists in a method for automatic generation of automappings (...
Composing schema mappings: second-order dependencies to the rescue
PODS '04: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsA schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). Schema mappings play a key role in numerous areas of ...
Comments