公开(公告)号：US08676865B2

公开(公告)日：2014-03-18

申请号：US12123598

申请日：2008-05-20

申请人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

发明人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

IPC分类号： G06F7/00 ,  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元相交处理。 懒惰段合并包括从每个列表开始，这些列是完全未合并的段的并集，使得到给定列表中的查找涉及到给定列表的每个段的单独查找。 该方法在执行延迟段合并时根据谓词与列表相交，使得懒惰段合并仅读取相交所需的每个段的那些部分。 当相交进行和查找被执行时，相交的选择性地将段合在一起，基于与合并成本的成本效益分析相比，通过减少多个查找产生的收益。

公开(公告)号：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元相交处理。 懒惰段合并包括从每个列表开始，这些列是完全未合并的段的并集，使得到给定列表中的查找涉及到给定列表的每个段的单独查找。 该方法在执行延迟段合并时根据谓词与列表相交，使得懒惰段合并仅读取相交所需的每个段的那些部分。 当相交进行和查找被执行时，相交的选择性地将段合在一起，基于与合并成本的成本效益分析相比，通过减少多个查找产生的收益。

公开(公告)号：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集合。

公开(公告)号：US07885953B2

公开(公告)日：2011-02-08

申请号：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分类号： G06F17/30 ,  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集合。

公开(公告)号：US09069810B2

公开(公告)日：2015-06-30

申请号：US13558178

申请日：2012-07-25

申请人： Min-Soo Kim ,  Lin Qiao ,  Vijayshankar Raman ,  Eugene J. Shekita

发明人： Min-Soo Kim ,  Lin Qiao ,  Vijayshankar Raman ,  Eugene J. Shekita

IPC分类号： G06F17/30 ,  G06F12/08

CPC分类号： G06F17/3033 ,  G06F12/0802 ,  G06F17/30097 ,  G06F17/30109 ,  G06F17/30864 ,  G06F2212/1044 ,  G06F2212/465

摘要： System, method and computer program products for storing data by computing a plurality of hash functions of data values in a data item, and determining a corresponding memory location for one of the plurality of hash functions of data values in the data item. Each memory location is of a cacheline size wherein a data item is stored in a memory location. Each memory location can store a plurality of data items. A key portion of all data items is contiguously stored within the memory location, and a payload portion is contiguously stored within the memory location. Payload portions are packed as bit-aligned in a fixed-sized memory location, comprising a bucket in a bucketized hash table, each bucket sized to store multiple key portions and payload portions that are packed as bit-aligned in a fixed-sized bucket. Corresponding key portions are stored as compressed keys in said fixed-sized bucket.

摘要翻译： 用于通过计算数据项中的数据值的多个散列函数来存储数据的系统，方法和计算机程序产品，以及确定数据项中数据值的多个哈希函数之一的相应存储器位置。 每个存储器位置具有高速缓存行大小，其中数据项被存储在存储器位置中。 每个存储器位置可以存储多个数据项。 所有数据项的关键部分被连续地存储在存储器位置内，并且有效载荷部分被连续地存储在存储器位置内。 有效载荷部分在固定大小的存储器位置中以比特对齐的方式打包，包括桶形哈希表中的桶，每个桶的大小设置为存储多个密钥部分和在固定大小的桶中以比特排列方式打包的有效载荷部分。 对应的密钥部分作为压缩密钥存储在所述固定大小的桶中。

公开(公告)号：US08862571B2

公开(公告)日：2014-10-14

申请号：US13537665

申请日：2012-06-29

申请人： Ronald J. Barber ,  Lin Qiao ,  Vijayshankar Raman ,  Richard S. Sidle

发明人： Ronald J. Barber ,  Lin Qiao ,  Vijayshankar Raman ,  Richard S. Sidle

IPC分类号： G06F7/00

CPC分类号： G06F17/30315 ,  G06F17/30463

摘要： Embodiments of the present invention provide query processing for column stores by accumulating table record attributes during application of query plan operators on a table. The attributes and associated attribute values are compacted when said attribute values are to be consumed for an operation in the query plan, during the execution of the query plan. Table column record values are materialized late in query plan execution.

公开(公告)号：US08856103B2

公开(公告)日：2014-10-07

申请号：US13587377

申请日：2012-08-16

申请人： Ronald J. Barber ,  Lin Qiao ,  Vijayshankar Raman ,  Richard S. Sidle

发明人： Ronald J. Barber ,  Lin Qiao ,  Vijayshankar Raman ,  Richard S. Sidle

IPC分类号： G06F7/00

CPC分类号： G06F17/30315 ,  G06F17/30463

摘要： Embodiments of the present invention provide query processing for column stores by accumulating table record attributes during application of query plan operators on a table. The attributes and associated attribute values are compacted when said attribute values are to be consumed for an operation in the query plan, during the execution of the query plan. Table column record values are materialized late in query plan execution.

摘要翻译： 本发明的实施例通过在表上的查询计划操作符应用期间累加表记录属性来提供列存储的查询处理。 在执行查询计划期间，当查询计划中的操作要使用所述属性值时，属性和关联的属性值将被压缩。 表列记录值在查询计划执行时间较晚。

公开(公告)号：US08352945B2

公开(公告)日：2013-01-08

申请号：US12539471

申请日：2009-08-11

申请人： Peter J Haas ,  Lin Qiao ,  Vijayshankar Raman ,  Frederick R Reiss

发明人： Peter J Haas ,  Lin Qiao ,  Vijayshankar Raman ,  Frederick R Reiss

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30445

摘要： A computer-implemented method for scan sharing across multiple cores in a business intelligence (BI) query. The method includes receiving a plurality of BI queries, storing a block of data in a first cache, scanning the block of data in the first cache against a first batch of queries on a first processor core, and scanning the block of data against a second batch of queries on a second processor core. The first cache is associated with a first processor core. The block of data includes a subset of data stored in an in-memory database (IMDB). The first batch of queries includes two or more of the BI queries. The second batch of queries includes one or more of the BI queries that are not included in the first batch of queries.

摘要翻译： 一种用于在商业智能（BI）查询中跨多个核心进行扫描共享的计算机实现的方法。 该方法包括接收多个BI查询，将数据块存储在第一高速缓存中，针对第一处理器核心上的第一批查询扫描第一高速缓存中的数据块，并且针对第二缓冲区扫描数据块 批次在第二个处理器核心上的查询。 第一缓存与第一处理器核心相关联。 数据块包括存储在内存数据库（IMDB）中的数据子集。 第一批查询包括两个或多个BI查询。 第二批查询包括未包含在第一批查询中的一个或多个BI查询。

公开(公告)号：US20120078980A1

公开(公告)日：2012-03-29

申请号：US12889789

申请日：2010-09-24

申请人： Lin Qiao ,  Vijayshankar Raman ,  Frederick R. Reiss

发明人： Lin Qiao ,  Vijayshankar Raman ,  Frederick R. Reiss

IPC分类号： G06F17/30 ,  G06F12/08

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）查询中的组的运行聚合，以及标识在高速缓存的聚合工作区域内存储运行聚合信息的位置。 聚合工作区包括第一和第二数据结构。 第一数据结构存储与经常相对于阈值被访问的组相关联的运行聚合信息。 第二数据结构存储与相对于阈值不经常访问的组相关联的运行聚合信息。 所述操作还包括基于所述组的特征化将所述运行的聚合信息存储在所述聚合工作区域的第一或第二数据结构中，作为频繁或不经常访问的组。

公开(公告)号：US08108401B2

公开(公告)日：2012-01-31

申请号：US12057979

申请日：2008-03-28

申请人： Lin Qiao ,  Vijayshankar Raman ,  Garret Frederick Swart

发明人： Lin Qiao ,  Vijayshankar Raman ,  Garret Frederick Swart

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F17/30489

摘要： A novel method is described for applying various hash methods used in conjunction with a query with a Group By clause. A plurality of drawers are identified, wherein each of the drawers is made up of a collection of cells from a single partition of a Group By column and each of the drawers being defined for a specific query. A separate hash table is independently computed for each of the drawers and a hashing scheme (picked from among a plurality of hashing schemes) is independently applied for each of the drawers.

摘要翻译： 描述了一种新颖的方法来应用与Group By子句一起使用的查询结合使用的各种哈希方法。 识别多个抽屉，其中每个抽屉由来自分组列的单个分区的单元的集合组成，并且每个抽屉被定义用于特定查询。 对于每个抽屉独立地计算单独的散列表，并且对于每个抽屉独立地应用散列方案（从多个散列方案中挑选）。