专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20130204909A1 User-guided Multi-schema Integration 有权
标题翻译：用户引导的多模式集成
公开(公告)号：US20130204909A1
公开(公告)日：2013-08-08
申请号：US13368845
申请日：2012-02-08
申请人： Jens Lemcke , Muhammad Wasimullah Khan , Gunther Stuhec
发明人： Jens Lemcke , Muhammad Wasimullah Khan , Gunther Stuhec
IPC分类号： G06F17/30
CPC分类号： G06F17/30731
摘要： 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.
摘要翻译：用于用户引导的多模式集成的方法，系统和计算机可读存储介质，并且包括接收多个模式的动作，每个模式定义数据结构并且包括多个中间元素和多个叶元素，接收叶在多个模式的模式之间匹配叶元素的对应关系，使用闭合频繁项集挖掘来处理多个模式和叶对应，以定义第一多个冗余组，每个冗余组包括模式的中间元素之间的提出的对应关系，显示向用户提供第一组多个冗余组，接收用户输入，所述用户输入包括对所述第一多个冗余组中的一个或多个冗余组的一个或多个动作，处理所述多个模式，所述叶对应和所述一个或多个用于定义第二多个冗余组的动作，以及显示该seco 和多个冗余组。

2. 发明授权

US09501567B2 User-guided multi-schema integration 有权
标题翻译：用户引导的多模式集成
公开(公告)号：US09501567B2
公开(公告)日：2016-11-22
申请号：US13368845
申请日：2012-02-08
申请人： Jens Lemcke , Muhammad Wasimullah Khan , Gunther Stuhec
发明人： Jens Lemcke , Muhammad Wasimullah Khan , Gunther Stuhec
IPC分类号： G06F17/30
CPC分类号： G06F17/30731
摘要： 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.
摘要翻译：用于用户引导的多模式集成的方法，系统和计算机可读存储介质，并且包括接收多个模式的动作，每个模式定义数据结构并且包括多个中间元素和多个叶元素，接收叶在多个模式的模式之间匹配叶元素的对应关系，使用闭合频繁项集挖掘来处理多个模式和叶对应，以定义第一多个冗余组，每个冗余组包括模式的中间元素之间的提出的对应关系，显示向用户提供第一组多个冗余组，接收用户输入，所述用户输入包括对所述第一多个冗余组中的一个或多个冗余组的一个或多个动作，处理所述多个模式，所述叶对应和所述一个或多个用于定义第二多个冗余组的动作，以及显示该seco 和多个冗余组。

3. 发明申请

US20120324588A1 DATA MODEL OPTIMIZATION 有权
标题翻译：数据模型优化
公开(公告)号：US20120324588A1
公开(公告)日：2012-12-20
申请号：US13596532
申请日：2012-08-28
申请人： Gunther Stuhec , Florian Gessner , Jens Lemcke
发明人： Gunther Stuhec , Florian Gessner , Jens Lemcke
IPC分类号： G06F17/30 , G06F21/24
CPC分类号： G06F17/30386 , G06F17/2785 , G06F17/30607
摘要： 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.
摘要翻译：数据模型的一个或多个实体类的名称可以被改进以符合命名约定。可以确定每个实体类的每个名称和一个或多个属性的语义含义。可以确定第一实体类的名称在语义上类似于第二实体类的名称，该名称基于名称的语义意义之间的语义距离，其中可以在第一实体类和第第二实体类，通过将第一实体类的一个或多个属性的语义意义与第二实体类的一个或多个属性的语义意义进行比较。数据模型可以基于实质的相似性来归一化。

4. 发明申请

US20100121864A1 DATA MODEL OPTIMIZATION 有权
标题翻译：数据模型优化
公开(公告)号：US20100121864A1
公开(公告)日：2010-05-13
申请号：US12269324
申请日：2008-11-12
申请人： Gunther Stuhec , Florian Gessner , Jens Lemcke
发明人： Gunther Stuhec , Florian Gessner , Jens Lemcke
IPC分类号： G06F17/30
CPC分类号： G06F17/30386 , G06F17/2785 , G06F17/30607
摘要： 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.
摘要翻译：数据模型的一个或多个实体类的名称可以被改进以符合命名约定。可以确定每个实体类的每个名称和一个或多个属性的语义含义。可以确定第一实体类的名称在语义上类似于第二实体类的名称，该名称基于名称的语义意义之间的语义距离，其中可以在第一实体类和第第二实体类，通过将第一实体类的一个或多个属性的语义意义与第二实体类的一个或多个属性的语义意义进行比较。数据模型可以基于实质的相似性来归一化。

5. 发明授权

US08954378B2 Data model optimization 有权
标题翻译：数据模型优化
公开(公告)号：US08954378B2
公开(公告)日：2015-02-10
申请号：US13596532
申请日：2012-08-28
申请人： Gunther Stuhec , Florian Gessner , Jens Lemcke
发明人： Gunther Stuhec , Florian Gessner , Jens Lemcke
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30386 , G06F17/2785 , G06F17/30607
摘要： 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.
摘要翻译：数据模型的一个或多个实体类的名称可以被改进以符合命名约定。可以确定每个实体类的每个名称和一个或多个属性的语义含义。可以确定第一实体类的名称在语义上类似于第二实体类的名称，该名称基于名称的语义意义之间的语义距离，其中可以在第一实体类和第第二实体类，通过将第一实体类的一个或多个属性的语义意义与第二实体类的一个或多个属性的语义意义进行比较。数据模型可以基于实质的相似性来归一化。

6. 发明申请

US20130246480A1 Computing Canonical Hierarchical Schemas 有权
标题翻译：计算规范层次模式
公开(公告)号：US20130246480A1
公开(公告)日：2013-09-19
申请号：US13423471
申请日：2012-03-19
申请人： Jens Lemcke , Michael Dietrich , Gunther Stuhec
发明人： Jens Lemcke , Michael Dietrich , Gunther Stuhec
IPC分类号： G06F17/30
CPC分类号： G06Q10/10
摘要： 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.
摘要翻译：用于接收多个源分层模式的方法，系统和计算机可读存储介质，处理源分层模式以生成包括多个合并节点的合并图，每个合并节点是基于一个或多个节点从源分层模式中的至少两个，确定和解决使用合并图中的冲突以生成无冲突的合并图，其中解决包括将一个或多个合并的节点分解成合并的节点的相应子集，定义和处理约束满足问题（CSP）以产生多个中介层级模式（MHS），每个MHS是CSP的解决方案，将多个MHS的MHS识别为最佳MHS，其中提供了规范分级模式（CHS）作为最佳MHS，并将CHS作为计算机可读文档存储在计算机可读存储器中。

7. 发明授权

US08676866B2 Computing canonical hierarchical schemas 有权
标题翻译：计算规范分层模式
公开(公告)号：US08676866B2
公开(公告)日：2014-03-18
申请号：US13423471
申请日：2012-03-19
申请人： Jens Lemcke , Michael Dietrich , Gunther Stuhec
发明人： Jens Lemcke , Michael Dietrich , Gunther Stuhec
IPC分类号： G06F7/00
CPC分类号： G06Q10/10
摘要： 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.
摘要翻译：用于接收多个源分层模式的方法，系统和计算机可读存储介质，处理源分层模式以生成包括多个合并节点的合并图，每个合并节点是基于一个或多个节点从源分层模式中的至少两个，确定和解决使用合并图中的冲突以生成无冲突的合并图，其中解决包括将一个或多个合并的节点分解成合并的节点的相应子集，定义和处理约束满足问题（CSP）以产生多个中介层级模式（MHS），每个MHS是CSP的解决方案，将多个MHS的MHS识别为最佳MHS，其中提供了规范分级模式（CHS）作为最佳MHS，并将CHS作为计算机可读文档存储在计算机可读存储器中。

8. 发明授权

US08290989B2 Data model optimization 有权
标题翻译：数据模型优化
公开(公告)号：US08290989B2
公开(公告)日：2012-10-16
申请号：US12269324
申请日：2008-11-12
申请人： Gunther Stuhec , Florian Gessner , Jens Lemcke
发明人： Gunther Stuhec , Florian Gessner , Jens Lemcke
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30386 , G06F17/2785 , G06F17/30607
摘要： 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.
摘要翻译：数据模型的一个或多个实体类的名称可以被改进以符合命名约定。可以确定每个实体类的每个名称和一个或多个属性的语义含义。可以确定第一实体类的名称在语义上类似于第二实体类的名称，该名称基于名称的语义意义之间的语义距离，其中可以在第一实体类和第第二实体类，通过将第一实体类的一个或多个属性的语义意义与第二实体类的一个或多个属性的语义意义进行比较。数据模型可以基于实质的相似性来归一化。

9. 发明申请

US20150032777A1 CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION 有权
标题翻译：经济数据模型，用于企业商业模式集成中的迭代减少
公开(公告)号：US20150032777A1
公开(公告)日：2015-01-29
申请号：US13948391
申请日：2013-07-23
申请人： Michael Dietrich , Jens Lemcke , Gunther Stuhec
发明人： Michael Dietrich , Jens Lemcke , Gunther Stuhec
IPC分类号： G06F17/30
CPC分类号： G06F17/30958 , G06F17/30557 , G06F17/30589 , G06Q10/067
摘要： 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.
摘要翻译：本公开描述了用于提供和维护演进的规范数据模型（CDM）的方法，系统和计算机程序产品，其合并了现有模式的对应关系的当前知识。一种计算机实现的方法包括接收多个源分层模式，每个源分层模式作为计算机可读文档存储在计算机可读存储器中，使用计算机处理，源分层模式以生成合并图，合并的图形，其包括多个合并节点，每个合并节点基于来自所述源分层模式中的至少两个的一个或多个节点提供，并且使用所述计算机确定所述合并图包括一个或多个冲突，并且作为响应，解决所述一个或多个冲突的每个冲突以产生作为统一数据模型（UDM）的计算无传递边缘的，无冲突的合并图，其中解决包括将一个或多个合并的节点分割成合并的各个子集节点。

10. 发明授权

US09785658B2 Labelling entities in a canonical data model 有权
公开(公告)号：US09785658B2
公开(公告)日：2017-10-10
申请号：US14576098
申请日：2014-12-18
申请人： Nathali Ortiz Suarez , Jens Lemcke , Gunther Stuhec
发明人： Nathali Ortiz Suarez , Jens Lemcke , Gunther Stuhec
IPC分类号： G06F17/30
CPC分类号： G06F17/30297
摘要： Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式