{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:48Z","timestamp":1725550608976},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292272"},{"type":"electronic","value":"9783540320876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563952_66","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T11:24:50Z","timestamp":1129721090000},"page":"694-699","source":"Crossref","is-referenced-by-count":2,"title":["An Algebraic Framework for Schema Matching"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyang","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengfei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Alagi\u0107, S., Bernstein, P.A.: A model theory for generic schema management. LNCS, vol.\u00a02497, pp. 228\u2013246. Springer, Heidelberg","DOI":"10.1007\/3-540-46093-4_14"},{"key":"66_CR2","unstructured":"Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proc. Vision Interface, pp. 82\u201388 (2000)"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Doan, A., Domingos, P., Halevy, A.: Learning to Match the Schemas of Data Sources: A Multistrategy Approach. Machine Learning\u00a0(50), 279\u2013301 (2003); Kluwer Academic Publishers Manufactured in The Netherlands","DOI":"10.1023\/A:1021765902788"},{"key":"66_CR4","unstructured":"Dubhashi, D.P.: Complexity of Logical Theories. Department of Computer Science, University of Aarhus. BRICS LS-95-5, ISSN 1395-2048 (1995)"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Federa, T., Madelaineb, F., Stewartc, I.A.: Dichotomies for classes of homomorphism problems involving unary functions. Theoretical Computer Science\u00a0(314), 1\u201343 (2004)","DOI":"10.1016\/j.tcs.2003.12.015"},{"key":"66_CR6","series-title":"Society Lecture Note Series","first-page":"239","volume-title":"Algorithmic aspects of graph homomorphisms, Combinatorics, London Math","author":"P. Hell","year":"2003","unstructured":"Hell, P.: Algorithmic aspects of graph homomorphisms, Combinatorics. London Math. Society Lecture Note Series, vol.\u00a0307, pp. 239\u2013276. Cambridge University Press, Cambridge (2003)"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Hull, R.: Managing semantic heterogeneity in databases: A theoretical perspective. In: PODS 1997, pp. 51\u201361 (1997)","DOI":"10.1145\/263661.263668"},{"key":"66_CR8","unstructured":"Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with cupid. In: VLDB 2001 (2001)"},{"key":"66_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Generic model management-concepts and algorithms,","year":"2004","unstructured":"Melnik, S.: Generic model management-concepts and algorithms. LNCS, vol.\u00a02967. Springer, Heidelberg (2004)"},{"issue":"1","key":"66_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0306-4379(94)90024-8","volume":"19","author":"R.J. Miller","year":"1994","unstructured":"Miller, R.J., Ioannidis, Y.E., Ramakrishnan, R.: Schema equivalence in heterogeneous systems: Bridging theory and practice. Information Systems\u00a019(1), 3\u201331 (1994)","journal-title":"Information Systems"},{"key":"66_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/10722280_12","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"M.L. Mugnier","year":"2000","unstructured":"Mugnier, M.L.: Knowledge representation and reasonings based on graph homomorphism. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol.\u00a01867, pp. 172\u2013192. Springer, Heidelberg (2000)"},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"Paolini, P., Pelagatti, G.: Formal Definition of Mappings in a Data Base. In: Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 40\u201346 (1977)","DOI":"10.1145\/509404.509413"},{"key":"66_CR13","doi-asserted-by":"crossref","unstructured":"Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal\u00a0(10), 334\u2013350 (2001)","DOI":"10.1007\/s007780100057"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563952_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:33Z","timestamp":1605642753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563952_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292272","9783540320876"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11563952_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}