Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleCapturing both Types and Constraints in Data Integration
dc.contributor.authorBenedikt, M.
dc.contributor.authorChan, C.-Y.
dc.contributor.authorFan, W.
dc.contributor.authorFreire, J.
dc.contributor.authorRastogi, R.
dc.identifier.citationBenedikt, M.,Chan, C.-Y.,Fan, W.,Freire, J.,Rastogi, R. (2003). Capturing both Types and Constraints in Data Integration. Proceedings of the ACM SIGMOD International Conference on Management of Data : 277-288. ScholarBank@NUS Repository.
dc.description.abstractWe propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The framework is based on a specification language, AIG, that extends a DTD by (1) associating element types with semantic attributes (inherited and synthesized, inspired by the corresponding notions from Attribute Grammars), (2) computing these attributes via parameterized SQL queries over multiple data sources, and (3) incorporating XML keys and inclusion constraints. The novelty of AIG consists in semantic attributes and their dependency relations for controlling context-dependent, DTD-directed construction of XML documents, as well as for checking XML constraints in parallel with document-generation. We also present cost-based optimization techniques for efficiently evaluating AIGs, including algorithms for merging queries and for scheduling queries on multiple data sources. This provides a new grammar-based approach for data integration under both syntactic and semantic constraints.
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings of the ACM SIGMOD International Conference on Management of Data
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 13, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.