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

1. 发明授权

US08478793B2 Virtual pair algorithm for outer join resolution 有权
标题翻译：用于外连接解析的虚拟对算法
公开(公告)号：US08478793B2
公开(公告)日：2013-07-02
申请号：US13071133
申请日：2011-03-24
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F7/00
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

2. 发明授权

US08046377B2 Method for calculating distributed joins in main memory with minimal communicaton overhead 有权
标题翻译：以最小的通信开销计算主存储器中的分布式连接的方法
公开(公告)号：US08046377B2
公开(公告)日：2011-10-25
申请号：US11018697
申请日：2004-12-20
申请人： Oliver M. Steinau , Jane Hartmann
发明人： Oliver M. Steinau , Jane Hartmann
IPC分类号： G06F7/00
CPC分类号： G06F17/30498 , G06F17/30545
摘要： A method of executing a distributed join query for a set of documents includes communication between a first server and a second server. In the first server, a first tuple list is generated from a first list of documents matching a precondition part of the query. A first set of value identifiers of attributes associated with the first list of documents is extracted from the first tuple list. A first set of dictionary keys is generated from the set of value identifiers. Then, the first set of dictionary keys is sent with a join condition attribute to a second server. In the second server, the first set of value identifiers is converted to a second set of value identifiers of attributes associated with the second server based on the set of dictionary keys. Then, a lookup of documents is performed based on the second set of value identifiers.
摘要翻译：对一组文档执行分布式连接查询的方法包括第一服务器和第二服务器之间的通信。在第一个服务器中，从与查询的前提条件匹配的第一个文档列表中生成第一个元组列表。从第一元组列表中提取与第一文档列表相关联的属性的第一组值标识符。从一组值标识符生成第一组字典键。然后，将第一组字典密钥与连接条件属性一起发送到第二服务器。在第二服务器中，第一组值标识符被转换为基于字典密钥集合的与第二服务器相关联的属性的第二组值标识符。然后，基于第二组值标识符执行对文档的查找。

3. 发明授权

US07693821B2 Virtual pair algorithm for outer join resolution 有权
标题翻译：用于外连接解析的虚拟对算法
公开(公告)号：US07693821B2
公开(公告)日：2010-04-06
申请号：US11494042
申请日：2006-07-27
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F17/00
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

4. 发明申请

US20080027903A1 Virtual pair algorithm for outer join resolution 有权
标题翻译：用于外连接解析的虚拟对算法
公开(公告)号：US20080027903A1
公开(公告)日：2008-01-31
申请号：US11494042
申请日：2006-07-27
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

5. 发明申请

US20110173237A1 Virtual Pair Algorithm For Outer Join Resolution 有权
标题翻译：用于外连接分辨率的虚拟对算法
公开(公告)号：US20110173237A1
公开(公告)日：2011-07-14
申请号：US13071133
申请日：2011-03-24
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

6. 发明申请

US20100145930A1 VIRTUAL PAIR ALGORITHM FOR OUTER JOIN RESOLUTION 有权
标题翻译：用于外部解决方案的虚拟对偶算法
公开(公告)号：US20100145930A1
公开(公告)日：2010-06-10
申请号：US12709052
申请日：2010-02-19
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

7. 发明授权

US07941423B2 Virtual pair algorithm for outer join resolution 有权
标题翻译：用于外连接解析的虚拟对算法
公开(公告)号：US07941423B2
公开(公告)日：2011-05-10
申请号：US12709052
申请日：2010-02-19
申请人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
发明人： Gerhard L. Hill , Thomas Peh , Jane Hartmann
IPC分类号： G06F7/00
CPC分类号： G06F17/30498 , G06F17/30545 , Y10S707/99932
摘要： A system and method for executing semijoin reductions on outer join operations are presented. Tuple lists are created based on a query. A sequence of semijoin reduction steps are performed, where each semijoin reduction step either switches one tuple list, or reduces all tuple lists at one relation. Virtual connector pairs are inserted into the tuple lists, and then all tuple lists are centralized at a common host. The join results are assembled at the common host, and negative row IDs are substituted. From the join result, the query result is retrieved by projecting to the requested attributes.
摘要翻译：提出了一种用于在外连接操作上执行半连续减少的系统和方法。元组列表是基于查询创建的。执行一系列半音素减少步骤，其中每个半音素减少步骤切换一个元组列表，或者减少一个关系中的所有元组列表。虚拟连接器对插入到元组列表中，然后所有元组列表都集中在一个共同的主机上。连接结果汇总在公共主机上，负行ID被替换。从连接结果中，通过对所请求的属性进行投影来检索查询结果。

8. 发明申请

US20060136388A1 Method for calculating distributed joins in main memory with minimal communicaton overhead 有权
标题翻译：以最小的通信开销计算主存储器中的分布式连接的方法
公开(公告)号：US20060136388A1
公开(公告)日：2006-06-22
申请号：US11018697
申请日：2004-12-20
申请人： Oliver Steinau , Jane Hartmann
发明人： Oliver Steinau , Jane Hartmann
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30545
摘要： A method of executing a distributed join query for a set of documents includes communication between a first server and a second server. In the first server, a first tuple list is generated from a first list of documents matching a precondition part of the query. A first set of value identifiers of attributes associated with the first list of documents is extracted from the first tuple list. A first set of dictionary keys is generated from the set of value identifiers. Then, the first set of dictionary keys is sent with a join condition attribute to a second server. In the second server, the first set of value identifiers is converted to a second set of value identifiers of attributes associated with the second server based on the set of dictionary keys. Then, a lookup of documents is performed based on the second set of value identifiers.
摘要翻译：对一组文档执行分布式连接查询的方法包括第一服务器和第二服务器之间的通信。在第一个服务器中，从与查询的前提条件匹配的第一个文档列表中生成第一个元组列表。从第一元组列表中提取与第一文档列表相关联的属性的第一组值标识符。从一组值标识符生成第一组字典键。然后，将第一组字典密钥与连接条件属性一起发送到第二服务器。在第二服务器中，第一组值标识符被转换为基于字典密钥集合的与第二服务器相关联的属性的第二组值标识符。然后，基于第二组值标识符执行对文档的查找。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式