{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:12:26Z","timestamp":1772817146835,"version":"3.50.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0306-4379(03)00031-0","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"23-46","source":"Crossref","is-referenced-by-count":62,"title":["A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications"],"prefix":"10.1016","volume":"29","author":[{"given":"Elisa","family":"Bertino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Guerrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Mesiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0306-4379(03)00031-0_BIB1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","article-title":"Features of similarity","volume":"84","author":"Tversky","year":"1977","journal-title":"J. Psychological Rev."},{"issue":"4","key":"10.1016\/S0306-4379(03)00031-0_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/27633.27634","article-title":"A comparative analysis of methodologies for database schema integration","volume":"18","author":"Batini","year":"1986","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB3","doi-asserted-by":"crossref","unstructured":"M. Lee, L. Yang, W. Hsu, X. Yang, XClust: clustering XML schemas for effective integration, in: Proceedings of 11th International Conference on Information and Knowledge Management (CIKM), McLean, VA, 2002, pp. 292\u2013299.","DOI":"10.1145\/584792.584841"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB4","unstructured":"W3C. Extensible Markup Language (XML), 1998."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB5","series-title":"Modern Information Retrieval","author":"Baeza-Yates","year":"1999"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB6","unstructured":"S. Flesca, G. Manco, E. Masciari, L. Pontieri, A. Pugliese, Detecting structural similarities between XML documents, in: Proceedings of 5th International Workshop on the Web and Databases, Madison, WI, 2002."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB7","unstructured":"A. Nierman, H. Jagadish, Evaluating structural similarity in XML documents, in: Proceedings of 5th International Workshop on the Web and Databases, Madison, WI, 2002."},{"issue":"2","key":"10.1016\/S0306-4379(03)00031-0_BIB8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02526038","article-title":"Classes of cost functions for string edit distance","volume":"18","author":"Rice","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB9","doi-asserted-by":"crossref","unstructured":"H.-H. Do, E. Rahm, COMA\u2014a system for flexible combination of schema matching approaches, in: Proceedings of 28th International Conference on Very Large Databases (VLDB), Hong Kong, 2002, pp. 610\u2013621.","DOI":"10.1016\/B978-155860869-6\/50060-3"},{"issue":"2","key":"10.1016\/S0306-4379(03)00031-0_BIB10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/376284.375731","article-title":"Reconciling schemas of disparate data sources","volume":"30","author":"Doan","year":"2001","journal-title":"SIGMOD Rec."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB11","unstructured":"J. Madhavan, P. Bernstein, E. Rahm, Generic schema matching with cupid, in: Proceedings of 27th International Conference on Very Large Databases (VLDB), Rome, 2001, pp. 49\u201358."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB12","unstructured":"E. Bertino, G. Guerrini, M. Mesiti, Measuring the structural similarity among XML documents, Technical Report DISI-TR-02-02, University of Genova, 2002, submitted for publication."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB13","unstructured":"M. Mesiti, A structural similarity measure for XML documents: theory and applications, Ph.D. Thesis, University of Genova, Italy, 2003."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB14","unstructured":"W3C. Document Object Model (DOM), 1998."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB15","doi-asserted-by":"crossref","unstructured":"E. Bertino, G. Guerrini, M. Mesiti, L. Tosetto, Evolving a set of DTDs according to a dynamic set of XML documents, in: XML-Based Data Management and Multimedia Engineering\u2014EDBT 2002 Workshop Revised Papers, Lecture Notes in Computer Science, Vol. 2490, Springer, Berlin, 2002, pp. 45\u201366.","DOI":"10.1007\/3-540-36128-6_4"},{"issue":"1","key":"10.1016\/S0306-4379(03)00031-0_BIB16","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/360402.360421","article-title":"Algorithms for association rule mining\u2014a general survey and comparison","volume":"2","author":"Hipp","year":"2000","journal-title":"SIGKDD Explor."},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB17","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/PL00011672","article-title":"Efficient graph-based algorithms for discovering and maintaining association rules in large databases","volume":"3","author":"Lee","year":"2001","journal-title":"Knowledge Inform. System"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB18","doi-asserted-by":"crossref","unstructured":"M.N. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, K. Shim, XTRACT: a system for extracting document type descriptors from XML documents, in: Proceedings of International Conference on Management of Data (SIGMOD), Dallas, TX, 2000, pp. 165\u2013176.","DOI":"10.1145\/342009.335409"},{"key":"10.1016\/S0306-4379(03)00031-0_BIB19","unstructured":"J. Hammer, H. Garcia-Molina, J. Cho, R. Aranha, A. Crespo, Extracting semistructured information from the web, in: Proceedings of Workshop on Management of Semistructured Data, Tucson, 1997."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB20","unstructured":"W3C. XML Path Language (Xpath), 1999."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB21","doi-asserted-by":"crossref","unstructured":"I. Stanoi, G. Mihaila, S. Padmanabhan, A framework for the selective dissemination of XML documents based on inferred user profiles, in: Proceedings of 19th International Conference on Data Engineering, Bangalore, 2003.","DOI":"10.1109\/ICDE.2003.1260819"},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1019289831564","article-title":"Specifying and enforcing access control policies for XML document sources","volume":"3","author":"Bertino","year":"2000","journal-title":"World Wide Web J."},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0169-023X(02)00127-1","article-title":"Protection and administration of XML data sources","volume":"43","author":"Bertino","year":"2002","journal-title":"Data Knowledge Eng."},{"issue":"1","key":"10.1016\/S0306-4379(03)00031-0_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/asi.4630260106","article-title":"A theory of term importance in automic text analysis","volume":"26","author":"Salton","year":"1975","journal-title":"J. Amer. Soc. Inform. Sci."},{"issue":"6","key":"10.1016\/S0306-4379(03)00031-0_BIB25","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/S0306-4379(03)00031-0_BIB26","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","article-title":"On the editing distance between unordered labeled trees","volume":"42","author":"Zhang","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB28","first-page":"175","article-title":"Guest Editors\u2019 Introduction to the special issue on heterogeneous databases","volume":"22","author":"Elmagarmid","year":"1990","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"10.1016\/S0306-4379(03)00031-0_BIB29","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/276404.276408","article-title":"Issues and approaches of database integration","volume":"41","author":"Parent","year":"1998","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0306-4379(03)00031-0_BIB30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/96602.96604","article-title":"Federated database systems for managing distributed, heterogeneous, and autonomous databases","volume":"22","author":"Sheth","year":"1990","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB31","doi-asserted-by":"crossref","unstructured":"H.-H. Do, S. Melnik, E. Rahm, Comparison of schema matching evaluations, in: Web, Web-Services, and Database Systems, Lecture Notes in Computer Science, Vol. 2593, 2003, pp. 221\u2013237.","DOI":"10.1007\/3-540-36560-5_17"},{"issue":"4","key":"10.1016\/S0306-4379(03)00031-0_BIB32","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s007780100057","article-title":"A survey of approaches to automatic schema matching","volume":"10","author":"Rahm","year":"2001","journal-title":"VLDB J."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB33","unstructured":"R. Goldman, J. Widom, Dataguides: enabling query formulation and optimization in semistructured databases, in: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB), Athens, 1997, pp. 436\u2013445."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB34","unstructured":"G. Grahne, A. Thomo, Approximate reasoning in semi-structured databases, in: Proceedings of 8th International Workshop on Knowledge Representation meets Databases, CEUR Workshop Proceedings, Vol. 45, Rome, 2001."},{"key":"10.1016\/S0306-4379(03)00031-0_BIB35","doi-asserted-by":"crossref","unstructured":"E. Bertino, G. Guerrini, I. Merlo, M. Mesiti, An approach to classify semi-structured objects, in: Proceedings of 13th European Conference on Object-Oriented Programming (ECOOP), Lecture Notes in Computer Science, Vol. 1628, Springer, Berlin, 1999, pp. 416\u2013440.","DOI":"10.1007\/3-540-48743-3_19"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437903000310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437903000310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T23:56:16Z","timestamp":1553126176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437903000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0306437903000310"],"URL":"https:\/\/doi.org\/10.1016\/s0306-4379(03)00031-0","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}