利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

32 条记录 (耗时 0.021 秒)

    CLIENT-BASED INDEX ADVISOR
    1.
    发明申请
    CLIENT-BASED INDEX ADVISOR 失效
    基于客户的索引顾问

    公开(公告)号：US20100257151A1

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

    申请号：US12416208

    申请日：2009-04-01

    申请人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

    发明人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

    IPC分类号： G06F17/30

    CPC分类号： G06Q10/06 ,  G06F17/30321 ,  G06F17/3056

    摘要： A common interface to manage heterogeneous databases and develop enterprise class applications is provided. In particular, it is shown that a client-based system and method can: (a) provide a uniform interface for the DBA or the application developer to use across all the database deployments, (b) provide flexibility in the number and kinds of scenarios it can be used, and finally (c) reduce the total cost of ownership for the enterprise.

    摘要翻译： 提供了管理异构数据库和开发企业级应用程序的通用界面。 特别地，显示基于客户端的系统和方法可以：（a）为DBA或应用程序开发人员提供统一的接口，以便在所有数据库部署中使用，（b）在场景数量和种类方面提供灵活性 可以使用，最后（c）降低企业的总体拥有成本。

    Client-based index advisor
    2.
    发明授权
    Client-based index advisor 失效
    基于客户的指数顾问

    公开(公告)号：US08458167B2

    公开(公告)日：2013-06-04

    申请号：US12416208

    申请日：2009-04-01

    申请人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

    发明人： Guy Maring Lohman ,  Lin Qiao ,  Sandeep Tata

    IPC分类号： G06F17/30

    CPC分类号： G06Q10/06 ,  G06F17/30321 ,  G06F17/3056

    摘要： A common interface to manage heterogeneous databases and develop enterprise class applications is provided. In particular, it is shown that a client-based system and method can: (a) provide a uniform interface for the DBA or the application developer to use across all the database deployments, (b) provide flexibility in the number and kinds of scenarios it can be used, and finally (c) reduce the total cost of ownership for the enterprise.

    摘要翻译： 提供了管理异构数据库和开发企业级应用程序的通用界面。 特别地，显示基于客户端的系统和方法可以：（a）为DBA或应用程序开发人员提供统一的接口，以便在所有数据库部署中使用，（b）在场景数量和种类方面提供灵活性 可以使用，最后（c）降低企业的总体拥有成本。

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

    OFF-LOADING STAR JOIN OPERATIONS TO A STORAGE SERVER
    6.
    发明申请
    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集合。

    SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR REDUCING HASH TABLE WORKING-SET SIZE FOR IMPROVED LATENCY AND SCALABILITY IN A PROCESSING SYSTEM
    7.
    发明申请
    SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR REDUCING HASH TABLE WORKING-SET SIZE FOR IMPROVED LATENCY AND SCALABILITY IN A PROCESSING SYSTEM 有权
    系统，方法和计算机程序产品，用于减少处理系统中改进的延迟和可扩展性的哈希表工作尺寸

    公开(公告)号：US20140032569A1

    公开(公告)日：2014-01-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

    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.

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

    PREDICATE PUSHDOWN WITH LATE MATERIALIZATION IN DATABASE QUERY PROCESSING
    9.
    发明申请
    PREDICATE PUSHDOWN WITH LATE MATERIALIZATION IN DATABASE QUERY PROCESSING 有权
    在数据库查询处理中预先推出最新的资料

    公开(公告)号：US20140006381A1

    公开(公告)日：2014-01-02

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

    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.

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

    Systems, methods and computer program products for reducing hash table working-set size for improved latency and scalability in a processing system
    10.
    发明授权
    Systems, methods and computer program products for reducing hash table working-set size for improved latency and scalability in a processing system 有权
    用于减少散列表工作集大小的系统，方法和计算机程序产品，以提高处理系统中的延迟和可扩展性

    公开(公告)号：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.

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