An Optimization Approach for Semantic-based XML Schema Matching
نویسندگان
چکیده
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملan improved semantic schema matching approach
schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...
متن کاملSemantic-based Optimal XML Schema Matching: A Mathematical Programming Approach
We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartit...
متن کاملIterative Schema-based Semantic Matching
An ontology typically provides a vocabulary that describes a domain of interest and a specification of the meaning of terms used in the vocabulary. Depending on the precision of this specification, the notion of ontology encompasses several data and conceptual models, for example, classifications, database schemas, fully axiomatized theories. Ontologies tend to be put everywhere. They are viewe...
متن کاملEffective Schema-Based XML Query Optimization Techniques
Use of path expressions is a common feature in most XML query languages, and many evaluation methods for path expression queries have been proposed recently. However, there are few researches on the issue of optimizing regular path expression queries. In this paper, two kinds of path expression optimization principles are proposed, named path shortening and path complementing, respectively. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Trade, Economics and Finance
سال: 2011
ISSN: 2010-023X
DOI: 10.7763/ijtef.2011.v2.82