Minimizing user effort in XML grammar matching

LAUR Repository

Show simple item record

dc.contributor.author Tekli, Joe
dc.contributor.author Chbeir, Richard
dc.date.accessioned 2017-01-27T09:43:37Z
dc.date.available 2017-01-27T09:43:37Z
dc.date.copyright 2012 en_US
dc.date.issued 2017-01-27
dc.identifier.issn 0020-0255 en_US
dc.identifier.uri http://hdl.handle.net/10725/5085
dc.description.abstract XML grammar matching has found considerable interest recently, due to the growing number of heterogeneous XML documents on the Web, and the need to integrate, search and retrieve XML documents originated from different data sources. In this study, we provide an approach for automatic XML grammar matching and comparison aiming to minimize the amount of user effort required to perform the match task. This requires (i) considering the various characteristics and constraints of XML grammars (in comparison with ‘grammar simplifying’ approaches), (ii) allowing a flexible combination of different matching criteria (in comparison with static approaches), and (iii) effectively considering the semi-structured nature of XML (in contrast with heuristic methods). To achieve this, we propose an extensible framework based on the concept of tree edit distance as an optimal technique to consider XML structure, integrating different matching criteria to capture all basic XML grammar characteristics, ranging over element semantic and syntactic similarities, cardinality and alternativeness constraints, as well as data-type correspondences and relative ordering. In addition, our framework is flexible, enabling the user to choose mapping cardinality (i.e., 1:1, 1:n, n:1, n:n), in comparison with exiting static methods (usually constrained to 1:1). User constraints and feedback are equally considered in order to adjust matching results to the user’s perception of correct matches. Experiments on real and synthetic XML grammars demonstrate the effectiveness and efficiency of our matching strategy in identifying mappings, in comparison with alternative methods. en_US
dc.language.iso en en_US
dc.title Minimizing user effort in XML grammar matching en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SOE en_US
dc.author.idnumber 201306321 en_US
dc.author.department Electrical And Computer Engineering en_US
dc.description.embargo N/A en_US
dc.relation.journal Information Sciences en_US
dc.journal.volume 210 en_US
dc.article.pages 1-40 en_US
dc.keywords XML en_US
dc.keywords Semi-structured data en_US
dc.keywords XML grammar en_US
dc.keywords Schema matching en_US
dc.keywords Structural similarity en_US
dc.keywords Semantic similarity en_US
dc.identifier.doi http://dx.doi.org/10.1016/j.ins.2012.04.026 en_US
dc.identifier.ctation Tekli, J., & Chbeir, R. (2012). Minimizing user effort in XML grammar matching. Information Sciences, 210, 1-40. en_US
dc.author.email joe.tekli@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url http://www.sciencedirect.com/science/article/pii/S0020025512002903 en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account