Patent application number | Description | Published |
20080319937 | Properties of Data Elements - Methods and computer program products relating to properties of data elements. A computer-implemented method for identifying a property of a data element includes receiving a request for at least one sought property of a data element. The data element is configured for use in semantically identifying information portions in electronic communications. The sought property is to be valid in a context defined by at least one context value indicated by the request. The method includes identifying the at least one sought property by evaluating at least one logical rule that defines at least one property of the data element as being valid for a specified context. The method includes generating an output in response to the request that indicates the at least one sought property. | 12-25-2008 |
20090024655 | Scheme-Based Identifier - Among other disclosure: a computer-implemented method of configuring a system for an identification scheme; a computer-implemented method of communicating an identifier; a computer-implemented method of processing a received identifier; and corresponding computer program products. | 01-22-2009 |
20090037535 | Creating or Interpreting an Electronic Communication - Among other disclosure, a computer-implemented method for creating an electronic communication includes identifying, for an electronic communication regarding multiple items that is to be sent, a default value that applies to at least one of the items. The method includes including the default value in a default component configured for holding multiple default values. The method includes identifying a data structure that is common to more than one of the multiple items. The method includes defining the data structure in a list component configured for holding multiple data structures. The method includes forwarding the electronic communication, including the default component and the list component. | 02-05-2009 |
20090070233 | Wiki biz web - Systems and methods for accessing multiple portals using a unique business language semantic are provided. Business information and services are provided to customers during, for example, a supply chain management process. An accessible business environment is provided which includes a common repository. The common repository has access to one or more business portals. One can search the product listing in the common repository using a browser, e.g., a web-based browser. In response to a search, one may be provided with a product list indicating some available business portals having the specific product and/or service. The common repository entries are described by a predetermined semantical description. | 03-12-2009 |
20090112655 | Context-specific modeling of collaborative business process - Among other disclosure, a computer-implemented method for context-specific modeling of a collaborative business process includes receiving an identification of a collaborative business process to involve a communication between at least two entities. The identification is submitted by an entity seeking to model the collaborative business process for a specific context associated with the entity. The method includes selecting, in a repository and using the specific context, at least one modeling artifact that has been defined for use in the identified collaborative business process. The repository includes a plurality of stored modeling artifacts for at least one collaborative business process, each of the stored modeling artifacts associated with at least one context value. The method includes providing the selected modeling artifact to the entity in response to the received identification. | 04-30-2009 |
20090112916 | Creating a mapping - Among other disclosed subject matter, a computer-implemented method for creating a mapping includes obtaining a definition relating to a first schema, the definition comprising a first plurality of nodes to be mapped to a second schema comprising a second plurality of nodes. The method includes receiving at least one context value for the received definition, the context value being associated with at least one context category defined for the second schema. The method includes generating names corresponding to each of the nodes in the first plurality, the generated names being consistent with a naming rule for the second schema. The method includes mapping each of the nodes in the first plurality to a respective one of the nodes in the second plurality, wherein the context value and at least one of the generated names are taken into account in the mapping. | 04-30-2009 |
20100121864 | DATA MODEL OPTIMIZATION - A name of one or more entity classes of the data model may be refined to conform to a naming convention. A semantic meaning of each of the names and one or more attributes of each entity class may be determined. It may be determined that the name of a first entity class is semantically similar to the name of a second entity class based on a semantic distance between the semantic meaning of the names, where a substantial similarity may be determined between the first entity class and the second entity class by comparing the semantic meaning of the one or more attributes of the first entity class to the semantic meaning of the one or more attributes of the second entity class. The data model may be normalized based on the substantial similarity. | 05-13-2010 |
20100250559 | Automatic Match Tuning - Methods and apparatus, including computer program products, for identifying matches between disparate schemas calculates a degree of similarity between elements of two schemas using each of multiple matching processes. The calculated degrees of similarity are combined using a first weighting vector to produce first combined degrees of similarity. The first weighting vector includes multiple weighting coefficients and each weighting coefficient corresponds to one of the matching processes. The weighting coefficients are tuned using information relating to a predicted degree of matching accuracy associated with the first weighting vector. | 09-30-2010 |
20120066693 | Processing a Received Message - Processing a received message includes receiving a message that includes within the message a plurality of values and a plurality of context values. Each of the values is associated with a respective data element. The method includes identifying a first context value and those first data elements that are relevant to the first context value. The method includes selecting first rules that are specific for the first context value and applying the first rules to the values associated with the first data elements. The process includes identifying a second context value and those second data elements that are relevant to the second context value and omitting first data elements that are relevant to the second context value. The method includes selecting second rules that are specific to the second context value and applying the second rules to values associated with the second data elements. | 03-15-2012 |
20120166392 | Registering and Discovering Unique Identifiers - In general, the subject matter described in this specification can be embodied in methods, systems, and program products for discovering information that is related to a unique object identifier from a decentralized collection of computing systems. A unique object identifier is identified. A first information request that includes the unique object identifier is forwarded to a first computing system. First information that the first computing system has stored in association with the unique object identifier is received from the first computing system. An identifier for a second computing system is received from the first computing system in response to the first information request. A second information request that includes the unique object identifier is forwarded to the second computing system based on the received identifier. Second information that the second computing system has stored in association with the unique object identifier is received from the second computing system. | 06-28-2012 |
20120324588 | DATA MODEL OPTIMIZATION - A name of one or more entity classes of the data model may be refined to conform to a naming convention. A semantic meaning of each of the names and one or more attributes of each entity class may be determined. It may be determined that the name of a first entity class is semantically similar to the name of a second entity class based on a semantic distance between the semantic meaning of the names, where a substantial similarity may be determined between the first entity class and the second entity class by comparing the semantic meaning of the one or more attributes of the first entity class to the semantic meaning of the one or more attributes of the second entity class. The data model may be normalized based on the substantial similarity. | 12-20-2012 |
20130204909 | User-guided Multi-schema Integration - Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundancy groups. | 08-08-2013 |
20130246480 | Computing Canonical Hierarchical Schemas - Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory. | 09-19-2013 |
20130332454 | DICTIONARY ENTRY NAME GENERATOR - A method for building dictionary entry names for data elements of a canonical data model includes identifying candidate terms for the dictionary entry name of a node or equivalence class of the canonical data model. The method includes counting a frequency of occurrence of candidate terms in use and based on the use counts creating a candidate ordering of terms for the complete ordered dictionary entry name of the node or equivalence class. The method further includes validating the candidate ordering of terms for the complete ordered dictionary entry name of the node or equivalence class by comparison of the ordering with reliable dictionary entry name entries in a database and/or by usage counts in search engine results. | 12-12-2013 |
20150032777 | CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION - The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes. | 01-29-2015 |