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

1. 发明授权

US08359316B2 Database table look-up 有权
标题翻译：数据库表查找
公开(公告)号：US08359316B2
公开(公告)日：2013-01-22
申请号：US12714617
申请日：2010-03-01
申请人： Hubertus Franke , You-Chin Fuh , Hong Min , Terence P. Purcell , Yefim Shuf
发明人： Hubertus Franke , You-Chin Fuh , Hong Min , Terence P. Purcell , Yefim Shuf
IPC分类号： G06F7/00
CPC分类号： G06F17/30584
摘要： Techniques for database table look-up are provided. The techniques include storing one or more column attributes of a database table in a data structure, wherein the data structure also comprises a record identification (RID) column of a table, one or more predicate columns corresponding to the RID column, and a sequence number column that is associated with one or more updated records, generating a key using one or more portions from one or more of the one or more predicate columns, using the key to partition the data structure, wherein partitioning the data structure comprises partitioning the one or more predicate columns for evaluation, and evaluating the one or more predicate columns against the data structure for each matching predicate column-data structure partition.
摘要翻译：提供数据库表查找技术。这些技术包括将数据库表的一个或多个列属性存储在数据结构中，其中数据结构还包括表的记录标识（RID）列，对应于RID列的一个或多个谓词列，以及序列号列，其与一个或多个更新的记录相关联，使用所述密钥对所述数据结构进行分区，使用所述一个或多个谓词列中的一个或多个的一个或多个部分生成密钥，其中分割所述数据结构包括将所述一个或多个用于评估的更多谓词列，并针对每个匹配谓词列数据结构分区的数据结构评估一个或多个谓词列。

2. 发明申请

US20110213775A1 Database Table Look-up 有权
标题翻译：数据库表查找
公开(公告)号：US20110213775A1
公开(公告)日：2011-09-01
申请号：US12714617
申请日：2010-03-01
申请人： Hubertus Franke , You-Chin Fuh , Hong Min , Terence P. Purcell , Yefim Shuf
发明人： Hubertus Franke , You-Chin Fuh , Hong Min , Terence P. Purcell , Yefim Shuf
IPC分类号： G06F17/30
CPC分类号： G06F17/30584
摘要： Techniques for database table look-up are provided. The techniques include storing one or more column attributes of a database table in a data structure, wherein the data structure also comprises a record identification (RID) column of a table, one or more predicate columns corresponding to the RID column, and a sequence number column that is associated with one or more updated records, generating a key using one or more portions from one or more of the one or more predicate columns, using the key to partition the data structure, wherein partitioning the data structure comprises partitioning the one or more predicate columns for evaluation, and evaluating the one or more predicate columns against the data structure for each matching predicate column-data structure partition.
摘要翻译：提供数据库表查找技术。这些技术包括将数据库表的一个或多个列属性存储在数据结构中，其中数据结构还包括表的记录标识（RID）列，对应于RID列的一个或多个谓词列，以及序列号列，其与一个或多个更新的记录相关联，使用所述密钥对所述数据结构进行分区，使用所述一个或多个谓词列中的一个或多个的一个或多个部分生成密钥，其中分割所述数据结构包括将所述一个或多个用于评估的更多谓词列，并针对每个匹配谓词列数据结构分区的数据结构评估一个或多个谓词列。

3. 发明授权

US08140522B2 Method, apparatus, and computer program product for adaptive query parallelism partitioning with look-ahead probing and feedback 失效
标题翻译：用于具有预测探测和反馈的自适应查询并行划分的方法，装置和计算机程序产品
公开(公告)号：US08140522B2
公开(公告)日：2012-03-20
申请号：US12190057
申请日：2008-08-12
申请人： Hong Min , Yefim Shuf , Terence Patrick Purcell , You-Chin Fuh , Chunfeng Pei , Ou Jin
发明人： Hong Min , Yefim Shuf , Terence Patrick Purcell , You-Chin Fuh , Chunfeng Pei , Ou Jin
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30445 , G06F17/30474 , G06F17/30536
摘要： A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data.
摘要翻译：数据库查询被分割成包括多个并行组的初始分区，并且经由执行计划基于初始分区被执行。从多个并行组中识别数据的采样子集。与执行查询基本相同，执行计划作为采样线程在数据的采样子集上执行。执行计划根据执行计划对数据采样子集的反馈进行修改。

4. 发明申请

US20100042607A1 METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE QUERY PARALLELISM PARTITIONING WITH LOOK-AHEAD PROBING AND FEEDBACK 失效
标题翻译：方法，装置和计算机程序产品适应性查询和平分析与前瞻性探测和反馈
公开(公告)号：US20100042607A1
公开(公告)日：2010-02-18
申请号：US12190057
申请日：2008-08-12
申请人： Hong Min , Yefim Shuf , Terence Patrick Purcell , You-Chin Fuh , Chunfeng Pei , Ou Jin
发明人： Hong Min , Yefim Shuf , Terence Patrick Purcell , You-Chin Fuh , Chunfeng Pei , Ou Jin
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30445 , G06F17/30474 , G06F17/30536
摘要： A database query is partitioned into an initial partition including a plurality of parallel groups, and is executed, via an execution plan, based on the initial partition. A sampling subset of data is identified from the plurality of parallel groups. Substantially in parallel with the executing of the query, the execution plan is executed on the sampling subset of data as a sampling thread. The execution plan is modified based on feedback from the execution of the execution plan on the sampling subset of data.
摘要翻译：数据库查询被分割成包括多个并行组的初始分区，并且经由执行计划基于初始分区被执行。从多个并行组中识别数据的采样子集。与执行查询基本相同，执行计划作为采样线程在数据的采样子集上执行。执行计划根据执行计划对数据采样子集的反馈进行修改。

5. 发明申请

US20110196857A1 Generating Materialized Query Table Candidates 失效
标题翻译：生成物化查询表候选
公开(公告)号：US20110196857A1
公开(公告)日：2011-08-11
申请号：US12702384
申请日：2010-02-09
申请人： Dong Sheng Chen , Hong Min , Terence P. Purcell , Yefim Shuf , Xiao Bo Wang , Zhong Liang Zhang
发明人： Dong Sheng Chen , Hong Min , Terence P. Purcell , Yefim Shuf , Xiao Bo Wang , Zhong Liang Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30457
摘要： Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.
摘要翻译：提供了用于生成用于工作负载的一个或多个物化查询表（MQT）候选的集合的技术。所述技术包括接收工作负载，其中所述工作负载包括一组一个或多个查询，基于所述一个或多个查询的一个或多个查询块生成一个或多个最佳匹配MQT（BMQT），通过除去不符合 MQT重写，使用所述一个或多个BMQT和所述一个或多个频繁使用的多连接来生成一组一个或多个工作负载MQT（WMQT）来确定所述工作负载中的一个或多个频繁使用的多连接，以及将一个或多个WMQT和一个或多个BMQT分组成一个或多个组合并成一组较少数量的MQT并覆盖工作负载。

6. 发明授权

US08620899B2 Generating materialized query table candidates 失效
标题翻译：生成物化查询表候选
公开(公告)号：US08620899B2
公开(公告)日：2013-12-31
申请号：US12702384
申请日：2010-02-09
申请人： Dongsheng Chen , Hong Min , Terence P. Purcell , Yefim Shuf , Xiaobo Wang , Zhongliang Zhang
发明人： Dongsheng Chen , Hong Min , Terence P. Purcell , Yefim Shuf , Xiaobo Wang , Zhongliang Zhang
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30457
摘要： Techniques for generating a set of one or more materialized query table (MQT) candidates for a workload are provided. The techniques include receiving a workload, wherein the workload comprises a set of one or more queries, generating one or more best matching MQTs (BMQTs) based on one or more query blocks of the one or more queries by removing syntax that is not qualified for a MQT re-write, determining one or more frequently used multi-joins in the workload, using the one or more BMQTs and the one or more frequently used multi-joins to generate a set of one or more workload MQTs (WMQTs), and grouping one or more WMQTs and one or more BMQTs into one or more groups to merge into a set of a smaller number of MQTs and to cover the workload.
摘要翻译：提供了用于生成用于工作负载的一个或多个物化查询表（MQT）候选的集合的技术。所述技术包括接收工作负载，其中所述工作负载包括一组一个或多个查询，基于所述一个或多个查询的一个或多个查询块生成一个或多个最佳匹配MQT（BMQT），通过除去不符合 MQT重写，使用所述一个或多个BMQT和所述一个或多个频繁使用的多连接来生成一组一个或多个工作负载MQT（WMQT）来确定所述工作负载中的一个或多个频繁使用的多连接，以及将一个或多个WMQT和一个或多个BMQT分组成一个或多个组合并成一组较少数量的MQT并覆盖工作负载。

7. 发明授权

US09235622B2 System and method for an efficient query sort of a data stream with duplicate key values 有权
标题翻译：具有重复键值的数据流的高效查询排序的系统和方法
公开(公告)号：US09235622B2
公开(公告)日：2016-01-12
申请号：US12394572
申请日：2009-02-27
申请人： Yefim Shuf , Hong Min , Hubertus Franke , Allan B. Lebovitz
发明人： Yefim Shuf , Hong Min , Hubertus Franke , Allan B. Lebovitz
IPC分类号： G06F17/30
CPC分类号： G06F17/30486
摘要： An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.
摘要翻译：公开了一种用于对具有重复键值的数据集有效执行查询排序的装置和方法。该方法包括在确定密钥的重复密钥值的数量超过预定阈值之后，识别数据集中的密钥的唯一密钥值。该方法还包括记录每个唯一密钥值与数据集中的记录的关联并排序唯一密钥值。该方法还包括以排序顺序存储唯一键值，其中每个唯一键值与数据集中的适当记录相关联。

8. 发明授权

US08122219B2 Storage allocation 有权
标题翻译：存储分配
公开(公告)号：US08122219B2
公开(公告)日：2012-02-21
申请号：US12507419
申请日：2009-07-22
申请人： Yefim Shuf , Hong Min , Hubertus Franke , Ulrich Alfons Finkler
发明人： Yefim Shuf , Hong Min , Hubertus Franke , Ulrich Alfons Finkler
IPC分类号： G06F13/00
CPC分类号： G06F17/30315
摘要： Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function.
摘要翻译：提供了数据记录的存储分配技术。这些技术包括尝试识别用于存储数据记录的第一位置，其中数据记录包括一个或多个数据记录属性，如果识别出第一位置，选择用于存储数据记录的第一位置，以及如果第一位置是未识别，使用成本惩罚函数识别用于存储数据记录的第二位置，并且基于成本惩罚函数选择用于存储数据记录的第二位置。

9. 发明申请

US20100223269A1 SYSTEM AND METHOD FOR AN EFFICIENT QUERY SORT OF A DATA STREAM WITH DUPLICATE KEY VALUES 有权
标题翻译：具有双重关键值的数据流的有效查询的系统和方法
公开(公告)号：US20100223269A1
公开(公告)日：2010-09-02
申请号：US12394572
申请日：2009-02-27
申请人： Yefim Shuf , Hong Min , Hubertus Franke , Allan B. Lebovitz
发明人： Yefim Shuf , Hong Min , Hubertus Franke , Allan B. Lebovitz
IPC分类号： G06F17/30
CPC分类号： G06F17/30486
摘要： An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.
摘要翻译：公开了一种用于对具有重复键值的数据集有效执行查询排序的装置和方法。该方法包括在确定密钥的重复密钥值的数量超过预定阈值之后，识别数据集中的密钥的唯一密钥值。该方法还包括记录每个唯一密钥值与数据集中的记录的关联并排序唯一密钥值。该方法还包括以排序顺序存储唯一键值，其中每个唯一键值与数据集中的适当记录相关联。

10. 发明授权

US10089379B2 Method for sorting data 有权
公开(公告)号：US10089379B2
公开(公告)日：2018-10-02
申请号：US12193084
申请日：2008-08-18
申请人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
发明人： Hong Min , Yefim Shuf , Hubertus Franke , Allan Benjamin Lebovitz , Christopher John Crone , Akiko Hoshikawa
IPC分类号： G06F17/30 , G06F7/36
摘要： A sequence of one or more input objects are sorted by identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式