Patent application number | Description | Published |
20080235260 | SCALABLE ALGORITHMS FOR MAPPING-BASED XML TRANSFORMATION - A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged. | 09-25-2008 |
20080243765 | METHOD FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM - A method for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. | 10-02-2008 |
20080243772 | METHOD AND SYTSEM FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM AND FOR GENERATING TRANSFORMATION QUERIES BASED THEREON - A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification. | 10-02-2008 |
20080256124 | SCHEMA MAPPING SPECIFICATION FRAMEWORK - A method, system and program product for specifying, in a schema mapping framework, a mapping between a source schema and a target schema. The source and target schemas are schemas included in respective groups of registered, heterogeneous schemas. The source and target schemas may be of different types. Serialized versions of the source and target schemas include source objects and target objects, respectively. A mapping model is serialized into mapping objects that include logical references representing the source objects and logical references representing the target objects. The logical references are resolved to the source objects and target objects, thereby storing pointers to the source objects and to the target objects. After resolving the logical references, the mapping model includes the logical references and the pointers to the source and target objects. | 10-16-2008 |
20080275907 | SCALABLE ALGORITHMS FOR MAPPING-BASED XML TRANSFORMATION - A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged. | 11-06-2008 |
20090177672 | QUASI-INVERSES OF SCHEMA MAPPINGS - A method and system for processing a schema mapping M from a source schema S to a target schema T by executing program code on a processor of a computer system. A schema mapping M′ from T to S is determined via processing the schema mapping M. The schema mapping M includes at least one constraint σ. Each constraint σ consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M′ includes at least one constraint σ′. Each constraint σ′ consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M′ is stored in at least one computer usable storage device of the computer system and/or is outputted in at least one output device of the computer system. | 07-09-2009 |
20090177681 | QUASI-INVERSES OF SCHEMA MAPPINGS - A method and system for processing a schema mapping M from a source schema S to a target schema T by executing program code on a processor of a computer system. A schema mapping M′ from T to S is determined via processing the schema mapping M. The schema mapping M includes at least one constraint σ. Each constraint σ consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M′ includes at least one constraint σ′. Each constraint σ′ consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M′ is stored in at least one computer usable storage device of the computer system and/or is outputted in at least one output device of the computer system. | 07-09-2009 |
20100049728 | INTERACTIVE GENERATION OF INTEGRATED SCHEMAS - Methods, systems and computer program products for interactive generation of integrated schemas. Exemplary embodiments include a method for schema integration, the method including recasting a first source schema into a first graph of concepts with HasA relationships, recasting a second source schema into a second graph of concepts with HasA relationships, identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs, producing an integrated schema, based on a fixed specification of matching concepts to merge, and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema. | 02-25-2010 |
20130091184 | CORRELATING INDEPENDENT SCHEMA MAPPINGS - Embodiments of the invention relate to correlating schema mappings. In one embodiment, a set of schema mappings over a source schema and a target schema are received. Each of the schema mappings is decomposed into a basic schema mapping. A first set and second set of relations re determined for the source schema and the target schema, respectively. Each relation in the first set of relations is paired to at least one relation in the second set of relations. The pairing forms multiple relation pairs between the first set and second of relations in the form of (T, T′), where T is a source portion of a relation pair and T′ is a target portion of the relation pair. A set of basic schema mappings is identified that matches the relation pair. Each basic schema mapping is merged into a single schema mapping. | 04-11-2013 |
20140337331 | Methods and Systems for Discovery of Linkage Points Between Data Sources - Data records are linked across a plurality of datasets. Each dataset contains at least one data record, and each data record is associated with an entity and includes one or more attributes of that entity and a value for each attribute. Values associated with attributes are compared across datasets, and matching attributes having values that satisfy a predetermined similarity threshold are identified. In addition, linkage points between pairs of datasets are identified. Each linkage point links one or more pairs of data records. Each data record in the pair of data records is contained in one of a given pair of datasets, and each pair of data records is associated with a common entity having matching attributes in the given pair of datasets. Data records associated with the common entities are linked across datasets using the identified linkage points. | 11-13-2014 |
20140358932 | Entity Integration Using High-Level Scripting Languages - Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration. | 12-04-2014 |