{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:19:02Z","timestamp":1725520742774},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540888741"},{"type":"electronic","value":"9783540888758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88875-8_25","type":"book-chapter","created":{"date-parts":[[2008,11,18]],"date-time":"2008-11-18T21:47:37Z","timestamp":1227044857000},"page":"66-75","source":"Crossref","is-referenced-by-count":1,"title":["Computing Path Similarity Relevant to XML Schema Matching"],"prefix":"10.1007","author":[{"given":"Amar","family":"Zerdazi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myriam","family":"Lamolle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-62222-5_56","volume-title":"Database Theory - ICDT \u201997","author":"S. Abiteboul","year":"1996","unstructured":"Abiteboul, S., Cluet, S., Milo, T.: Correspondence and Translation for heterogeneous data. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 351\u2013363. Springer, Heidelberg (1996)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, A., Cho, S., Srivastava, D.: Tree Pattern Relaxation. In: Proceedings of DBT 2002 (2002)","DOI":"10.1007\/3-540-45876-X_32"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Carmel, D., Efraty, G., Landau, G.M., Maarek, Y.S., Mass, Y.: An Extension of the vector space model for querying XML documents via XML fragments. In: XML and IR Workshop, 2nd edn., SIGIR Forum (2002)","DOI":"10.1145\/860435.860464"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Castano, S., De Antonellis, V.: A schema analysis and Reconciliation Tool Environment For Heterogeneous Databases. In: Proceedings of International Database Engineering and Applications Symposium (1999)","DOI":"10.1109\/IDEAS.1999.787251"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Doan, A., Madhavan, J., Domingos, P., Halevey, A.: Reconciling schemas of disparate data sources: A machine Learning Approach. In: Proceedings ACM SIGMOD conference, pp. 509\u2013520 (2001)","DOI":"10.1145\/375663.375731"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Drew, P., King, R., McLeod, D., Rusinkiewicz, M., Silberschatz, A.: Report of the Workshop on Semantic Heterogeneity and Interoperation in Multidatabase Systems. In: Proceedings ACM SIGMOD record, pp. 47\u201356 (1993)","DOI":"10.1145\/163090.163098"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Hirschberg, D.S.: A Linear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM (1975)","DOI":"10.1145\/360825.360861"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Li, W.S., Clifton, C.: Semantic Integration in Heterogeneous Databases Using Neural Networks. VLDB (1994)","DOI":"10.1145\/223784.223897"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Li, W.S., Clifton, C.: SemInt: A Tool for Identifying Attribute Correspondences in Heterogeneous Databases Using Neural Network. Data and Knowledge Engineering (2000)","DOI":"10.1016\/S0169-023X(99)00044-0"},{"key":"25_CR10","unstructured":"Madhavan, J., Bernstein, P., Rahm, E.: Generic schema matching with cupid. VLDB (2001)"},{"key":"25_CR11","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A versatile Graph Matching and its Application to Schema Matching. Data Engineering (2002)"},{"key":"25_CR12","unstructured":"Miller, A.G., Hass, L., Hernandez, M.A.: Schema mapping as query discovery. VLDB, 77\u201388 (2000)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Rahm, E., Bernstein, P.: A survey of approaches to automatic schema matching. VLDB Journal, 334\u2013350 (2001)","DOI":"10.1007\/s007780100057"},{"key":"25_CR14","unstructured":"XML Schema, W3C Recommendation, XML-Schema Primer, W3 Consortium (2001), http:\/\/www.w3.org\/TR\/xmlschema-0"},{"key":"25_CR15","unstructured":"Zerdazi, A., Lamolle, M.: Mod\u00e9lisation des sch\u00e9mas XML par adjonction de m\u00e9taconnaissances s\u00e9mantiques. In: ASTI 2005 (2005)"},{"key":"25_CR16","unstructured":"Zerdazi, A., Lamolle, M.: Matching of Enhanced XML Schema with a measure of structural-context similarity. In: Proceeding of The 3rd International Conference on Web Information Systems and Technologies, WEBIST 2007 (2007)"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2008 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88875-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T04:13:27Z","timestamp":1684642407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88875-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540888741","9783540888758"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88875-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}