Interactive example-driven integration and reconciliation for accessing database federations

Sattler, Kai-Uwe; Conrad, Stefan; Saake, Gunter

doi:10.1016/s0306-4379(02)00023-6

Cited by 15 publications

(12 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such as, aspect-oriented programming (Bergmans, 2003), database (Sattler et al, 2003;Sudha and Jinsoo, 2004), model-based development (Reiter and Altmanninger, 2007), Web services (Nagarajan et al, 2006;Nagarajan and Verma, 2007;Ying et al, 2008;Li et al, 2009) and so on.…”

Section: Related Workmentioning

confidence: 99%

Semantic Conflicts Detection of Heterogeneous Messages of Web Services: Challenges and Solution

Al-Baltah

Ghani

Rahman

et al. 2014

Journal of Computer Science

View full text Add to dashboard Cite

Service Oriented Architecture (SOA) is a new design style that has promised to alleviate the semantic interoperability problem between Web services. Exchanging the messages seamlessly between heterogeneous Web services is required but, it is still difficult due to data heterogeneity. As a result, a noticeable number of works has been proposed with the aim of solving this problem, but yet, the problem has not been solved efficiently. Furthermore, it is important to observe the lack of sufficient approaches in the state of the art, whose purposes are semantic conflicts detection between heterogeneous messages of Web services. It is for these reasons we take a step back to the detection step before providing the solution. This study proposes a new ontology-based approach that aim at detecting semantic conflicts between heterogeneous messages of Web services. The main purposes of this approach are to detect any conflict types between the messages during message exchange process and to identify the conflict type for each detected conflict. The proposed approach plays as a vital step for improving the semantic interoperability between heterogeneous Web service messages, since it facilitate the process of addressing semantic conflicts. A real scenario was used in order to demonstrate the feasibility of the proposed approach.

show abstract

Section: Related Workmentioning

confidence: 99%

Semantic Conflicts Detection of Heterogeneous Messages of Web Services: Challenges and Solution

Al-Baltah

Ghani

Rahman

et al. 2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Sattler et al [50] developed VIbE, a system that assists designers in information integration tasks by providing them with the means for querying data sources using query-by-example (QBE) style queries. In the light of the specification of such queries and the results they retrieve, the designer specifies the mappings that reconcile the heterogeneities between data sources.…”

Section: Authoring Integration Queries Over Dataspacesmentioning

confidence: 99%

Incrementally improving dataspaces based on user feedback

Belhajjame

Paton

Embury

et al. 2013

Information Systems

View full text Add to dashboard Cite

One aspect of the vision of dataspaces has been articulated as providing various benefits of classical data integration with reduced up-front costs. In this paper, we present techniques that aim to support schema mapping specification through interaction with end users in a pay-as-you-go fashion. In particular, we show how schema mappings, that are obtained automatically using existing matching and mapping generation techniques, can be annotated with metrics estimating their fitness to user requirements using feedback on query results obtained from end users.Using the annotations computed on the basis of user feedback, and given user requirements in terms of precision and recall, we present a method for selecting the set of mappings that produce results meeting the stated requirements. In doing so, we cast mapping selection as an optimization problem. Feedback may reveal that the quality of schema mappings is poor. We show how mapping annotations can be used to support the derivation of better quality mappings from existing mappings through refinement. An evolutionary algorithm is used to efficiently and effectively explore the large space of mappings that can be obtained through refinement.User feedback can also be used to annotate the results of the queries that the user poses against an integration schema. We show how estimates for precision and recall can be computed for such queries. We also investigate the problem of propagating feedback about the results of (integration) queries down to the mappings used to populate the base relations in the integration schema.

show abstract

“…Conflict resolution has been studied for data integration (e.g., [18][19][20]) and uncertain data (e.g., [21,22]). There has also been a host of work on record matching (see [23] for a survey).…”

Section: Related Workmentioning

confidence: 99%

Polymorphic queries for P2P systems

Liu

Fan

2011

Information Systems

View full text Add to dashboard Cite

a b s t r a c tWhen a query is posed on a centralized database, if it refers to attributes that are not defined in the database, the user is warranted to get either an error or an empty set. In contrast, when a query is posed on a peer in a P2P system and refers to attributes not found in the local database, the query should not be simply rejected if the relevant information is available at other peers. This paper proposes a query model for unstructured P2P systems to answer such queries. (a) We introduce a class of polymorphic queries, a revision of conjunctive queries by incorporating type variables to accommodate attributes not defined in the local database. (b) We define the semantics of polymorphic queries in terms of horizontal and vertical object expansions, to find attributes and tuples, respectively, missing from the local database. We show that both expansions can be conducted in a uniform framework. (c) We develop a top-K algorithm to approximately answer polymorphic queries. (d) We also provide a method to merge tuples collected from various peers, based on matching keys specified in polymorphic queries. Our experimental study verifies that polymorphic queries are able to find more sensible information than traditional queries supported by P2P systems, and that these queries can be evaluated efficiently.

show abstract

Interactive example-driven integration and reconciliation for accessing database federations

Cited by 15 publications

References 43 publications

Semantic Conflicts Detection of Heterogeneous Messages of Web Services: Challenges and Solution

Semantic Conflicts Detection of Heterogeneous Messages of Web Services: Challenges and Solution

Incrementally improving dataspaces based on user feedback

Polymorphic queries for P2P systems

Contact Info

Product

Resources

About