Foundations of data exchange

Foundations of Data Exchange

Volumn 9781107016163, Issue , 2010, Pages 1-331

  Arenas, Marcelo ^a   Barceló, Pablo ^b   Libkin, Leonid ^c   Murlak, Filip ^d  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

^d UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DATA INTERCHANGE; QUERY PROCESSING; XML;

METADATA MANAGEMENT; RELATIONAL DATA; RESEARCH TOPICS; SCHEMA MAPPINGS; TARGET SOLUTION; XML DATA;

METADATA;

EID: 84926119623     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9781139060158     Document Type: Book

References (95)

1. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
2. Abiteboul, S., Segoufin, L., and Vianu, V. 2006. Representing and querying XML with incomplete information. ACM Transactions on Database Systems, 31(1), 208-254.
3. Afrati, F., and Kolaitis, P. 2008. Answering aggregate queries in data exchange. Pages 129-138 of: ACM Symposium on Principles of Database Systems (PODS).
4. Alexe, B., ten Cate, B., Kolaitis, P. G., and Tan, W. C. 2011. Designing and refining schema mappings via data examples. Pages 133-144 of: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD).
5. Amano, S., Libkin, L., and Murlak, F. 2009. XML schema mappings. Pages 33-42 of: ACM Symposium on Principles of Database Systems (PODS).
6. Amano, S., David, C., Libkin, L., and Murlak, F. 2010. On the tradeoff between mapping and querying power in XML data exchange. Pages 155-164 of: International Conference on Database Theory (ICDT).
7. Amer-Yahia, S., Cho, S., Lakshmanan, L., and Srivastava, D. 2002. Tree pattern query minimization. VLDBJ, 11, 315-331.
8. Arenas, M., and Libkin, L. 2004. A normal form for XML documents. ACM Trans. Database Syst., 29(1), 195-232.
9. Arenas, M., and Libkin, L. 2008. XML data exchange: Consistency and query answering. Journal of the ACM, 55(2).
10. Arenas, M., Pérez, J., Reutter, J. L., and Riveros, C. 2009a. Composition and inversion of schema mappings. SIGMOD Record, 38(3), 17-28.
11. Arenas, M., Pérez, J., and Riveros, C. 2009b. The recovery of a schema mapping: Bringing exchanged data back. ACM Transactions on Database Systems, 34(4), 22:1-22:48.
12. Arenas, M., Pérez, J., Reutter, J. L., and Riveros, C. 2010a. Foundations of schema mapping management. Pages 227-238 of: Proceedings of the 29th ACM Symposium on Principles of Database Systems (PODS).
13. Arenas, M., Barceló, P., Libkin, L., and Murlak, F. 2010b. Relational and XML Data Exchange. Morgan & Claypool Publishers.
14. Arenas, M., Fagin, R., and Nash, A. 2011a. Composition with target constraints. Logical Methods in Computer Science, 7(3).
15. Arenas, M., Perez, J., and Reutter, J. 2011b. Data exchange beyond complete data. Pages 83-94 of: Proceedings of the 30th ACM Symposium on Principles of Database Systems (PODS).
16. Arenas, M., Barceló, P., and Reutter, J. L. 2011c. Query languages for data exchange: Beyond unions of conjunctive queries. Theory of Computing Systems, 49(2), 489-564.
17. Arenas, M., Barceló, P., Fagin, R., and Libkin, L. 2013. Solutions and query rewriting in data exchange. Information and Computation, 228(1), 28-61.
18. Arocena, P. C., Fuxman, A., and Miller, R. J. 2010. Composing local-as-view mappings: Closure and applications. Pages 209-218 of: Proceedings of the 13th International Conference on Database Theory (ICDT).
19. Barceló, P. 2009. Logical foundations of relational data exchange. SIGMOD Record, 38(1), 49-58.
20. Barceló, P., Libkin, L., Poggi, A., and Sirangelo, C. 2010. XML with incomplete information. Journal of the ACM, 58(1).
21. Benedikt, M., Fan, W., and Geerts, F. 2008. XPath satisfiability in the presence of DTDs. Journal of the ACM, 55(2).
22. Bernstein, P. A. 2003. Applying model management to classical meta-data problems. Pages 209-220 of: Conference on Innovative Data Systems Research (CIDR).
23. Bernstein, P. A., and Melnik, S. 2007. Model management 2.0: Manipulating richer mappings. Pages 1-12 of: ACM SIGMOD Conference.
24. Bernstein, P. A., Green, T. J., Melnik, S., and Nash, A. 2008. Implementing mapping composition. VLDB J., 17(2), 333-353.
25. Bex, G. J., Neven, F., and den Bussche, J. V. 2004. DTDs versus XML Schema: A practical study. Pages 79-84 of: Proceedings of the WebDB Workshop.
26. Björklund, H., Martens, W., and Schwentick, T. 2008. Optimizing conjunctive queries over trees using schema information. Pages 132-143 of: Proceedings of Mathematical Foundations of Computer Science.
27. Björklund, H., Martens, W., and Schwentick, T. 2011. Conjunctive query containment over trees. Journal of Computer and System Sciences, 77(3), 450-472.
28. Bojańczyk, M., Kolodziejczyk, L. A., and Murlak, F. 2011. Solutions in XML data exchange. Pages 102-113 of: Milo, T. (ed), International Conference on Database Theory (ICDT). ACM.
29. Calvanese, D., Giacomo, G. D., Lenzerini, M., and Vardi, M. Y. 2011. Simplifying schema mappings. Pages 114-125 of: Proceedings of the 14th International Conference on Database Theory (ICDT).
30. Chirkova, R., Libkin, L., and Reutter, J. 2012. Tractable XML data exchange via relations. Frontiers of Computer Science, 6(3), 243-263.
31. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., and Tommasi, M. 2007. Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata. Released October, 12th 2007.
32. David, C. 2008. Complexity of data tree patterns over XML documents. Pages 278-289 of: Proceedings of Mathematical Foundations of Computer Science.
33. David, C., Libkin, L., and Murlak, F. 2010. Certain answers for XML queries. Pages 191-202 of: ACM Symposium on Principles of Database Systems (PODS).
34. de Rougemont, M., and Vieilleribiére, A. 2007. Approximate data exchange. Pages 44-58 of: International Conference on Database Theory (ICDT).
35. Deutsch, A., and Tannen, V. 2003. Reformulation of XML queries and constraints. Pages 225-241 of: International Conference on Database Theory (ICDT).
36. Deutsch, A., Nash, A., and Remmel, J. 2008. The chase revisited. Pages 149-158 of: ACM Symposium on Principles of Database Systems (PODS).
37. Doan, A., Halevy, A., and Ives, Z. 2012. Principles of Data Integration. Morgan Kaufmann.
38. Fagin, R., Kolaitis, P. G., Miller, R. J., and Popa, L. 2005a. Data exchange: Semantics and query answering. Theoretical Computer Science, 336, 89-124. Preliminary version in Proc. 2003 International Conference on Database Theory, pp. 207-224.
39. Fagin, R., Kolaitis, P., Nash, A., and Popa, L. 2008a. Towards a theory of schema-mapping optimization. Pages 33-42 of: Proceedings of the 27th ACMSymposium on Principles of Database Systems (PODS).
40. Fagin, R., Haas, L., Hernandez, M., Miller, R., Popa, L., and Velegrakis, Y. 2009. Clio: Schema mapping creation and data exchange. Pages 198-236 of: Conceptual Modeling: Foundations and Applications, Essays in Honor of John Mylopoulos. Lecture Notes in Computer Science, vol. 5600. Springer-Verlag.
41. Fagin, R. 2007. Inverting schema mappings. ACM Transactions on Database Systems, 32(4).
42. Fagin, R., and Kolaitis, P. G. 2012. Local transformations and conjunctive-query equivalence. Pages 179-190 of: Proceedings of the 31st ACM Symposium on Principles of Database Systems (PODS).
43. Fagin, R., and Nash, A. 2010. The structure of inverses in schema mappings. Journal of the ACM, 57(6), 31.
44. Fagin, R., Kolaitis, P. G., Popa, L., and Tan, W. C. 2005b. Composing schema mappings: Second-order dependencies to the rescue. ACM Transactions on Database Systems, 30(4), 994-1055.
45. Fagin, R., Kolaitis, P., and Popa, L. 2005c. Data exchange: Getting to the core. ACM Transactions on Database Systems, 30(1), 174-210.
46. Fagin, R., Kolaitis, P. G., Popa, L., and Tan, W. C. 2008b. Quasi-inverses of schema mappings. ACM Trans. Database Syst., 33(2), 11:1-11:52.
47. Fagin, R., Kimelfeld, B., and Kolaitis, P. 2010. Probabilistic data exchange. Pages 76-88 of: International Conference on Database Theory (ICDT).
48. Fagin, R., Kolaitis, P. G., Popa, L., and Tan, W. C. 2011. Reverse data exchange: Coping with nulls. ACM Trans. Database Syst., 36(2), 11.
49. Feinerer, I., Pichler, R., Sallinger, E., and Savenkov, V. 2011. On the undecidability of the equivalence of second-order tuple generating dependencies. In: Proceedings of the 5th Alberto Mendelzon InternationalWorkshop on Foundations of Data Management (AMW).
50. Fuxman, A., Kolaitis, P., Miller, R., and Tan, W.-C. 2006. Peer data exchange. ACM Transactions on Database Systems, 31(4), 1454-1498.
51. Garcia-Molina, H., Ullman, J., and Widom, J. 2001. Database Systems: The Complete Book. Prentice Hall.
52. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
53. Gheerbrant, A., Libkin, L., and Tan, T. 2012. On the complexity of query answering over incomplete XML documents. Pages 169-181 of: International Conference on Database Theory (ICDT).
54. Giacomo, G. D., Lembo, D., Lenzerini, M., and Rosati, R. 2007. On reconciling data exchange, data integration, and peer data management. Pages 133-142 of: ACM Symposium on Principles of Database Systems (PODS).
55. Gottlob, G., and Nash, A. 2008. Efficient core computation in data exchange. Journal of the ACM, 55(2).
56. Gottlob, G., Koch, C., Pichler, R., and Segoufin, L. 2005. The complexity of XPath query evaluation and XML typing. Journal of the ACM, 52(2), 284-335.
57. Gottlob, G., Koch, C., and Schulz, K. U. 2006. Conjunctive queries over trees. Journal of the ACM, 53(2), 238-272.
58. Gou, G., and Chirkova, R. 2007. Efficiently querying large XML data repositories: A survey. IEEE Trans. Knowl. Data Eng., 19(10), 1381-1403.
59. Grahne, G., and Onet, A. 2012. Representation systems for data exchange. Pages 208-221 of: Proceedings of the 15th International Conference on Database Theory (ICDT).
60. Haas, L.M. 2007. Beauty and the beast: The theory and practice of information integration. Pages 28-43 of: International Conference on Database Theory (ICDT).
61. Hell, P., and Nesetril, J. 1992. The core of a graph. Discrete Mathematics, 109(1-3), 117-126.
62. Hernich, A. 2011. Answering non-monotonic queries in relational data exchange. Logical Methods in Computer Science, 7(3).
63. Hernich, A., and Schweikardt, N. 2007. CWA-solutions for data exchange settings with target dependencies. Pages 113-122 of: ACM Symposium on Principles of Database Systems (PODS).
64. Hernich, A., Libkin, L., and Schweikardt, N. 2011. Closed world data exchange. ACM Transactions on Database Systems, 36(2).
65. Hidders, J. 2003. Satisfiability of XPath expressions. Pages 21-36 of: Database Programming Languages.
66. Hopcroft, J., and Ullman, J. 1979. Introduction to Automata Theory. Addison-Wesley.
67. Housel, B., Taylor, R., Ghosh, S., and Lum, V. Y. 1977. EXPRESS: A data extraction, processing, and restructuring system. ACM Transactions on Database Systems, 2(2), 134-174.
68. Imieliński, T., and Lipski, W. 1984. Incomplete information in relational databases. Journal of the ACM, 31(4), 761-791.
69. Klarlund, N., Schwentick, T., and Suciu, D. 2003. XML: Model, schemas, types, logics, and queries. Pages 1-41 of: Chomicki, J., van der Meyden, R., and Saake, G. (eds), Logics for Emerging Applications of Databases. Springer.
70. Kolaitis, P. G. 2005. Schema mappings, data exchange, and metadata management. Pages 61-75 of: ACM Symposium on Principles of Database Systems (PODS).
71. Kolaitis, P. G., Panttaja, J., and Tan, W. C. 2006. The complexity of data exchange. Pages 30-39 of: Vansummeren, S. (ed), ACMSymposiumon Principles of Database Systems (PODS). ACM.
72. Lenzerini, M. 2002. Data integration: A theoretical perspective. Pages 233-246 of: Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS).
73. Libkin, L. 2006a. Data exchange and incomplete information. Pages 60-69 of: ACM Symposium on Principles of Database Systems (PODS).
74. Libkin, L. 2006b. Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3).
75. Libkin, L., and Sirangelo, C. 2011. Data exchange and schema mappings in open and closed worlds. J. Comput. Syst. Sci., 77(3), 542-571.
76. Marnette, B. 2009. Generalized schema-mappings: from termination to tractability. Pages 13-22 of: ACM Symposium on Principles of Database Systems (PODS).
77. Marnette, B., Mecca, G., and Papotti, P. 2010. Scalable data exchange with functional dependencies. PVLDB, 3(1), 105-116.
78. Marnette, B., Mecca, G., Papotti, P., Raunich, S., and Santoro, D. 2011. ++Spicy: An OpenSource tool for second-generation schema mapping and data exchange. PVLDB, 4(12), 1438-1441.
79. Madry, A. 2005. Data exchange:On the complexity of answering queries with inequalities. Information Processing Letters, 94(6), 253-257.
80. Mecca, G., Papotti, P., and Raunich, S. 2009. Core schema mappings. Pages 655-688 of: ACM SIGMOD Conference.
81. Meier, M., Schmidt, M., and Lausen, G. 2009. Stop the chase: Short contribution. In: Arenas, M., and Bertossi, L. E. (eds), AMW. CEURWorkshop Proceedings, vol. 450. CEUR-WS.org.
82. Melnik, S. 2004. Generic Model Management: Concepts and Algorithms. Lecture Notes in Computer Science, vol. 2967. Springer.
83. Miller, R. J., Hernndez, M. A., Haas, L. M., Yan, L.-L., Ho, C. T. H., Fagin, R., and Popa, L. 2001. The Clio project: Managing heterogeneity. SIGMOD Record, 30(1), 78-83.
84. Nash, A., Bernstein, P. A., and Melnik, S. 2007. Composition of mappings given by embedded dependencies. ACM Trans. Database Syst., 32(1), 4:1-4:51.
85. Neven, F. 2002. Automata, Logic, and XML. Pages 2-26 of: Bradfield, J. C. (ed), CSL. Lecture Notes in Computer Science, vol. 2471. Springer.
86. Papadimitriou, C. 1994. Computational Complexity. Addison-Wesley.
87. Pérez, J., Pichler, R., Sallinger, E., and Savenkov, V. 2012. Union and intersection of schema mappings. Pages 129-141 of: Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW).
88. Pichler, R., Sallinger, E., and Savenkov, V. 2011. Relaxed notions of schema mapping equivalence revisited. Pages 90-101 of: Proceedings of the 14th International Conference on Database Theory (ICDT).
89. Schwentick, T. 2007. Automata for XML-A survey. Journal of Computer and System Sciences, 73(3), 289-315.
90. Sipser, M. 1997. Introduction to the Theory of Computation. PWS Publishing Company.
91. ten Cate, B., and Kolaitis, P. 2009. Structural characterizations of schema-mapping languages. Pages 63-72 of: International Conference on Database Theory (ICDT).
92. ten Cate, B., Chiticariu, L., Kolaitis, P. G., and Tan, W. C. 2009. Laconic schemamappings: Computing the core with SQL queries. PVLDB, 2(1), 1006-1017.
93. ten Cate, B., Dalmau, V., and Kolaitis, P. G. 2012. Learning schema mappings. Pages 182-195 of: Proceedings of the 15th International Conference on Database Theory (ICDT).
94. Ullman, J. 1988. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press.
95. Vianu, V. 2001. A Web odyssey: From Codd to XML. Pages 1-15 of: ACM Symposium on Principles of Database Systems (PODS).