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

1. 发明申请

US20110106821A1 Semantic-Aware Record Matching 失效
标题翻译：语义感知记录匹配
公开(公告)号：US20110106821A1
公开(公告)日：2011-05-05
申请号：US12610101
申请日：2009-10-30
申请人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
发明人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
IPC分类号： G06F17/30 , G06F17/21
CPC分类号： G06F17/2785 , G06F17/30734
摘要： A method of semantic-aware record matching includes receiving source and target string record specifications associated with a source string record and a target string record, receiving semantic knowledge referring to tokens of the source string record and target string record, creating a first set of tokens for the source string record and a second set of tokens for the target string record based on the semantic knowledge, assigning a similarity score to the source string record and the target string record based on a semantic relationship between the first set of tokens and the second set of tokens, and matching the source string record and the target string record based on the similarity score.
摘要翻译：语义感知记录匹配的方法包括接收与源字符串记录和目标字符串记录相关联的源和目标字符串记录规范，接收引用源字符串记录和目标字符串记录的令牌的语义知识，创建第一组令牌对于源字符串记录和基于语义知识的目标字符串记录的第二组令牌，基于第一组令牌和第二组令牌之间的语义关系向源字符串记录和目标字符串记录分配相似性分数一组令牌，并根据相似性得分匹配源字符串记录和目标字符串记录。

2. 发明申请

US20110106836A1 Semantic Link Discovery 审中-公开
标题翻译：语义链接发现
公开(公告)号：US20110106836A1
公开(公告)日：2011-05-05
申请号：US12609657
申请日：2009-10-30
申请人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
发明人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F16/2465
摘要： A method of semantic link discovery through translation of basic declarative language includes receiving a set of linkage specifications, receiving a set of data sources related to the linkage specifications, the set of data sources and the set of linkage requirements forming a basic declarative language query, translating the basic declarative language query into a standard language query, executing the standard language query, and returning results of the standard language query in response to the executing.
摘要翻译：通过翻译基本声明性语言的语义链接发现的方法包括接收一组链接规范，接收与链接规范相关的一组数据源，数据源集合和形成基本声明性语言查询的连接请求集合，将基本声明性语言查询转换为标准语言查询，执行标准语言查询，并响应于执行返回标准语言查询的结果。

3. 发明授权

US08468160B2 Semantic-aware record matching 失效
标题翻译：语义感知记录匹配
公开(公告)号：US08468160B2
公开(公告)日：2013-06-18
申请号：US12610101
申请日：2009-10-30
申请人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
发明人： Oktie Hassanzadeh , Anastasios Kementsietsidis , Lipyeow Lim , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/2785 , G06F17/30734
摘要： A method of semantic-aware record matching includes receiving source and target string record specifications associated with a source string record and a target string record, receiving semantic knowledge referring to tokens of the source string record and target string record, creating a first set of tokens for the source string record and a second set of tokens for the target string record based on the semantic knowledge, assigning a similarity score to the source string record and the target string record based on a semantic relationship between the first set of tokens and the second set of tokens, and matching the source string record and the target string record based on the similarity score.
摘要翻译：语义感知记录匹配的方法包括接收与源字符串记录和目标字符串记录相关联的源和目标字符串记录规范，接收引用源字符串记录和目标字符串记录的令牌的语义知识，创建第一组令牌对于源字符串记录和基于语义知识的目标字符串记录的第二组令牌，基于第一组令牌和第二组令牌之间的语义关系向源字符串记录和目标字符串记录分配相似性分数一组令牌，并根据相似性得分匹配源字符串记录和目标字符串记录。

4. 发明授权

US08135730B2 Ontology-based searching in database systems 失效
标题翻译：数据库系统中基于本体的搜索
公开(公告)号：US08135730B2
公开(公告)日：2012-03-13
申请号：US12481009
申请日：2009-06-09
申请人： Lipyeow Lim , Anastasios Kementsietsidis , Min Wang
发明人： Lipyeow Lim , Anastasios Kementsietsidis , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/3064 , G06Q10/10 , G06Q50/22
摘要： A method, information processing system, and computer program storage product retrieve data from a database. A search request is received from a user for a set of data in at least one database. An ontology query over is performed over at least one ontology associated with at least one database resulting in an ontological dataset associated with the search request in response to receiving the search request from the user. The ontological dataset includes at least one of a set of synonyms, a set of hypernyms, and a set of hyponyms, associated with the search request. A data query is performed over data in the at least one database using the ontological dataset in response to performing the ontology query. The set of data is returned to the user based on the data query that has been performed.
摘要翻译：方法，信息处理系统和计算机程序存储产品从数据库检索数据。对于至少一个数据库中的一组数据，从用户接收搜索请求。响应于接收到来自用户的搜索请求，在与至少一个数据库相关联的至少一个本体上执行本体查询，导致与搜索请求相关联的本体数据集。本体数据集包括与搜索请求相关联的一组同义词，一组超词和一组下位词中的至少一个。响应于执行本体查询，使用本体数据集在至少一个数据库中的数据上执行数据查询。基于已经执行的数据查询，该组数据被返回给用户。

5. 发明申请

US20110125730A1 Optimizing Queries to Hierarchically Structured Data 失效
标题翻译：优化查询到分层结构化数据
公开(公告)号：US20110125730A1
公开(公告)日：2011-05-26
申请号：US12624675
申请日：2009-11-24
申请人： Rajesh Bordawekar , Anastasios Kementsietsidis , Bryant Wei Lun Kok , Lipyeow Lim
发明人： Rajesh Bordawekar , Anastasios Kementsietsidis , Bryant Wei Lun Kok , Lipyeow Lim
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30935
摘要： Techniques are disclosed for optimizing queries to hierarchically structured data. For example, a method for processing a query directed to data having a hierarchical structure with a plurality of data nodes comprises the following steps. One or more structural attributes describing the hierarchical structure of the data are identified. The query is partitioned into two or more query partitions using at least one of the one or more identified structural attributes. A parallel execution plan is determined for the query by splitting into components one or more of: the query into at least two of the query partitions; and the hierarchical structure of the data. The split components are executed in parallel on different computer processes according to the parallel execution plan.
摘要翻译：公开了用于优化对分层结构化数据的查询的技术。例如，用于处理针对具有具有多个数据节点的分层结构的数据的查询的方法包括以下步骤。识别描述数据的层次结构的一个或多个结构属性。该查询使用一个或多个所识别的结构属性中的至少一个来分割成两个或更多个查询分区。通过将查询分成至少两个查询分区中的一个或多个来确定查询的并行执行计划; 和数据的层次结构。分割组件根据并行执行计划在不同的计算机进程上并行执行。

6. 发明授权

US08285711B2 Optimizing queries to hierarchically structured data 失效
标题翻译：优化查询到分层结构化数据
公开(公告)号：US08285711B2
公开(公告)日：2012-10-09
申请号：US12624675
申请日：2009-11-24
申请人： Rajesh Bordawekar , Anastasios Kementsietsidis , Bryant Wei Lun Kok , Lipyeow Lim
发明人： Rajesh Bordawekar , Anastasios Kementsietsidis , Bryant Wei Lun Kok , Lipyeow Lim
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30935
摘要： Techniques are disclosed for optimizing queries to hierarchically structured data. For example, a method for processing a query directed to data having a hierarchical structure with a plurality of data nodes comprises the following steps. One or more structural attributes describing the hierarchical structure of the data are identified. The query is partitioned into two or more query partitions using at least one of the one or more identified structural attributes. A parallel execution plan is determined for the query by splitting into components one or more of: the query into at least two of the query partitions; and the hierarchical structure of the data. The split components are executed in parallel on different computer processes according to the parallel execution plan.
摘要翻译：公开了用于优化对分层结构化数据的查询的技术。例如，用于处理针对具有具有多个数据节点的分层结构的数据的查询的方法包括以下步骤。识别描述数据的层次结构的一个或多个结构属性。该查询使用一个或多个所识别的结构属性中的至少一个来分割成两个或更多个查询分区。通过将查询分成至少两个查询分区中的一个或多个来确定查询的并行执行计划; 和数据的层次结构。分割组件根据并行执行计划在不同的计算机进程上并行执行。

7. 发明授权

US07529740B2 Method and apparatus for organizing data sources 有权
标题翻译：组织数据源的方法和装置
公开(公告)号：US07529740B2
公开(公告)日：2009-05-05
申请号：US11503713
申请日：2006-08-14
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , Y10S707/99933 , Y10S707/99953
摘要： A method for organizing deep Web services is provided. In one aspect, the method obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.
摘要翻译：提供了组织深度Web服务的方法。在一个方面，该方法获得源及其相关属性和/或输入模式的集合，例如使用爬行算法。该方法使用这些信息将资源组织到社区。使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

8. 发明申请

US20080270367A1 SYSTEM AND METHOD FOR SEARCHING DEEP WEB SERVICES 审中-公开
标题翻译：用于搜索深层WEB服务的系统和方法
公开(公告)号：US20080270367A1
公开(公告)日：2008-10-30
申请号：US12173545
申请日：2008-07-15
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F16/958 , Y10S707/99933
摘要： A system and method for searching deep web services are provided. The system and method in one aspect allow organizing communities, sources and schema attributes in a multi-tier containment relationship; searching representative schema attributes in one or more communities; searching representative services in one or more communities; searching for related schema attributes; and searching for related communities.
摘要翻译：提供了一种用于搜索深度Web服务的系统和方法。一方面的系统和方法允许在多层遏制关系中组织社区，来源和模式属性; 在一个或多个社区中搜索代表性模式属性; 在一个或多个社区寻找代表服务; 搜索相关的模式属性; 并搜索相关社区。

9. 发明申请

US20080259084A1 METHOD AND APPARATUS FOR ORGANIZING DATA SOURCES 审中-公开
标题翻译：用于组织数据源的方法和装置
公开(公告)号：US20080259084A1
公开(公告)日：2008-10-23
申请号：US12163485
申请日：2008-06-27
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30 , G06T11/20
CPC分类号： G06F16/35 , Y10S707/99933 , Y10S707/99953
摘要： A method and apparatus for organizing deep Web services are provided. In one aspect, the method and apparatus obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method and apparatus uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.
摘要翻译：提供了一种用于组织深度Web服务的方法和装置。在一个方面，该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。该方法和装置使用这些信息将资源组织到社区。使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

10. 发明申请

US20080215520A1 METHOD AND SYSTEM FOR INDEXING AND SERIALIZING DATA 失效
标题翻译：数据索引和序列化的方法和系统
公开(公告)号：US20080215520A1
公开(公告)日：2008-09-04
申请号：US11681486
申请日：2007-03-02
申请人： Xiaohui Gu , Lipyeow Lim , Haixun Wang , Min Wang
发明人： Xiaohui Gu , Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06N5/02
CPC分类号： G06F17/30911
摘要： The present invention provides a computer implemented method, an apparatus, and a computer usable program product for indexing data. A controller identifies a set of data to be indexed, wherein a set of data structure trees represents the set of data. The controller merges the set of data structure trees to form a unified tree, wherein the unified tree contains a node for each unit of data in the set of data. The controller assigns an identifier to the node for each unit of data in the set of data that describes the node within the unified tree. The controller then serializes the unified tree to form a set of sequential series that represents the set of data structure trees, wherein the set of sequential series forms an index for the set of data.
摘要翻译：本发明提供了一种用于索引数据的计算机实现的方法，装置和计算机可用程序产品。控制器识别要索引的一组数据，其中一组数据结构树表示该组数据。控制器将数据结构树组合成一个统一的树，其中统一树包含一组数据中每个数据单元的节点。控制器为描述统一树中节点的数据集中的每个数据单元向节点分配一个标识符。然后，控制器对统一树进行序列化以形成一组代表数据结构树的顺序序列，其中，该顺序序列集合形成该组数据的索引。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式