Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas. This paper presents a probabilistic framework, called sPLMap, for automatically learning schema mapping rules. Similar to LSD, different techniques, mostly from the IR field, are combined. Our approach, however, is also able to give a probabilistic interpretation of the prediction weights of the candidates, and to select the rule set with highest matching probability
We address the problem of automating the process of deciding whether two data schema ele-ments match...
Schema matching has been a researched topic for over 20 years. Therefore, many schema matching solut...
We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic model...
We propose a new declarative approach to schema mapping discovery, that is, the task of identifying ...
IEEE We propose a probabilistic approach to the problem of schema mapping. Our approach is declarati...
Schema matching is the problem of finding relationships among concepts across data sources that are ...
In data integration we transform information from a source into a target schema. A general problem i...
Schema matching is a critical problem for integrating heterogeneous information sources. Traditional...
Existing techniques for schema matching are classified as either schema-based, instance-based, or a ...
Schemas describe the data structures of various domains such as purchase order, conference, health a...
Schema matching is a critical problem for integrating heterogeneous information sources. Traditional...
Schema matching is a key task in several applications such as data integration and ontology enginee...
International audienceSchema matching is a key task in several applications such as data integratio...
Current speed of data growth has exponentially increased over the past decade, highlighting the need...
We propose a probabilistic approach to the problem of schema mapping. Our approach is declarative, s...
We address the problem of automating the process of deciding whether two data schema ele-ments match...
Schema matching has been a researched topic for over 20 years. Therefore, many schema matching solut...
We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic model...
We propose a new declarative approach to schema mapping discovery, that is, the task of identifying ...
IEEE We propose a probabilistic approach to the problem of schema mapping. Our approach is declarati...
Schema matching is the problem of finding relationships among concepts across data sources that are ...
In data integration we transform information from a source into a target schema. A general problem i...
Schema matching is a critical problem for integrating heterogeneous information sources. Traditional...
Existing techniques for schema matching are classified as either schema-based, instance-based, or a ...
Schemas describe the data structures of various domains such as purchase order, conference, health a...
Schema matching is a critical problem for integrating heterogeneous information sources. Traditional...
Schema matching is a key task in several applications such as data integration and ontology enginee...
International audienceSchema matching is a key task in several applications such as data integratio...
Current speed of data growth has exponentially increased over the past decade, highlighting the need...
We propose a probabilistic approach to the problem of schema mapping. Our approach is declarative, s...
We address the problem of automating the process of deciding whether two data schema ele-ments match...
Schema matching has been a researched topic for over 20 years. Therefore, many schema matching solut...
We propose the Schema-Model Framework, which characterizes algorithms that learn probabilistic model...