Repository logo

Tabular Representation of Schema Mappings: Semantics and Algorithms

dc.contributor.authorRahman, Md. Anisur
dc.contributor.supervisorKiringa, Iluzu
dc.contributor.supervisorEl Saddik, Abdulmotaleb
dc.date.accessioned2011-05-27T14:51:11Z
dc.date.available2011-05-27T14:51:11Z
dc.date.created2011
dc.date.issued2011
dc.degree.disciplineGénie / Engineering
dc.degree.leveldoctorate
dc.degree.namephd
dc.description.abstractOur thesis investigates a mechanism for representing schema mapping by tabular forms and checking utility of the new representation. Schema mapping is a high-level specification that describes the relationship between two database schemas. Schema mappings constitute essential building blocks of data integration, data exchange and peer-to-peer data sharing systems. Global-and-local-as-view (GLAV) is one of the approaches for specifying the schema mappings. Tableaux are used for expressing queries and functional dependencies on a single database in a tabular form. In our thesis, we first introduce a tabular representation of GLAV mappings. We find that this tabular representation helps to solve many mapping-related algorithmic and semantic problems. For example, a well-known problem is to find the minimal instance of the target schema for a given instance of the source schema and a set of mappings between the source and the target schema. Second, we show that our proposed tabular mapping can be used as an operator on an instance of the source schema to produce an instance of the target schema which is `minimal' and `most general' in nature. There exists a tableaux-based mechanism for finding equivalence of two queries. Third, we extend that mechanism for deducing equivalence between two schema mappings using their corresponding tabular representations. Sometimes, there exist redundant conjuncts in a schema mapping which causes data exchange, data integration and data sharing operations more time consuming. Fourth, we present an algorithm that utilizes the tabular representations for reducing number of constraints in the schema mappings. At present, either schema-level mappings or data-level mappings are used for data sharing purposes. Fifth, we introduce and give the semantics of bi-level mapping that combines the schema-level and data-level mappings. We also show that bi-level mappings are more effective for data sharing systems. Finally, we implemented our algorithms and developed a software prototype to evaluate our proposed strategies.
dc.embargo.termsimmediate
dc.faculty.departmentOttawa-Carleton Institute of Computer Science
dc.identifier.urihttp://hdl.handle.net/10393/20032
dc.identifier.urihttp://dx.doi.org/10.20381/ruor-4622
dc.language.isoen
dc.publisherUniversité d'Ottawa / University of Ottawa
dc.subjectSchema Mapping
dc.subjectTableaux
dc.subjectData Integration
dc.subjectData Exchange
dc.subjectOptimization
dc.titleTabular Representation of Schema Mappings: Semantics and Algorithms
dc.typeThesis
thesis.degree.disciplineGénie / Engineering
thesis.degree.levelDoctoral
thesis.degree.namephd
uottawa.departmentOttawa-Carleton Institute of Computer Science

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail ImageThumbnail Image
Name:
Rahman_Md_Anisur_2011_thesis.pdf
Size:
1.09 MB
Format:
Adobe Portable Document Format
Description:
Ph.D. Thesis of Md. Anisur Rahman (SId# 3558643)

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail ImageThumbnail Image
Name:
license.txt
Size:
4.21 KB
Format:
Item-specific license agreed upon to submission
Description: