that are consistent with the semantics of the changed schemas. Our approach explicitly models mapping choices made by a user and maintains these choices, whenever possible, as the schemas and mappings evolve. When there is more than one candidate rewriting, the algorithm may rank them based on how close

for relational and XML schemas with choice types and (nested) constraints. Our algorithm detects mappings affected by a structural or constraint change and generates all the rewritings that are consistent with the semantics of the mapped schemas. Our approach explicitly models mapping choices made by a user

. We show that the problem is tractable for expressive schema mappings and simple queries, but not vice versa. Then we move to static analysis. We study the complexity of the consistency problem, i.e., deciding whether it is possible to map some document of a source schema into a document of the target

legacy queries and updates under schema and integrity constraints evolution. The PRISM/PRISM++ approach consists in providing the users with a set of SQL-based Schema Modification Opera-tors (SMOs), which describe how the tables in the old schema are modified into those in the new schema. In order to sup

XML schema mappings have been developed and studied in the context of XML data exchange, where a source document has to be restructured under the target schema according to certain rules. The rules are specified with a mapping, which consists of a set of source-to-target dependencies based on tree

), (like: auto/car). Thus, we proposed a new approach to avoid such a problem by studying the context of the term. Within the framework of the mapping of elements of schema, the context of an element can represent the under-trees of an element (context descendent), key words characterizing it, etc. In our

engineering. It replaces/subsumes the technological paradigm of the Industrial Age, organized primarily around the production and distribution of energy. In this article I aim at clarifying the theoretical implications that can be induced from my observation of contemporary social structures and social change

. Our approach finds mappings in a completely automated fashion. Because it does not require training data, it is scalable: not only can it be used to find mappings between many language pairs, but it is also ef-fective for languages that are under-represented and lack sufficient training samples

. Our approach finds mappings in a completely automated fashion. Because it does not require training data, it is scalable: not only can it be used to find mappings between many language pairs, but it is also effective for languages that are under-represented and lack sufficient training samples

relationships between schema versions, relationships among attributes, and the conditions for maintaining consistent views of programs. In this paper, we demonstrate the mapping of the EVER diagram into an underlying database and the construction of database views for schema versions. Through the reconstruction