{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:42Z","timestamp":1759683522958,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T00:00:00Z","timestamp":1506902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T00:00:00Z","timestamp":1506902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M025268\/1"],"award-info":[{"award-number":["EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1217869"],"award-info":[{"award-number":["IIS-1217869"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["(FWF):P25207-N23"],"award-info":[{"award-number":["(FWF):P25207-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["(FWF):Y698"],"award-info":[{"award-number":["(FWF):Y698"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"crossref","award":["ICT12-015"],"award-info":[{"award-number":["ICT12-015"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00224-017-9812-7","type":"journal-article","created":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T01:21:56Z","timestamp":1506907316000},"page":"899-940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Limits of Schema Mappings"],"prefix":"10.1007","volume":"62","author":[{"given":"Phokion G.","family":"Kolaitis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Sallinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim","family":"Savenkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,2]]},"reference":[{"key":"9812_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139060158","volume-title":"Foundations of data exchange","author":"M Arenas","year":"2014","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L., Murlak, F.: Foundations of data exchange. Cambridge University Press, Cambridge (2014)"},{"issue":"6","key":"9812_CR2","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.jcss.2013.01.002","volume":"79","author":"M Arenas","year":"2013","unstructured":"Arenas, M., P\u00e9rez, J., Reutter, J., Riveros, C.: The language of plain SO-tgds: composition, inversion and structural properties. J. Comput. Syst. Sci. 79 (6), 763\u2013784 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"9812_CR3","unstructured":"Bernstein, P.A.: Applying model management to classical meta data problems. In: CIDR (2003)"},{"issue":"1","key":"9812_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1017\/S0022481200051756","volume":"41","author":"R Fagin","year":"1976","unstructured":"Fagin, R.: Probabilities on finite models. J. Symb. Log. 41(1), 50\u201358 (1976)","journal-title":"J. Symb. Log."},{"key":"9812_CR5","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kolaitis, P.G.: Local transformations and conjunctive-query equivalence. In: PODS, pp 179\u2013190 (2012)","DOI":"10.1145\/2213556.2213583"},{"issue":"1","key":"9812_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9812_CR7","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kolaitis, P.G., Nash, A., Popa, L.: Towards a theory of schema-mapping optimization. In: PODS, pp 33\u201342 (2008)","DOI":"10.1145\/1376916.1376922"},{"issue":"4","key":"9812_CR8","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1145\/1114244.1114249","volume":"30","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Popa, L., Tan, W.C.: Composing schema mappings: second-order dependencies to the rescue. ACM Trans. Database Syst. 30 (4), 994\u20131055 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"9812_CR9","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kolaitis, P.G., Popa, L., Tan, W.C.: Schema mapping evolution through composition and inversion. In: In Schema Matching and Mapping, pp. 191\u2013222. Springer (2011)","DOI":"10.1007\/978-3-642-16518-4_7"},{"key":"9812_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.is.2014.09.003","volume":"48","author":"I Feinerer","year":"2015","unstructured":"Feinerer, I., Pichler, R., Sallinger, E., Savenkov, V.: On the undecidability of the equivalence of second-order tuple generating dependencies. Inf. Syst. 48, 113\u2013129 (2015)","journal-title":"Inf. Syst."},{"key":"9812_CR11","doi-asserted-by":"crossref","unstructured":"Kolaitis, P.G.: Schema mappings, data exchange, and metadata management. In: PODS, pp 61\u201375 (2005)","DOI":"10.1145\/1065167.1065176"},{"key":"9812_CR12","doi-asserted-by":"crossref","unstructured":"Lenzerini, M.: Data integration: a theoretical perspective. In: PODS, pp 233\u2013246 (2002)","DOI":"10.1145\/543613.543644"},{"key":"9812_CR13","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Large networks and graph limits, volume 60 of colloquium publications. American Mathematical Society (2012)","DOI":"10.1090\/coll\/060"},{"key":"9812_CR14","doi-asserted-by":"crossref","unstructured":"Madhavan, J., Halevy, A.Y.: Composing mappings among data sources. In: VLDB, pp 572\u2013583 (2003)","DOI":"10.1016\/B978-012722442-8\/50057-4"},{"key":"9812_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity - graphs, structures, and algorithms, volume 28 of algorithms and combinatorics","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity - graphs, structures, and algorithms, volume 28 of algorithms and combinatorics. Springer, Berlin (2012)"},{"key":"9812_CR16","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: A unified approach to structural limits, and limits of graphs with bounded tree-depth. arXiv: 1303.6471 (2013)"},{"key":"9812_CR17","unstructured":"Pin, J.: Profinite methods in automata theory. In: STACS, pp 31\u201350 (2009)"},{"key":"9812_CR18","volume-title":"Metric spaces","author":"S Shirali","year":"2006","unstructured":"Shirali, S., Vasudeva, H.: Metric spaces. Springer, Berlin (2006)"},{"key":"9812_CR19","doi-asserted-by":"crossref","unstructured":"ten Cate, B., Kolaitis, P.G.: Structural characterizations of schema-mapping languages. In: ICDT, pp 63\u201372 (2009)","DOI":"10.1145\/1514894.1514903"},{"key":"9812_CR20","doi-asserted-by":"crossref","unstructured":"Torunczyk, S.: Languages of profinite words and the limitedness problem. In: ICALP, pp 377\u2013389 (2012)","DOI":"10.1007\/978-3-642-31585-5_35"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9812-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9812-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9812-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T17:03:09Z","timestamp":1693069389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9812-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,2]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["9812"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9812-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2017,10,2]]},"assertion":[{"value":"2 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}