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

11. 发明授权

US6112198A Optimization of data repartitioning during parallel query optimization 失效
标题翻译：并行查询优化中数据重分区的优化
公开(公告)号：US6112198A
公开(公告)日：2000-08-29
申请号：US106473
申请日：1998-06-29
申请人： Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David E. Simmen , Monica Sachiye Urata
发明人： Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David E. Simmen , Monica Sachiye Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30498 , Y10S707/99933
摘要： Query evaluation is optimized using parallel optimization techniques to make repartitioning more efficient. Efficiency is improved by recognizing the possible partitioning requirements for achieving parallelism for a query operation, and by recognizing when the partitioning property of data satisfies the partitioning requirements of a query operation. A data base management system in accordance with the invention uses parallel query processing techniques to optimize data repartitioning, or to avoid it altogether.
摘要翻译：使用并行优化技术优化查询评估，使重新分区更有效率。通过识别实现查询操作的并行性的可能的分区要求，以及通过识别数据的分区属性何时满足查询操作的分区要求，可以提高效率。根据本发明的数据库管理系统使用并行查询处理技术来优化数据重新分区，或者完全避免它们。

12. 发明授权

US6105020A System and method for identifying and constructing star joins for execution by bitmap ANDing 失效
标题翻译：用于识别和构建星形连接以通过位图对准执行的系统和方法
公开(公告)号：US6105020A
公开(公告)日：2000-08-15
申请号：US415799
申请日：1999-10-11
申请人： Bruce Gilbert Lindsay , Eugene Jon Shekita , David Everett Simmen , Kaarel Truuvert
发明人： Bruce Gilbert Lindsay , Eugene Jon Shekita , David Everett Simmen , Kaarel Truuvert
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30471 , Y10S707/99932 , Y10S707/99933
摘要： A system and method for a relational database system for identifying star joins in a query and for breaking the query down for bitmap ANDing. The fact table of the star join is located, and cycles between and within dimension tables are broken. Then, the minimal set of tables necessary to execute the star join is identified, and the dimension tables that should appear in the bitmap ANDing plan are also identified. A bitmap ANDing plan is then generated, or, if the query does not qualify for bitmap ANDing, a conventional execution plan is generated.
摘要翻译：一种关系数据库系统的系统和方法，用于识别查询中的星形连接，并将查询中断用于位图“和”运算。星形连接的事实表位于，尺寸表之间和内部之间的循环被破坏。然后，确定执行星形连接所需的最小的一组表，并且还会识别出现在位图“安全”计划中的维度表。然后生成位图“和”计划，或者如果该查询不符合位图“与”功能，则会生成常规执行计划。

13. 发明授权

US08131726B2 Generic architecture for indexing document groups in an inverted text index 有权
标题翻译：在反向文本索引中索引文档组的通用架构
公开(公告)号：US08131726B2
公开(公告)日：2012-03-06
申请号：US10905604
申请日：2005-01-12
申请人： Andrei Z. Broder , Marcus Felipe Fontoura , Michael Herscovici , Ronny Lempel , John Ai McPherson, Jr. , Andreas Neumann , Runping Qi , Eugene Jon Shekita
发明人： Andrei Z. Broder , Marcus Felipe Fontoura , Michael Herscovici , Ronny Lempel , John Ai McPherson, Jr. , Andreas Neumann , Runping Qi , Eugene Jon Shekita
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30622
摘要： A method for indexing a plurality of documents, that includes a plurality of duplicate documents, first identifies one or more duplicate groups of documents from among the plurality of documents. Then, one index of content for the duplicate group is created instead of indexing the content from every document within the duplicate group. However, in contrast to the content index, an index of metadata for each of the documents in the duplicate group is created. Thus the content of each duplicate group is indexed only once, while a search engine using such indexing techniques retains the capability to answer queries as if the duplicated content was indexed for each document of the group.
摘要翻译：一种用于索引多个文档（包括多个重复文档）的方法首先从多个文档中识别一个或多个文档重复组。然后，创建重复组的一个内容索引，而不是从重复组中的每个文档索引内容。然而，与内容索引相反，创建了重复组中的每个文档的元数据索引。因此，每个重复组的内容仅被索引一次，而使用这种索引技术的搜索引擎保留回答查询的能力，就好像为组中的每个文档索引了重复的内容。

14. 发明授权

US06253197B1 System and method for hash loops join of data using outer join and early-out join 失效
标题翻译：散列循环的系统和方法使用外连接和提前连接来连接数据
公开(公告)号：US06253197B1
公开(公告)日：2001-06-26
申请号：US09167395
申请日：1998-10-06
申请人： Bruce Gilbert Lindsay , Eugene Jon Shekita
发明人： Bruce Gilbert Lindsay , Eugene Jon Shekita
IPC分类号： G06F1730
CPC分类号： G06F17/30498 , Y10S707/99933 , Y10S707/99953
摘要： A system and method for joining a build table to a probe table in response to a query for data includes executing a hash loops join of the build table and the probe table. Matched rows are joined and output when the rows match each other by satisfying a join predicate. In an outer join, unmatched rows in the probe table are joined to a NULL build table field values and output, such that all rows of the probe table are output regardless of whether they have matched rows in the build table. In an early-out join, on the other hand, a “match once” table defines the probe table and in response to a query for unique probe table outputs, the joining of a probe table row, once joined and output a first time, to any other rows in the other table is prevented regardless of whether the row might match other rows. In both the hash loops early-out join and the hash loops outer join, when the build table is larger than main memory, the roles of the build and probe tables are reversed.
摘要翻译：响应于对数据的查询将构建表连接到探测表的系统和方法包括执行构建表和探测表的散列循环连接。匹配的行被连接并通过满足连接谓词来匹配行时输出。在外连接中，探测表中的不匹配的行将连接到NULL构建表字段值和输出，以便无论在构建表中是否具有匹配行，都会输出探测表的所有行。另一方面，在早期连接中，“匹配一次”表定义探针表，并且响应于对唯一探针表输出的查询，加入探针表行，一旦连接并输出第一次，不管该行是否与其他行匹配，都会阻止其他表中的任何其他行。在哈希循环早期连接和散列循环外连接中，当构建表大于主内存时，构建和探测表的角色相反。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式