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

1. 发明授权

US09535939B2 Intra-block partitioning for database management 有权
公开(公告)号：US09535939B2
公开(公告)日：2017-01-03
申请号：US13485707
申请日：2012-05-31
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.

2. 发明授权

US09176999B2 Multiplication-based method for stitching results of predicate evaluation in column stores 有权
标题翻译：用于在列存储中拼接谓词评估结果的基于乘法的方法
公开(公告)号：US09176999B2
公开(公告)日：2015-11-03
申请号：US13614625
申请日：2012-09-13
申请人： Ronald J. Barber , Min-Soo Kim , Jae Gil Lee , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Jae Gil Lee , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30315 , G06F17/30324
摘要： A system joins predicate evaluated column bitmaps having varying lengths. The system includes a column unifier for querying column values with a predicate and generating an indicator bit for each of the column values that is then joined with the respective column value. The system also includes a bitmap generator for creating a column-major linear bitmap from the column values and indicator bits. The column unifier also determines an offset between adjacent indicator bits. The system also includes a converter for multiplying the column-major linear bitmap with a multiplier to shift the indicator bits into consecutive positions in the linear bitmap.
摘要翻译：系统连接具有不同长度的谓词评估列位图。该系统包括列统一器，用于使用谓词查询列值，并为每个列值生成指示符位，然后与各个列值相结合。该系统还包括位图生成器，用于从列值和指示符位创建列主要的线性位图。列统一器还确定相邻指示符位之间的偏移。该系统还包括用于将列主要线性位图与乘法器相乘的转换器，以将指示符位移动到线性位图中的连续位置。

3. 发明申请

US20090292714A1 ADAPTIVE LAZY MERGING 失效
标题翻译：自适应LAZY MERGING
公开(公告)号：US20090292714A1
公开(公告)日：2009-11-26
申请号：US12123598
申请日：2008-05-20
申请人： Wei Han , Lin Qiao , Vijayshankar Raman
发明人： Wei Han , Lin Qiao , Vijayshankar Raman
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： A query processing method intersects two or more unsorted lists based on a conjunction of predicates. Each list comprises a union of multiple sorted segments. The method performs lazy segment merging and an adaptive n-ary intersecting process. The lazy segment merging comprises starting with each list being a union of completely unmerged segments, such that lookups into a given list involve separate lookups into each segment of the given list. The method intersects the lists according to the predicates while performing the lazy segment merging, such that the lazy segment merging reads in only those portions of each segment that are needed for the intersecting. As the intersecting proceeds and the lookups are performed, the intersecting selectively merges the segments together, based on a cost-benefit analysis of the cost of merging compared to the benefit produced by reducing a number of lookups.
摘要翻译：查询处理方法基于谓词的连接与两个或多个未排序的列表相交。每个列表包括多个排序段的并集。该方法执行延迟段合并和自适应n元相交处理。懒惰段合并包括从每个列表开始，这些列是完全未合并的段的并集，使得到给定列表中的查找涉及到给定列表的每个段的单独查找。该方法在执行延迟段合并时根据谓词与列表相交，使得懒惰段合并仅读取相交所需的每个段的那些部分。当相交进行和查找被执行时，相交的选择性地将段合在一起，基于与合并成本的成本效益分析相比，通过减少多个查找产生的收益。

4. 发明申请

US20090094258A1 OFF-LOADING STAR JOIN OPERATIONS TO A STORAGE SERVER 失效
标题翻译：将负载明星加入到存储服务器中
公开(公告)号：US20090094258A1
公开(公告)日：2009-04-09
申请号：US11866907
申请日：2007-10-03
申请人： YING-LIN CHEN , You-Chin Fuh , Wei Han , Fen-Ling Lin , Inderpal Singh Narang , Lin Qiao , Vijayshankar Raman , Kouhorng Allen Yang
发明人： YING-LIN CHEN , You-Chin Fuh , Wei Han , Fen-Ling Lin , Inderpal Singh Narang , Lin Qiao , Vijayshankar Raman , Kouhorng Allen Yang
IPC分类号： G06F7/00
CPC分类号： G06F17/30498
摘要： A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.
摘要翻译：一种用于从主机信息处理系统到存储服务器的卸载星形连接操作的方法，存储服务器和计算机可读介质。分别从主机系统接收来自第一和第二维度表的至少第一和第二组密钥。第一组和第二组中的每一个与至少一个事实表相关联。从主机系统接收与一组外键索引相关联的一组位置。遍历一组事实表索引。识别与第一组密钥相关联的至少第一组行标识符（“RID”）和与第二组密钥相关联的至少第二组RID。对第一和第二组RID执行操作以识别RID的交叉集合。然后存储相交的RID集合。

5. 发明授权

US09875280B2 Efficient partitioned joins in a database with column-major layout 有权
公开(公告)号：US09875280B2
公开(公告)日：2018-01-23
申请号：US13594200
申请日：2012-08-24
申请人： Stefan Arndt , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Stefan Arndt , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30486 , G06F17/30315 , G06F17/3033 , G06F17/30466 , G06F17/30498
摘要： Embodiments of the present invention provide a database processing system for efficient partitioning of a database table with column-major layout for executing one or more join operations. One embodiment comprises a method for partitioning a database table with column-major layout, partitioning only the join-columns by limiting the partitions by size and number, executing one or more join operations for joining the partitioned columns, and optionally de-partitioning the join result to the original order by sequentially writing and randomly reading table values using P cursors.

6. 发明授权

US09535940B2 Intra-block partitioning for database management 有权
标题翻译：用于数据库管理的块内分区
公开(公告)号：US09535940B2
公开(公告)日：2017-01-03
申请号：US13599007
申请日：2012-08-30
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.
摘要翻译：用于存储数据库信息的方法包括以列主要顺序存储具有数据值的表。数据值存储在块列表中。该方法还包括根据表中的序列顺序向表的每列中的每个数据值分配元组序列号（TSN）。在表的多个列上彼此对应的数据值具有等效的TSN。该方法还包括基于数据值的表示将每个数据值分配给分区。该方法还包括为每个数据值分配元组映射值。元组映射值标识每个数据值所在的分区。

7. 发明授权

US08782102B2 Compact aggregation working areas for efficient grouping and aggregation using multi-core CPUs 失效
标题翻译：紧凑的聚合工作区，用于使用多核CPU进行有效的分组和聚合
公开(公告)号：US08782102B2
公开(公告)日：2014-07-15
申请号：US12889789
申请日：2010-09-24
申请人： Lin Qiao , Vijayshankar Raman , Frederick R Reiss
发明人： Lin Qiao , Vijayshankar Raman , Frederick R Reiss
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/30489
摘要： A system is described for creating compact aggregation working areas for efficient grouping and aggregation using multi-core CPUs. The system implements operations including computing a running aggregate for a group within a business intelligence (BI) query, and identifying a location to store running aggregate information within an aggregation working area of a cache. The aggregation working area includes first and second data structures. The first data structure stores running aggregate information that is associated with a group that is accessed frequently relative to a threshold. The second data structure stores running aggregate information that is associated with a group that is accessed infrequently relative to the threshold. The operations also include storing the running aggregate information in either the first or second data structure of the aggregation working area based on a characterization of the group as a frequently or infrequently accessed group.
摘要翻译：描述了一种系统，用于创建紧凑的聚合工作区域，以便使用多核CPU进行有效的分组和聚合。系统实现操作，包括计算商业智能（BI）查询中的组的运行聚合，以及标识在高速缓存的聚合工作区域内存储运行聚合信息的位置。聚合工作区包括第一和第二数据结构。第一数据结构存储与经常相对于阈值被访问的组相关联的运行聚合信息。第二数据结构存储与相对于阈值不经常访问的组相关联的运行聚合信息。所述操作还包括基于所述组的特征化将所述运行的聚合信息存储在所述聚合工作区域的第一或第二数据结构中，作为频繁或不经常访问的组。

8. 发明申请

US20140006380A1 EFFICIENT PARTITIONED JOINS IN A DATABASE WITH COLUMN-MAJOR LAYOUT 审中-公开
标题翻译：数据库中高效的分层连接与主要布局
公开(公告)号：US20140006380A1
公开(公告)日：2014-01-02
申请号：US13594200
申请日：2012-08-24
申请人： Stefan ARNDT , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Stefan ARNDT , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30486 , G06F17/30315 , G06F17/3033 , G06F17/30466 , G06F17/30498
摘要： Embodiments of the present invention provide a database processing system for efficient partitioning of a database table with column-major layout for executing one or more join operations. One embodiment comprises a method for partitioning a database table with column-major layout, partitioning only the join-columns by limiting the partitions by size and number, executing one or more join operations for joining the partitioned columns, and optionally de-partitioning the join result to the original order by sequentially writing and randomly reading table values using P cursors.
摘要翻译：本发明的实施例提供了一种数据库处理系统，用于对具有用于执行一个或多个连接操作的列主要布局的数据库表进行高效分区。一个实施例包括用于对具有列主要布局的数据库表进行分区的方法，仅通过限制分区的大小和数量来分隔连接列，执行用于加入分区列的一个或多个连接操作，以及可选地去分割连接通过顺序写入并使用P光标随机读取表值，从而达到原始顺序。

9. 发明申请

US20130325901A1 INTRA-BLOCK PARTITIONING FOR DATABASE MANAGEMENT 审中-公开
标题翻译：数据库管理的内部分区
公开(公告)号：US20130325901A1
公开(公告)日：2013-12-05
申请号：US13599007
申请日：2012-08-30
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information, including: storing a table having data values in a column major order, wherein the data values are stored in a list of blocks, assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table, wherein data values that correspond to each other across a plurality of columns of the table have equivalent TSNs; assigning each data value to a partition based on a representation of the data value; and assigning a tuple map value to each data value, wherein the tuple map value identifies the partition in which each data value is located.
摘要翻译：一种用于存储数据库信息的方法，包括：存储具有列主要顺序的数据值的表，其中数据值被存储在块列表中，将元组序列号（TSN）分配给每个列的每个列中的每个数据值根据表中的序列顺序表，其中在表的多个列上彼此对应的数据值具有等效的TSN; 基于数据值的表示将每个数据值分配给分区; 以及向每个数据值分配元组映射值，其中所述元组映射值标识每个数据值所在的分区。

10. 发明申请

US20130325900A1 INTRA-BLOCK PARTITIONING FOR DATABASE MANAGEMENT 有权
标题翻译：数据库管理的内部分区
公开(公告)号：US20130325900A1
公开(公告)日：2013-12-05
申请号：US13485707
申请日：2012-05-31
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.
摘要翻译：用于存储数据库信息的方法包括以列主要顺序存储具有数据值的表。数据值存储在块列表中。该方法还包括根据表中的序列顺序向表的每列中的每个数据值分配元组序列号（TSN）。在表的多个列上彼此对应的数据值具有等效的TSN。该方法还包括基于数据值的表示将每个数据值分配给分区。该方法还包括为每个数据值分配元组映射值。元组映射值标识每个数据值所在的分区。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式