1. A system that facilitates data mapping, comprising: a processor that executes the following computer executable components stored on a computer readable medium: a composition component that composes input schema mappings using a deductive procedure to obtain a finite axiomatization of all constraints that appear in the composition mapping and outputs a resulting schema mapping derived from the input schema mappings and that specifies a same set of constraints given by the input schema mappings to support data transformation and exchange for data warehousing, where data is received from many different sources for storage and access, and where the different sources are defined as a wired or a wireless network; wherein the deductive procedure is concurrently performed on all constraints present in the input schema mappings when composing a sequence of three or more mappings, and wherein one or both of the input schema mappings are not functions, such as constraints between two schemas and the inverse of functions; wherein the axiomatization includes a finite second-order axiomatization that is de-Skolemized to obtain a schema mapping expressed by first-order constraints; and the de-Skolemized finite second-order axiomatization comprises unnested second-order dependencies; wherein the input schema mappings expressed by embedded dependencies are Skolemized to obtain intermediate schema mappings expressed by second-order dependencies and a finite axiomatization is computed of all constraints over input and output signatures which are deduced from constraints that give the intermediate schema mappings; and wherein a check is performed to determine if a constraint of a form φ(z), R(y)→R(x) appears in the finite axiomatization, such that, φ(z) is a conjunction of atoms over S 1 ∪S 3 ; there is no atom R(w) in φ(z) with {x} ⊂ {w}; {x}is not a subset of {y}; and R is a relation symbol in the schema S 2 .