71 results about "Schema mapping" patented technology

A method and system for persisting an object in a relational database schema by creating a new relational table at application program run-time for each class of objects to be persisted. The method may generate a schema map object for each class of objects to be persisted. The schema map object may be generated in response to the first transaction in which an object of a certain class is to be persisted and remains in memory for persisting, querying, restoring or deleting objects of that class. The schema map object determines the fields of each class of objects to be persisted, defines one or more columns in the table in accordance with the data types of the fields, and controls the passing of data between the table and the object fields.

A method for compiling a mapping between a source schema and a target schema is provided. The method comprises multiple passes, including determining source node dependencies, matching hierarchy, and generating code. The method may further comprise initializing node dependency memory prior to determining source node dependencies, and freeing node dependency memory after code generation. The compiler algorithm provides for compiling user-defined functions in the mapping into the compiled representation. Another aspect of the invention provides for generating an XSL code representation of the mapping. An XSL style sheet representation may thus be generated from a visual mapping in accordance with the invention.

A computer program product is provided that uses data examples as a basis for understanding and refining declarative schema mappings. The system of the present invention identifies a set of intuitive operators for manipulating examples including establishing value correspondences, data linking, data trimming, data walking, and data chasing. These operators allow a user to follow and refine an example by walking through a data source. In addition, these operators can identify a large class of schema mappings and distinguish effectively between alternative schema mappings. With these operators, a user is able to quickly and intuitively build and refine complex data transformation queries that map one data source into another while continuously verifying that the mapping is accurate and appropriate.

A method, system, and computer product is presented for mapping a set of patterns into an m-dimensional space so as to preserve relationships that may exist between these patterns. A subset of the input patterns is chosen and mapped into the m-dimensional space using an iterative nonlinear mapping process based on subset refinements. A set of n attributes are determined for each pattern, and one or more neural networks or other supervised machine learning techniques are then trained in accordance with the mapping produced by the iterative process. Additional input patterns not in the subset are mapped into the m-dimensional space by determining their n input attributes and using the neural networks in a feed-forward (prediction) mode.

Graphical mapping interface embodiments and method are provided for creating and displaying a schema map, which may be used by a data transformation system to perform a data transformation between at least one source schema and at least one target schema. According to one embodiment, the graphical mapping interface may comprise a source schema region for displaying a graphical representation of at least one source schema, a target schema region for displaying a graphical representation of at least one target schema, and a mapping region for displaying graphical representations of a plurality of links connecting the source nodes displayed in the source schema region to the target nodes displayed in the target schema region. The plurality of links may comprise at least one control link having at least one ECA rule associated therewith and at least one data link having at least one textual-based target field expression associated therewith.

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.

A data integration system (100, 10-14) comprises a plurality of data sources (10-14) and a mapping system (120, 121, 122, 125, 126, 127, 128) for providing mapping between the data sources (10-14) and a global ontology. The global ontology comprises a plurality of elements including at least a plurality of concepts, at least some of which include one or more attributes. The data integration system further comprises a user interface (110). The user interface (110) is operable in use to provide an integrated, global view of the data contained in the data sources (10-14) and to permit a user to interact with the data sources (10-14) using the global ontology. The mapping system (120) includes a schema mapping portion (122) and a semantic identifier portion (127), wherein the schema mapping portion (127) includes a plurality of single data source element mappings each of which specifies how one or more elements from a single data source map to one or more elements of the global ontology, and the semantic identifier portion (127) comprises a plurality of semantic identifiers each of which is operable to specify in terms of the global ontology how to identify and merge duplicate rough instances of concepts of the global ontology derived from queries to the possibly heterogeneous data sources, which duplicate rough instances represent the same actual instances.

An end-to-end data curation system and the various methods used in linking, matching, and cleaning large-scale data sources. The goal of this system is to provide scalable and efficient record deduplication. The system uses a crowd of experts to train the system. The system operator can optionally provide a set of hints to reduce the number of questions send to the experts. The system solves the problem of schema mapping and record deduplication a holistic way by unifying these problems into a unified linkage problem.

A system of translating a first schema of data having one structure or semantics into a second schema of data having a second structure or semantics by using a computer-implemented ontology deconstruction and reconstruction transfer mechanism which automatically creates an ‘interlanguage’ document type definition (interlanguage DTD) in which the interlanguage DTD automatically manages the structure and semantics of the structure and semantics of data to allow an automatic interlanguage definition of the first schema and translation into the second schema by the transfer mechanism. Such use can be in the publishing industry to translate data from any one of a number of key XML-based schemas such as DocBook, HTML4, Open eBook, Digital Talking Book, ONIX, MARC, etc to another of such schemas. The system can also be used to translate queries made on documents in the interlanguage DTD as queries on any of the schemas mapped to that interlanguage DTD.

Method, system, and article of manufacture for assembling a compound document according to a collection of domain-specific rules. For example, a content management system (CMS) may be configured to process the domain-specific compound document according to domain-specific schema and rules (e.g., an XML schema and DTD), while at the same time, maintaining the compound document in a generic form according to a generic schema for a compound document format used by the CMS.

Methods and apparatus are provided for improved schema mapping of source documents to target documents. A list of matches are generated between at least one source table and at least one target table. One or more of the matches are annotated with a logical condition providing a context in which the match applies. Matches can be annotated with a logical condition, for example, by generating a set of candidate view conditions, C, to be applied to the one or more source tables. A schema match algorithm can generate the list of matches. Candidate logical conditions can be identified, for example, by (i) creating a set of views for categorical attributes in the tables and adding a view for each partitioning of the attribute values; (ii) using a classifier built on target attribute values; or (iii) evaluating internal features of a source table.

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.

A system and method of use resolves the frustration of repeated manual work during schema mapping. The system utilizes a transformation graph—a collection of nodes (unified attributes) and edges (transformations) in which source attributes are mapped and transformed. The system further leverages existing mappings and transformations for the purpose of suggesting to a user the optimal paths (i.e., the lowest cost paths) for mapping new sources, which is particularly useful when new sources share similarity with previously mapped sources and require the same transformations. As such, the system also promotes an evolving schema by allowing users to select which unified attributes they want to include in a target schema at any time. The system addresses the technical challenge of finding optimal transformation paths and how to present these to the user for evaluation.

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.

A method for automatic generation of schema mapping application code. The method includes loading a code generation tool with source and target schemas. The method further includes defining the mapping specification between the source and the target. The method proceeds by triggering the code generation tool. Afterwards, the method proceeds by compiling the generated code. Furthermore, the method includes executing the generated code to transform input data files.

Described herein are systems and methods for importing and retrieving schema mappings while preserving privacy and confidentiality so that existing mappings can be reused across different customers without allowing reverse engineering of the original schemas. The disclosed embodiments provide different levels of mapping anonymity and correspondingly, available structural information in the retrieved mappings, in accordance with the security and privacy requirements.

Systems and methods are disclosed herein for generating a normalized record from an import record, the normalized record having attribute-value pairs corresponding to a native schema. In import records, a plurality of attribute-value are identified each having an attribute label not found in a native schema. One or more attribute labels in the native schema having as possible values one or more values corresponding to the values of the plurality of attribute-value pairs are also identified. The computer system generates one or more normalization rules relating one or more attribute labels of the plurality of attribute-value pairs to at least a portion of the one or more attribute labels in the native schema. Normalization rules may be validated by crowdsourcing. Normalization rules may be applied by identifying implicated rules by classifying the import record and identifying rules applicable to the classification.

Managed Inter Application Communications and Relationships (MIAC) is a system for business process automation that uses recognised standard application programming interfaces (API), data base schema mapping and raw data to collect, translate and transfer data to facilitate processes that incorporate data transfers, communications, event creations, alerts and physical inputs to build an end-to-end work flow where all actions and communications are recorded for audit and automated feedback response cycles. The system allows for an incremental build of a matrix computer network where all connected systems are separated but communicate in an intelligent rule and workflow driven process, controlled and influenced by the human workforce.

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.

A method and system 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.

An aspect of handling a plurality of simulated models includes receiving from a first simulation model a stream of source data and determining data processing compatibility between the the simulation model and a second-simulation model by i) obtaining metadata relating to the first-simulation models from a memory and ii) obtaining metadata relating to the second simulation model from the memory. An aspect also includes generating a transformation component using a schema mapping tool for providing compatibility between the first and second simulation models upon a determination that the compatibility does not exist between the two models. The—transformation component is generated—using the metadata relating to the first and second simulation models. The method also includes generating a—stream of target data by the second simulation model via the transformation component. The second simulation model uses the stream of source data as input.

Embodiments of the disclosed technology provide a system and method for automatically filling paper form with electronic data. The system receives from a user a scanned image of a paper form that includes a plurality of fields. The system then retrieves a schema map that maps the plurality of fields in the paper form to a plurality of fields in an electronic data record associated with the user. Next, the system retrieves data values of the fields in the electronic data record based on the schema map. The system also synthesizes the retrieved data values and the scanned image to create an image of the paper form in which the fields are filled with the retrieved data values.

A system of translating a first schema of data having one structure or semantics into a second schema of data having a second structure or semantics by using a computer-implemented ontology deconstruction and reconstruction transfer mechanism which automatically creates an ‘interlanguage’ document type definition (interlanguage DTD) in which the interlanguage DTD automatically manages the structure and semantics of the structure and semantics of data to allow an automatic interlanguage definition of the first schema and translation into the second schema by the transfer mechanism. Such use can be in the publishing industry to translate data from any one of a number of key XML-based schemas such as DocBook, HTML4, Open eBook, Digital Talking Book, ONIX, MARC, etc to another of such schemas. The system can also be used to translate queries made on documents in the interlanguage DTD as queries on any of the schemas mapped to that interlanguage DTD.

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.