FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2020228538> ?p ?o ?g. }

• W2020228538 abstract "A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). Schema mappings play a key role in numerous areas of database systems, including database design, information integration, and model management. A fundamental problem in this context is composing schema mappings: given two successive schema mappings, derive a schema mapping between the source schema of the first and the target schema of the second that has the same effect as applying successively the two schema mappings.In this paper, we give a rigorous semantics to the composition of schema mappings and investigate the definability and computational complexity of the composition of two schema mappings. We first study the important case of schema mappings in which the specification is given by a finite set of source-to-target tuple-generating dependencies (source-to-target tgds). We show that the composition of a finite set of full source-to-target tgds with a finite set of tgds is always definable by a finite set of source-to-target tgds, but the composition of a finite set of source-to-target tgds with a finite set of full source-to-target tgds may not be definable by any set (finite or infinite) of source-to-target tgds; furthermore, it may not be definable by any formula of least fixed-point logic, and the associated composition query may be NP-complete. After this, we introduce a class of existential second-order formulas with function symbols, which we call second-order tgds, and make a case that they are the right language for composing schema mappings. To this effect, we show that the composition of finite sets of source-to-target tgds is always definable by a second-order tgd. Moreover, the composition of second-order tgds is also definable by a second-order tgd. Our second-order tgds allow equalities, even though the obvious way to define them does not require equalities. Allowing equalities in second-order tgds turns out to be of the essence, because we show that second-order tgds without equalities are not sufficiently expressive to define even the composition of finite sets of source-to-target tgds. Finally, we show that second-order tgds possess good properties for data exchange. In particular. the chase procedure can be extended to second-order tgds so that it produces polynomial-time computable universal solutions in data exchange settings specified by second-order tgds." @default.
• W2020228538 created "2016-06-24" @default.
• W2020228538 creator A5026007789 @default.
• W2020228538 creator A5027117465 @default.
• W2020228538 creator A5041152581 @default.
• W2020228538 creator A5041825861 @default.
• W2020228538 date "2004-06-14" @default.
• W2020228538 modified "2023-10-17" @default.
• W2020228538 title "Composing schema mappings" @default.
• W2020228538 cites W1970318994 @default.
• W2020228538 cites W1980103601 @default.
• W2020228538 cites W1984890936 @default.
• W2020228538 cites W1992673035 @default.
• W2020228538 cites W2028222220 @default.
• W2020228538 cites W2152293830 @default.
• W2020228538 cites W2160983447 @default.
• W2020228538 cites W2171094216 @default.
• W2020228538 cites W4236835455 @default.
• W2020228538 cites W4252098605 @default.
• W2020228538 doi "https://doi.org/10.1145/1055558.1055572" @default.
• W2020228538 hasPublicationYear "2004" @default.
• W2020228538 type Work @default.
• W2020228538 sameAs 2020228538 @default.
• W2020228538 citedByCount "158" @default.
• W2020228538 countsByYear W20202285382012 @default.
• W2020228538 countsByYear W20202285382013 @default.
• W2020228538 countsByYear W20202285382014 @default.
• W2020228538 countsByYear W20202285382015 @default.
• W2020228538 countsByYear W20202285382016 @default.
• W2020228538 countsByYear W20202285382017 @default.
• W2020228538 countsByYear W20202285382018 @default.
• W2020228538 countsByYear W20202285382019 @default.
• W2020228538 countsByYear W20202285382021 @default.
• W2020228538 crossrefType "proceedings-article" @default.
• W2020228538 hasAuthorship W2020228538A5026007789 @default.
• W2020228538 hasAuthorship W2020228538A5027117465 @default.
• W2020228538 hasAuthorship W2020228538A5041152581 @default.
• W2020228538 hasAuthorship W2020228538A5041825861 @default.
• W2020228538 hasConcept C199360897 @default.
• W2020228538 hasConcept C23123220 @default.
• W2020228538 hasConcept C41008148 @default.
• W2020228538 hasConcept C52146309 @default.
• W2020228538 hasConceptScore W2020228538C199360897 @default.
• W2020228538 hasConceptScore W2020228538C23123220 @default.
• W2020228538 hasConceptScore W2020228538C41008148 @default.
• W2020228538 hasConceptScore W2020228538C52146309 @default.
• W2020228538 hasLocation W20202285381 @default.
• W2020228538 hasOpenAccess W2020228538 @default.
• W2020228538 hasPrimaryLocation W20202285381 @default.
• W2020228538 hasRelatedWork W2013111119 @default.
• W2020228538 hasRelatedWork W2047793074 @default.
• W2020228538 hasRelatedWork W2112962394 @default.
• W2020228538 hasRelatedWork W2118300983 @default.
• W2020228538 hasRelatedWork W2382501300 @default.
• W2020228538 hasRelatedWork W3137189469 @default.
• W2020228538 hasRelatedWork W3162240892 @default.
• W2020228538 hasRelatedWork W4235530921 @default.
• W2020228538 hasRelatedWork W4243252198 @default.
• W2020228538 hasRelatedWork W4245713008 @default.
• W2020228538 isParatext "false" @default.
• W2020228538 isRetracted "false" @default.
• W2020228538 magId "2020228538" @default.
• W2020228538 workType "article" @default.