×

zbMATH — the first resource for mathematics

XML schema mappings, data exchange and metadata management. (English) Zbl 1295.68099
MSC:
68P05 Data structures
68P15 Database theory
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Software:
XPath
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Serge Abiteboul, Paris C. Kanellakis, and Gösta Grahne. 1991. On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78, 1, 158–187. · Zbl 0741.68039
[2] Foto N. Afrati and Phokion G. Kolaitis. 2008. Answering aggregate queries in data exchange. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 129–138.
[3] Shun’ichi Amano, Claire David, Leonid Libkin, and Filip Murlak. 2010. On the tradeoff between mapping and querying power in XML data exchange. In Proceedings of the International Conference on Database Theory (ICDT). 155–164.
[4] Shun’ichi Amano, Leonid Libkin, and Filip Murlak. 2009. XML schema mappings. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 33–42.
[5] Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshmanan, and Divesh Srivastava. 2002. Tree pattern query minimization. VLDB J. 11, 4, 315–331. · Zbl 1047.68040
[6] Marcelo Arenas, Pablo Barceló, Ronald Fagin, and Leonid Libkin. 2004. LocAlly consistent transformations and query answering in data exchange. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 229–240.
[7] Marcelo Arenas, Pablo Barceló, Leonid Libkin, and Filip Murlak. 2010. Relational and XML Data Exchange. Morgan & Claypool Publishers. · Zbl 1216.68003
[8] Marcelo Arenas, Pablo Barceló, and Juan L. Reutter. 2011. Query languages for data exchange: Beyond unions of conjunctive queries. Theory Comput. Syst. 49, 2, 489–564. · Zbl 1230.68066
[9] Marcelo Arenas and Leonid Libkin. 2008. XML data exchange: Consistency and query answering. J. ACM 55, 2. · Zbl 1326.68116 · doi:10.1145/1346330.1346332
[10] Marcelo Arenas, Jorge Pérez, and Cristian Riveros. 2009. The recovery of a schema mapping: Bringing exchanged data back. ACM Trans. Datab. Syst. 34, 4.
[11] Denilson Barbosa, Juliana Freire, and Alberto O. Mendelzon. 2005. Designing information-preserving mapping schemes for xml. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 109–120.
[12] Pablo Barceló. 2009. Logical foundations of relational data exchange. SIGMOD Record 38, 1, 49–58.
[13] Pablo Barceló, Leonid Libkin, Antonella Poggi, and Cristina Sirangelo. 2010. XML with incomplete information. J. ACM 58, 1, 4. · Zbl 1327.68088
[14] Michael Benedikt, Wenfei Fan, and Floris Geerts. 2008. XPath satisfiability in the presence of DTDs. J. ACM 55, 2. · Zbl 1326.68154 · doi:10.1145/1346330.1346333
[15] Philip A. Bernstein and Sergey Melnik. 2007. Model management 2.0: manipulating richer mappings. In Proceedings of the SIGMOD Conference. 1–12. · doi:10.1063/1.2734399
[16] Henrik Björklund, Wim Martens, and Thomas Schwentick. 2008. Optimizing conjunctive queries over trees using schema information. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS). 132–143. · Zbl 1173.68473
[17] Henrik Björklund, Wim Martens, and Thomas Schwentick. 2011. Conjunctive query containment over trees. J. Comput. Syst. Sci. 77, 3, 450–472. · Zbl 1215.68087
[18] Miko&lslash;aj Bojańczyk, Leszek Aleksander Ko&lslash;odziejczyk, and Filip Murlak. 2013. Solutions in XML data exchange. J. Comput. Syst. Sci. 79, 6, 785–815.
[19] Miko&lslash;aj Bojańczyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. 2009. Two-variable logic on data trees and XML reasoning. J. ACM 56, 3. · Zbl 1325.68078
[20] Rada Chirkova, Leonid Libkin, and Juan Reutter. 2012. Tractable XML data exchange via relations. Frontiers Comput. Sci. 6, 3, 243–263. · Zbl 1251.68083
[21] Laura Chiticariu and Wang Chiew Tan. 2006. Debugging schema mappings with routes. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 79–90.
[22] Claire David. 2008. Complexity of data tree patterns over XML documents. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS). 278–289. · Zbl 1173.68477
[23] Claire David, Amélie Gheerbrant, Leonid Libkin, and Wim Martens. 2013. Containment of pattern-based queries over data trees. In Proceedings of the International Conference on Database Theory (ICDT). 201–212.
[24] Claire David, Leonid Libkin, and Filip Murlak. 2010. Certain answers for XML queries. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 191–202.
[25] Ronald Fagin, Laura M. Haas, Mauricio A. Hernández, Renée J. Miller, Lucian Popa, and Yannis Velegrakis. 2009. Clio: Schema mapping creation and data exchange. In Conceptual Modeling: Foundations and Applications, 198–236.
[26] Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336, 1, 89–124. · Zbl 1080.68019
[27] Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, and Wang Chiew Tan. 2004. Composing Schema Mappings: Second-Order Dependencies to the Rescue. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 83–94.
[28] Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, and Wang Chiew Tan. 2008. Quasi-inverses of schema mappings. ACM Trans. Datab. Syst. 33, 2, 11:1–11:52.
[29] Wenfei Fan and Philip Bohannon. 2008. Information preserving XML schema embedding. ACM Trans. Datab. Syst. 33, 1. · Zbl 05457142 · doi:10.1145/1331904.1331908
[30] Wenfei Fan and Leonid Libkin. 2002. On XML integrity constraints in the presence of DTDs. J. ACM 49, 3, 368–406. · Zbl 1326.68120 · doi:10.1145/567112.567117
[31] Amélie Gheerbrant, Leonid Libkin, and Tony Tan. 2012. On the complexity of query answering over incomplete XML documents. In Proceedings of the International Conference on Database Theory (ICDT). 169–181.
[32] Georg Gottlob, Christoph Koch, and Klaus U. Schulz. 2006. Conjunctive queries over trees. J. ACM 53, 2, 238–272. · Zbl 1326.68110 · doi:10.1145/1131342.1131345
[33] Georg Gottlob and Pierre Senellart. 2010. Schema mapping discovery from data instances. J. ACM 57, 2. · Zbl 1327.68092 · doi:10.1145/1667053.1667055
[34] André Hernich, Leonid Libkin, and Nicole Schweikardt. 2011. Closed world data exchange. ACM Trans. Datab. Syst. 36, 2, 14.
[35] Jan Hidders. 2003. Satisfiability of XPath expressions. In Proceedings of the International Symposium on Database Programming Languages (DBPL). 21–36.
[36] Phokion G. Kolaitis. 2005. Schema mappings, data exchange, and metadata management. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 61–75.
[37] Phokion G. Kolaitis, Jonathan Panttaja, and Wang Chiew Tan. 2006. The complexity of data exchange. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 30–39.
[38] Harry R. Lewis. 1980. Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci. 21, 3, 317–353. · Zbl 0471.03034 · doi:10.1016/0022-0000(80)90027-6
[39] Leonid Libkin. 2006. Data exchange and incomplete information. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 60–69.
[40] Leonid Libkin and Cristina Sirangelo. 2011. Data exchange and schema mappings in open and closed worlds. J. Comput. Syst. Sci. 77, 3, 542–571. · Zbl 1215.68093 · doi:10.1016/j.jcss.2010.04.010
[41] Jayant Madhavan and Alon Y. Halevy. 2003. Composing mappings among data sources. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 572–583.
[42] Aleksander Mądry. 2005. Data exchange: On the complexity of answering queries with inequalities. Inform. Process. Lett. 94, 6, 253–257. · Zbl 1182.68074
[43] Bruno Marnette, Giansalvatore Mecca, Paolo Papotti, Salvatore Raunich, and Donatello Santoro. 2011. ++Spicy: An OpenSource tool for second-generation schema mapping and data exchange. Proc. VLDB 4, 12, 1438–1441.
[44] Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm. 2002. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Proceedings of the International Conference on Data Engineering (ICDE). 117–128. · doi:10.1109/ICDE.2002.994702
[45] Gerome Miklau and Dan Suciu. 2004. Containment and equivalence for a fragment of XPath. J. ACM 51, 1, 2–45. · Zbl 1316.68047 · doi:10.1145/962446.962448
[46] Tova Milo and Sagit Zohar. 1998. Using schema matching to simplify heterogeneous data translation. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 122–133.
[47] Alan Nash, Philip A. Bernstein, and Sergey Melnik. 2007. Composition of mappings given by embedded dependencies. ACM Trans. Datab. Syst. 32, 1, 4:1–4:51.
[48] Christos Papadimitriou. 1994. Computational Complexity. Addison-Wesley. · Zbl 0833.68049
[49] Reinhard Pichler and Sebastian Skritek. 2011. The complexity of evaluating tuple generating dependencies. In Proceedings of the International Conference on Database Theory (ICDT). 244–255.
[50] Lucian Popa, Yannis Velegrakis, Renée J. Miller, Mauricio A. Hernández, and Ronald Fagin. 2002. Translating web data. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 598–609. · doi:10.1016/B978-155860869-6/50059-7
[51] Luc Segoufin. 2006. Automata and logics for words and trees over an infinite alphabet. In Computer Science Logic (CSL), 41–57. · Zbl 1225.68103 · doi:10.1007/11874683_3
[52] Balder ten Cate and Phokion G. Kolaitis. 2010. Structural characterizations of schema-mapping languages. Commun. ACM 53, 1, 101–110. · Zbl 05748079 · doi:10.1145/1629175.1629201
[53] Cong Yu and Lucian Popa. 2004. Constraint-based XML query rewriting for data integration. In Proceedings of the SIGMOD Conference. 371–382.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.