利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

45 条记录 (耗时 0.022 秒)

    Method and apparatus for selecting an optimal delete-safe compression method on list of delta encoded integers
    4.
    发明授权
    Method and apparatus for selecting an optimal delete-safe compression method on list of delta encoded integers 有权
    用于在增量编码整数列表上选择最佳删除安全压缩方法的方​​法和装置

    公开(公告)号：US08990173B2

    公开(公告)日：2015-03-24

    申请号：US12056979

    申请日：2008-03-27

    申请人： Bishwaranjan Bhattacharjee ,  Lipyeow Lim ,  Timothy Ray Malkemus ,  George Andrei Mihaila

    发明人： Bishwaranjan Bhattacharjee ,  Lipyeow Lim ,  Timothy Ray Malkemus ,  George Andrei Mihaila

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

    CPC分类号： H03M7/30

    摘要： Techniques are disclosed for selecting a delete-safe compression method for a plurality of delta encoded data values (e.g., delta encoded integers or deltas). For example, a computer-implemented method for selecting an optimal delete-safe compression algorithm from among two or more compression algorithms for use on a plurality of delta encoded data values includes the following steps. The maximum number of data values eliminated by each of the two or more compression algorithms is computed. For the plurality of delta encoded data values to be compressed, the minimum size of the plurality of delta encoded data values before compression thereof is computed. A delete-safe threshold value is computed based on the minimum size of the plurality of delta encoded data values. Then, the compression algorithm is selected from the two or more compression algorithms that achieves the delete-safe threshold value.

    摘要翻译： 公开了用于为多个增量编码的数据值（例如，增量编码的整数或三角形）选择删除安全的压缩方法的技术。 例如，用于从用于多个增量编码数据值的两个或更多个压缩算法中选择最佳删除安全压缩算法的计算机实现的方法包括以下步骤。 计算由两个或更多个压缩算法中的每一个消除的数据值的最大数目。 对于要压缩的多个delta编码数据值，计算其压缩之前的多个Δ编码数据值的最小大小。 基于多个增量编码数据值的最小大小来计算删除安全阈值。 然后，从实现删除安全​​阈值的两个或更多个压缩算法中选择压缩算法。

    Method for accelerating range queries using periodic monotonic properties of non-monotonic functions
    5.
    发明授权
    Method for accelerating range queries using periodic monotonic properties of non-monotonic functions 有权
    使用非单调函数的周期性单调性来加速范围查询的方法

    公开(公告)号：US07516117B2

    公开(公告)日：2009-04-07

    申请号：US11509050

    申请日：2006-08-24

    申请人： Bishwaranjan Bhattacharjee ,  Timothy Ray Malkemus ,  Ioana Roxana Stanoi

    发明人： Bishwaranjan Bhattacharjee ,  Timothy Ray Malkemus ,  Ioana Roxana Stanoi

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

    CPC分类号： G06F17/30442 ,  Y10S707/99932 ,  Y10S707/99933

    摘要： A method for accelerating range queries using periodic monotonic properties of non-monotonic functions including mapping a base column x to an existing index on a column y that is correlated with column x through a periodic piecewise monotonic function F(x), rewriting an index construction statement to force the existing index on column y to track a periodic piecewise monotonic property by assigning identical values of F(x) to different periods to different ranges to create an annotated index, and rewriting range queries over the annotated index on F(x) by modifying a derived predicate.

    摘要翻译： 一种使用非单调函数的周期性单调性质加速范围查询的方法，包括通过周期性片段单调函数F（x）将基列x映射到与列x相关的列y上的现有索引，重写索引结构 声明强制列y上的现有索引通过将相同的F（x）值分配给不同的周期到不同的范围来跟踪周期性片段单调属性来创建注释索引，并通过F（x）上的注释索引重写范围查询， 通过修改派生谓词。

    METHOD AND SYSTEM FOR UTILIZING A HIERARCHICAL BITMAP STRUCTURE TO PROVIDE A FAST AND RELIABLE MECHANISM TO REPRESENT LARGE DELETED DATA SETS IN RELATIONAL DATABASES
    6.
    发明申请
    METHOD AND SYSTEM FOR UTILIZING A HIERARCHICAL BITMAP STRUCTURE TO PROVIDE A FAST AND RELIABLE MECHANISM TO REPRESENT LARGE DELETED DATA SETS IN RELATIONAL DATABASES 有权
    利用分层比特质结构提供快速可靠的机制来表示相关数据库中的大量删除数据集的方法和系统

    公开(公告)号：US20080208802A1

    公开(公告)日：2008-08-28

    申请号：US11679076

    申请日：2007-02-26

    申请人： Bishwaranjan Bhattacharjee ,  Timothy Ray Malkemus ,  Sean W. McKeough ,  Jo-anne Mona Louise Kirton ,  Sherman Lau

    发明人： Bishwaranjan Bhattacharjee ,  Timothy Ray Malkemus ,  Sean W. McKeough ,  Jo-anne Mona Louise Kirton ,  Sherman Lau

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30327

    摘要： A method and system utilizes a hierarchical bitmap structure to represent deleted data sets. Each level in the hierarchical bitmap structure may have progressively larger size and represent finer granularity of number of data blocks than its parent level. A method in one aspect may comprise allocating a first level bitmap having size equal to a register on a processor, each bit in the first level bitmap representing a plurality of blocks of data in a database, and allocating one or more pointers corresponding to said plurality of bits in the first level bitmap, said one or more pointers being allocated to point to a sub bitmap generated after a data block is deleted but before the index corresponding to the data block is cleaned.

    摘要翻译： 一种方法和系统利用分层位图结构来表示删除的数据集。 分级位图结构中的每个级别可以具有逐渐更大的大小并且表示比其父级别更多的数据块的粒度。 一方面的方法可以包括：分配具有等于处理器上的寄存器的大小的第一级位图，第一级位图中的每一位表示数据库中的多个数据块，并且分配与所述多个对应的一个或多个指针 所述一个或多个指针被分配以指向在数据块被删除之后但在与数据块相对应的索引被清除之前生成的子位图。

    Method and apparatus for encoding list of variable length structures to support bi-directional scans
    7.
    发明授权
    Method and apparatus for encoding list of variable length structures to support bi-directional scans 失效
    用于编码可变长度结构列表以支持双向扫描的方法和装置

    公开(公告)号：US08126929B2

    公开(公告)日：2012-02-28

    申请号：US12057012

    申请日：2008-03-27

    申请人： Bishwaranjan Bhattacharjee ,  Lipyeow Lim ,  Timothy Ray Malkemus ,  George Andrei Mihaila

    发明人： Bishwaranjan Bhattacharjee ,  Lipyeow Lim ,  Timothy Ray Malkemus ,  George Andrei Mihaila

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30958 ,  G06F17/30286

    摘要： Techniques are disclosed for encoding a variable length structure such that it facilitates forward and reverse scans of a list of such structures as needed. While the techniques are applicable to a wide variety of applications, they are particularly well-suited for use with structures such as those found in compressed database indexes. For example, a computer-implemented method for processing one or more variable length data structures includes the following steps. Each variable length data structure is obtained. Each variable length structure comprises one or more data block. A variable length encoding process is applied to the one or more blocks of each variable length data structure which comprises setting a continuation data value in each block to a first value or a second value, wherein the setting of the continuation data values enables bi-directional scanning of each variable length structure.

    摘要翻译： 公开了用于编码可变长度结构的技术，使得其有助于正向和反向扫描所需的这种结构的列表。 虽然这些技术适用于各种各样的应用，但它们特别适用于诸如在压缩数据库索引中发现的结构。 例如，用于处理一个或多个可变长度数据结构的计算机实现的方法包括以下步骤。 获得每个可变长度数据结构。 每个可变长度结构包括一个或多个数据块。 可变长度编码处理被应用于每个可变长度数据结构的一个或多个块，其包括将每个块中的连续数据值设置为第一值或第二值，其中，连续数据值的设置允许双向 扫描每个可变长度结构。

    Method and apparatus for efficiently supporting multiple one-time table access operations in a hierarchical memory setting
    9.
    发明授权
    Method and apparatus for efficiently supporting multiple one-time table access operations in a hierarchical memory setting 失效
    用于在分层存储器设置中有效地支持多个一次表访问操作的方法和装置

    公开(公告)号：US07512747B2

    公开(公告)日：2009-03-31

    申请号：US11404966

    申请日：2006-04-14

    申请人： Bishwaranjan Bhattacharjee ,  Christian Alexander Lang ,  Timothy Ray Malkemus

    发明人： Bishwaranjan Bhattacharjee ,  Christian Alexander Lang ,  Timothy Ray Malkemus

    IPC分类号： G06F12/06

    CPC分类号： G06F13/385 ,  G06F12/0842

    摘要： An embodiment of the present invention provides a computer system including a first memory and a second memory, where the first memory is substantially faster than the second memory. A method includes steps of: inspecting a request queue for block requests from a plurality of concurrent calling processes, the request queue including a plurality of block requests not yet processed by any of the plurality of concurrent calling processes; retrieving one of the plurality of block requests, wherein each block is accessed at most once by each calling process; determining whether the retrieved block request can be fulfilled from the first memory; and returning the retrieved block to the calling process whose state indicates that the block is needed if the retrieved block request can be fulfilled from the first memory.

    摘要翻译： 本发明的实施例提供一种包括第一存储器和第二存储器的计算机系统，其中第一存储器比第二存储器快得多。 一种方法包括以下步骤：检查来自多个并发呼叫进程的块请求的请求队列，所述请求队列包括尚未由多个并发呼叫进程中的任何一个处理的多个块请求; 检索所述多个块请求中的一个，其中每个调用进程最多访问一个块; 确定所述检索到的块请求是否可以从所述第一存储器被满足; 并且将检索到的块返回到调用进程，其状态指示如果从第一存储器可以满足检索到的块请求，则需要该块。