利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

83 条记录 (耗时 0.016 秒)

    APPLYING VARIOUS HASH METHODS USED IN CONJUNCTION WITH A QUERY WITH A GROUP BY CLAUSE
    11.
    发明申请
    APPLYING VARIOUS HASH METHODS USED IN CONJUNCTION WITH A QUERY WITH A GROUP BY CLAUSE 失效
    应用与按组合查询的各种哈希方法

    公开(公告)号：US20090249023A1

    公开(公告)日：2009-10-01

    申请号：US12057979

    申请日：2008-03-28

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

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

    IPC分类号： G06F12/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子句一起使用的查询结合使用的各种哈希方法。 识别多个抽屉，其中每个抽屉由来自分组列的单个分区的单元的集合组成，并且每个抽屉被定义用于特定查询。 对于每个抽屉独立地计算单独的散列表，并且对于每个抽屉独立地应用散列方案（从多个散列方案中挑选）。

    DYNAMIC AND SELECTIVE DATA SOURCE BINDING THROUGH A METAWRAPPER
    12.
    发明申请
    DYNAMIC AND SELECTIVE DATA SOURCE BINDING THROUGH A METAWRAPPER 失效
    动态和选择性的数据源通过一个元器件绑定

    公开(公告)号：US20070294323A1

    公开(公告)日：2007-12-20

    申请号：US11848304

    申请日：2007-08-31

    申请人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

    发明人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30575 ,  Y10S707/99933 ,  Y10S707/99955

    摘要： A system, method, and program storage device implementing the method, for integrating data in a database management system, wherein the method comprises grouping data sources and replicas of the data sources that provide analogous data into a common logical domain; writing application queries against the common logical domain; selecting a correct set of replicas of the data sources and a query-execution strategy for combining a content of the correct set of replicas of the data sources in order to answer the application queries according to query-cost-based optimization; selecting a correct set of data sources according to run-time constraints; shielding the application queries from changes to the data sources by dynamically binding the application queries against the correct sets of data sources and replicas of the data sources; and processing the application queries by generating an optimum query result based on the steps of grouping and shielding.

    摘要翻译： 实现该方法的系统，方法和程序存储设备，用于将数据集成在数据库管理系统中，其中该方法包括将提供类似数据的数据源的数据源和副本分组到公共逻辑域中; 针对公共逻辑域编写应用程序查询; 选择正确的数据源副本和用于组合数据源的正确的副本集合的内容的查询执行策略，以便根据基于查询成本的优化来应答应用查询; 根据运行时限制选择正确的数据源集合; 通过将应用程序查询与数据源的正确数据源和副本集合动态绑定来屏蔽应用程序查询对数据源的更改; 并通过基于分组和屏蔽的步骤产生最佳查询结果来处理应用查询。

    Progressive refinement of a federated query plan during query execution
    13.
    发明申请
    Progressive refinement of a federated query plan during query execution 失效
    查询执行期间联合查询计划的逐步细化

    公开(公告)号：US20070226186A1

    公开(公告)日：2007-09-27

    申请号：US11389596

    申请日：2006-03-24

    申请人： Stephan Ewen ,  Holger Kache ,  Volker Markl ,  Vijayshankar Raman

    发明人： Stephan Ewen ,  Holger Kache ,  Volker Markl ,  Vijayshankar Raman

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463

    摘要： A way for progressively refining a query execution plan during query execution in a federated data system is provided. Re-optimization constraints are placed in the query execution plan during query compilation. When a re-optimization constraint is violated during query execution, a model of the query execution plan is refined using a partially executed query to form a new query execution plan. The new query execution plan is compiled. The compiled new query execution plan is executed.

    摘要翻译： 提供了一种在联合数据系统中查询执行期间逐步完善查询执行计划的方法。 在查询编译期间，重新优化约束被放置在查询执行计划中。 当在查询执行期间违反重新优化约束时，使用部分执行的查询来改进查询执行计划的模型以形成新的查询执行计划。 新的查询执行计划被编译。 执行编译的新查询执行计划。

    Determining validity ranges of query plans based on suboptimality
    15.
    发明授权
    Determining validity ranges of query plans based on suboptimality 有权
    基于次优性确定查询计划的有效范围

    公开(公告)号：US08812486B2

    公开(公告)日：2014-08-19

    申请号：US12028120

    申请日：2008-02-08

    申请人： Volker G. Markl ,  Vijayshankar Raman

    发明人： Volker G. Markl ,  Vijayshankar Raman

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30463 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933

    摘要： A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range. Using a robustness measure provided by a sensitivity analysis and resultant validity range and, query plan sub-optimality detection is simplified, re-optimization is selectively triggered, and robustness information is provided to a system or user performing corrective actions.

    摘要翻译： 提供了一种用于近似输入到最优查询计划的基数域的有效范围的方法。 这种有效范围使用修正的牛顿 - 拉夫逊方法迭代近似，以分别找到最优和替代查询计划的成本函数的根。 Newton-Raphson方法与增加成本函数的根的方法相结合，称为输入基数，从而避免了成本函数中的不连续和不可微性的点。 以这种方式，输入基数保持在可以指定有效范围的域内。 另外，通过对近似有效范围进行的灵敏度分析来确定鲁棒性度量。 使用由灵敏度分析和合成有效范围提供的鲁棒性度量，并且简化了查询计划亚最优检测，重新优化被选择性地触发，并且向执行校正动作的系统或用户提供鲁棒性信息。

    SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR REDUCING HASH TABLE WORKING-SET SIZE FOR IMPROVED LATENCY AND SCALABILITY IN A PROCESSING SYSTEM
    16.
    发明申请
    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
    18.
    发明申请
    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.

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

    AVOIDING THREE-VALUED LOGIC IN PREDICATES ON DICTIONARY-ENCODED DATA
    19.
    发明申请
    AVOIDING THREE-VALUED LOGIC IN PREDICATES ON DICTIONARY-ENCODED DATA 有权
    避免在编码数据上预测三值逻辑

    公开(公告)号：US20120278291A1

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

    申请号：US13544583

    申请日：2012-07-09

    申请人： Peter Bendel ,  Oliver Draese ,  Vijayshankar Raman ,  Knut Stolze

    发明人： Peter Bendel ,  Oliver Draese ,  Vijayshankar Raman ,  Knut Stolze

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30312 ,  H03M7/3088

    摘要： According to one embodiment of the present invention, a method for dictionary encoding data without using three-valued logic is provided. According to one embodiment of the invention, a method includes encoding data in a database table using a dictionary, wherein the data includes values representing NULLs. A query having a predicate is received and the predicate is evaluated on the encoded data, whereby the predicate is evaluated on both the encoded data and on the encoded NULLs.

    摘要翻译： 根据本发明的一个实施例，提供了一种用于字典编码数据而不使用三值逻辑的方法。 根据本发明的一个实施例，一种方法包括使用字典对数据库表中的数据进行编码，其中数据包括表示NULL的值。 接收到具有谓词的查询，并且对编码数据评估谓词，由此在编码数据和编码的NULL上对谓词进行评估。