2013Research Explorer (The University of Manchester)Requires access

The manipulation of schematic correspondences with the quantification of uncertainty in dataspaces

Lu Mao

Open publisher page 0 citations

Abstract

Dataspaces aim to remove upfront cost in the generation of the schema mappingsthat reconcile schematic heterogeneities, and to incrementally improve thegenerated mappings based on user feedback. The reconciliation of schematic heterogeneitiesis a crucial step for translating queries between a mediating schemaand data sources. The generation of schema mappings depends on the elicitationof conceptually equivalent schema constructs and information on schematic heterogeneities.Furthermore, many dataspace operations manipulate associationsbetween schemas, for example for generating a global schema to mediate userqueries. With a view to minimizing upfront costs associated with understandingthe relationships between schemas, many schema matching algorithms and toolshave been developed for postulating equivalent schema constructs. However, theyderive simple associations between schema constructs, and do not provide richinformation on schematic heterogeneities. Without manual refinement, the elicitationof conceptually equivalent schema constructs and schematic heterogeneitiesmay create uncertainties that must be managed.The schematic correspondences captures a wide range of one-to-one and manyto-many schematic heterogeneities. This thesis investigates the use of schematiccorrespondences as a central component in a dataspace management system. Tosupport query evaluation in a dataspace in which relationships between schemasare represented using schematic correspondences, we propose a mechanism forautomatically generating schema mappings from the schematic correspondences.We then characterise model management operators, which can underpin the bootstrapingand maintenance of dataspaces, over schematic correspondences. Tosupport the management of uncertainty in dataspaces, we propose techniques forquantifying uncertainty in the equivalence of schema constructs from evidence inthe form of similarity scores and user feedback, and provide a flexible frameworkfor incrementally updating the uncertainties in the light of new evidence.

About this research paper

What this paper is about

Dataspaces aim to remove upfront cost in the generation of the schema mappingsthat reconcile schematic heterogeneities, and to incrementally improve thegenerated mappings based on user feedback. The reconciliation of schematic heterogeneitiesis a crucial step for translating queries between a mediating schemaand data sources. The generation of schema mappings depends on the elicitationof conceptually equivalent schema constructs and information on schematic heterogeneities.Furthermore, many dataspace operations manipulate associationsbetween schemas, for example for generating a global schema to mediate userqueries. With a view to minimizing upfront costs associated with understandingthe relationships between schemas, many schema matching algorithms and toolshave been developed for postulating equivalent schema constructs. However, theyderive simple associations between schema constructs, and do not provide richinformation on schematic heterogeneities. Without manual refinement, the elicitationof conceptually equivalent schema constructs and schematic heterogeneitiesmay create uncertainties that must be managed.The schematic correspondences captures a wide range of one-to-one and manyto-many schematic heterogeneities. This thesis investigates the use of schematiccorrespondences as a central component in a dataspace management system. Tosupport query evaluation in a dataspace in which relationships between schemasare represented using schematic correspondences, we propose a mechanism forautomatically generating schema mappings from the schematic correspondences.We then characterise model management operators, which can underpin the bootstrapingand maintenance of dataspaces, over schematic correspondences. Tosupport the management of uncertainty in dataspaces, we propose techniques forquantifying uncertainty in the equivalence of schema constructs from evidence inthe form of similarity scores and user feedback, and provide a flexible frameworkfor incrementally updating the uncertainties in the light of new evidence.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Dataspaces aim to remove upfront cost in the generation of the schema mappingsthat reconcile schematic heterogeneities, and to incrementally improve thegenerated mappings based on user feedback. The reconciliation of schematic heterogeneitiesis a crucial step for translating queries between a mediating schemaand data sources. The generation of schema mappings depends on the elicitationof conceptually equivalent schema constructs and information on schematic heterogeneities.Furthermore, many dataspace operations manipulate associationsbetween schemas, for example for generating a global schema to mediate userqueries. With a view to minimizing upfront costs associated with understandingthe relationships between schemas, many schema matching algorithms and toolshave been developed for postulating equivalent schema constructs. However, theyderive simple associations between schema constructs, and do not provide richinformation on schematic heterogeneities. Without manual refinement, the elicitationof conceptually equivalent schema constructs and schematic heterogeneitiesmay create uncertainties that must be managed.The schematic correspondences captures a wide range of one-to-one and manyto-many schematic heterogeneities. This thesis investigates the use of schematiccorrespondences as a central component in a dataspace management system. Tosupport query evaluation in a dataspace in which relationships between schemasare represented using schematic correspondences, we propose a mechanism forautomatically generating schema mappings from the schematic correspondences.We then characterise model management operators, which can underpin the bootstrapingand maintenance of dataspaces, over schematic correspondences. Tosupport the management of uncertainty in dataspaces, we propose techniques forquantifying uncertainty in the equivalence of schema constructs from evidence inthe form of similarity scores and user feedback, and provide a flexible frameworkfor incrementally updating the uncertainties in the light of new evidence.

Key concepts: Schematic, Schema (genetic algorithms), Computer science, Information schema, Information retrieval, Database schema, Schema matching, Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
The manipulation of schematic correspondences with the quantification of uncertainty in dataspaces — Research Paper | ScholarLens