Abstract: Described is programmatic access to persistent XML and relational data from applications based upon explicit mappings between object classes, XML schema types, and relations. The mappings are used in data access, that is, they drive query and update processing. A query may be processed into a query for accessing the XML data and another query for second type for accessing the relational data. Mappings support strongly-typed classes and loosely-typed classes, and may be conditional upon other data, may decouple query and update translation performed at runtime from schema translation used at compile time, and/or may be compiled into transformations that produce objects from XML data and transformations that produce XML data from objects. Mappings may be generated automatically or provided by the developer.

Abstract: A general-purpose reusable algebraic-based composition algorithm for composing mappings between data schemas. The algorithm handles more expressive mappings, makes a best-effort to eliminate symbols when a perfect answer cannot be obtained, includes new heuristics, and is extensible. A relational algebraic language is provided wherein each mapping is expressed as a set of constraints, and each constraint is either a containment or equality of two or more relational algebraic expressions. The composition mechanism exploits monotonicity properties of algebraic operators in operator arguments, handles NULLs and bag semantics, operates to allow composition to produce a partial result when a complete result is not possible, facilitates symbols elimination one symbol at a time using left composition, for example, as a way of isolating the symbols, supports making a best-effort to eliminate as many symbols as possible from an intermediate schema, and handles unknown or partially known operators via delayed handling.

Abstract: A system and method facilitating data access operations is provided. The system can facilitate an executable, instance-level interaction between a source model (e.g., schema) expressed in a first metamodel (e.g., object-oriented metamodel) and a target model expressed in a second metamodel (e.g., SQL metamodel). The system can produce instance mappings to round-trip the data between the source schema and the generated target schema. Further, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.

Abstract: A database update pipeline may be incorporated into a data access architecture for providing data services to applications, thereby bridging the gap between application data and data as persisted in databases. The update pipeline has the ability to translate changes made to object instances into data store change constructs, and carry those changes over to a data store. Such a pipeline can also advantageously perform the reverse operation, allowing applications to query using the database update pipeline, and receive materialized object instances.

Abstract: A data processing and storage system is provided. The system includes an aggregator component that stores metadata from at least two disparate data domains. A framework component encapsulates the metadata according to an abstraction model that describes the disparate data domains.

Abstract: A general-purpose reusable algebraic-based composition algorithm for composing mappings between data schemas. The algorithm handles more expressive mappings, makes a best-effort to eliminate symbols when a perfect answer cannot be obtained, includes new heuristics, and is extensible. A relational algebraic language is provided wherein each mapping is expressed as a set of constraints, and each constraint is either a containment or equality of two or more relational algebraic expressions. The composition mechanism exploits monotonicity properties of algebraic operators in operator arguments, handles NULLs and bag semantics, operates to allow composition to produce a partial result when a complete result is not possible, facilitates symbols elimination one symbol at a time using left composition, for example, as a way of isolating the symbols, supports making a best-effort to eliminate as many symbols as possible from an intermediate schema, and handles unknown or partially known operators via delayed handling.

Abstract: A data access architecture is provided that includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. The mapping architecture makes use of two types of mapping views—a query view that helps in translating queries and an update view that helps in translating updates. Incremental view maintenance can be used to translate data between the application and database.

Abstract: A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.

Abstract: A system that automatically matches schema elements is provided. In one aspect, given a selected element of one schema, the system can calculate the best matching candidate elements of another schema. The calculation can be based on a heuristic combination of factors, such as element names, element types, schema structure, existing matches, and the history of actions taken by the user. Accordingly, the best candidate (according to the calculation) can be emphasized and/or highlighted. The tool can auto-scroll to the best choice. Similarly, the user can request the calculation and display to best candidates by pressing a keyboard key or hot key. As well, the user can prompt display of the best candidates by using the mouse (e.g., moving the mouse over the element E or clicking on E), or both (e.g., mouse over with hot key depressed).

Abstract: A system and method facilitating data access operations is provided. The system can facilitate an executable, instance-level interaction between a source model (e.g., schema) expressed in a first metamodel (e.g., object-oriented metamodel) and a target model expressed in a second metamodel (e.g., SQL metamodel). The system can produce instance mappings to round-trip the data between the source schema and the generated target schema. For example, the system can support object-to-relational mapping scenarios that are common in business applications. Typically, in such applications the business logic runs on top of an object model, whereas the actual data is persisted in SQL databases. To shield the applications from impedance mismatch and storage management issues, an abstraction component can be employed to translate the data access operations on the object model into SQL queries and updates.

Abstract: Systems and methodologies that facilitate evolving a data model via a combination of an explicit logical model definition, logical model changes, functional units, an explicit/implicit physical model and physical model changes, to derive a data model transformation. Such an arrangement can provide for a rich set of transformations, which can be automatically applied to a data model instantiation. The subject invention enables leveraging a common set of code, by defining the set of transformations across an arbitrary data model.

Abstract: A system that facilitates composition of schema mappings. A general algorithm is provided for composing a broad class of mappings, where one or both mappings are not functions, such as constraints between two schemas and the inverse of functions. A composition component performs composition on schema mappings of disparate data sources, which schema mappings can be expressed by at least one of full, embedded, and second-order dependencies, wherein the second-order dependencies need not be in source-to-target form. The algorithm for composition further includes a procedure that tests whether the composition algorithm will terminate.