利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.023 秒)

    Organizing portions of a cascading index on disk
    1.
    发明授权
    Organizing portions of a cascading index on disk 有权
    组织磁盘上级联索引的部分

    公开(公告)号：US08346778B2

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

    申请号：US12469635

    申请日：2009-05-20

    申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    IPC分类号： G06F17/30

    CPC分类号： G06F11/1474 ,  G06F17/30

    摘要： Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.

    摘要翻译： 提供了用于压缩索引中的分支节点的技术。 分支节点可以是也包括一个或多个日志索引的多级索引的主索引的一部分。 可以生成布隆过滤器并且与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。

    CASCADING INDEX COMPRESSION
    2.
    发明申请
    CASCADING INDEX COMPRESSION 有权

    公开(公告)号：US20090292947A1

    公开(公告)日：2009-11-26

    申请号：US12469637

    申请日：2009-05-20

    申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    IPC分类号： G06F11/07 ,  G06F17/30

    CPC分类号： G06F11/1474 ,  G06F17/30

    摘要： Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.

    摘要翻译： 提供了维护级联索引的技术。 在一种方法中，一个或多个分支节点压缩技术被应用于级联索引的主索引。 在一种方法中，生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。 在一种方法中，响应于级联索引的两个级别之间的合并操作，生成新的重做记录。 新的重做记录包括（a）受合并操作影响的块的一个或多个地址，（b）数据被“下推”到级联索引的较低级，以及（c）一个或多个地址 作为合并操作的结果写入磁盘存储的块。

    Querying a cascading index that avoids disk accesses
    3.
    发明授权
    Querying a cascading index that avoids disk accesses 有权
    查询避免磁盘访问的级联索引

    公开(公告)号：US08595248B2

    公开(公告)日：2013-11-26

    申请号：US12469637

    申请日：2009-05-20

    申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    IPC分类号： G06F17/30

    CPC分类号： G06F11/1474 ,  G06F17/30

    摘要： Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.

    摘要翻译： 提供了维护级联索引的技术。 在一种方法中，一个或多个分支节点压缩技术被应用于级联索引的主索引。 在一种方法中，生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。 在一种方法中，响应于级联索引的两个级别之间的合并操作，生成新的重做记录。 新的重做记录包括（a）受合并操作影响的块的一个或多个地址，（b）数据被“下推”到级联索引的较低级，以及（c）一个或多个地址 作为合并操作的结果写入磁盘存储的块。

    CASCADING INDEX COMPRESSION
    4.
    发明申请
    CASCADING INDEX COMPRESSION 有权

    公开(公告)号：US20090292679A1

    公开(公告)日：2009-11-26

    申请号：US12469635

    申请日：2009-05-20

    申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    IPC分类号： G06F17/30

    CPC分类号： G06F11/1474 ,  G06F17/30

    摘要： Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.

    摘要翻译： 提供了用于压缩索引中的分支节点的技术。 分支节点可以是也包括一个或多个日志索引的多级索引的主索引的一部分。 可以生成布隆过滤器并且与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。

    Online index builds and rebuilds without blocking locks
    6.
    发明授权
    Online index builds and rebuilds without blocking locks 有权
    在线索引构建和重建而不阻止锁定

    公开(公告)号：US08195702B2

    公开(公告)日：2012-06-05

    申请号：US11830545

    申请日：2007-07-30

    申请人： Shrikanth Shankar ,  Ramesh Kumar ,  Krishna Kunchithapadam ,  Ananth Raghavan ,  Dheeraj Pandey ,  Amit Ganesh ,  Joy M. Forsythe

    发明人： Shrikanth Shankar ,  Ramesh Kumar ,  Krishna Kunchithapadam ,  Ananth Raghavan ,  Dheeraj Pandey ,  Amit Ganesh ,  Joy M. Forsythe

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30336

    摘要： Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.

    摘要翻译： 提供了技术来处理CREATE INDEX语句，以避免基础表上的一个或多个锁。 这种陈述的处理可分为建立阶段和合作阶段。 在构建阶段，创建并发布日志表。 该表的快照是在最后一个DML事务（在发布日志表时挂起的）提交之后获得的。 索引是基于快照的表的状态构建的。 索引构建时对表的任何更改记录在日记表中。 在合作阶段，该指数部分公布。 随后的DML语句确定日记表表中的任何更改是否会影响与后续DML语句相同的数据。 如果是这样，那么这些更改将应用​​于后面跟随的DML语句的索引。

    ONLINE INDEX BUILDS AND REBUILDS WITHOUT BLOCKING LOCKS
    8.
    发明申请
    ONLINE INDEX BUILDS AND REBUILDS WITHOUT BLOCKING LOCKS 有权
    在线索引建立和重建，没有阻塞锁

    公开(公告)号：US20090037366A1

    公开(公告)日：2009-02-05

    申请号：US11830545

    申请日：2007-07-30

    申请人： Shrikanth Shankar ,  Ramesh Kumar ,  Krishna Kunchithapadam ,  Ananth Raghavan ,  Dheeraj Pandey ,  Amit Ganesh ,  Joy M. Forsythe

    发明人： Shrikanth Shankar ,  Ramesh Kumar ,  Krishna Kunchithapadam ,  Ananth Raghavan ,  Dheeraj Pandey ,  Amit Ganesh ,  Joy M. Forsythe

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30336

    摘要： Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.

    摘要翻译： 提供了技术来处理CREATE INDEX语句，以避免基础表上的一个或多个锁。 这种陈述的处理可分为建立阶段和合作阶段。 在构建阶段，创建并发布日志表。 该表的快照是在最后一个DML事务（在发布日志表时挂起的）提交之后获得的。 索引是基于快照的表的状态构建的。 索引构建时对表的任何更改记录在日记表中。 在合作阶段，该指数部分公布。 随后的DML语句确定日记表表中的任何更改是否影响与后续DML语句相同的数据。 如果是这样，那么这些更改将应用​​于后面跟随的DML语句的索引。

    Method and system for state maintenance of a large object
    9.
    发明授权
    Method and system for state maintenance of a large object 有权
    大型物体的状态维护方法和系统

    公开(公告)号：US08775479B2

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

    申请号：US11830642

    申请日：2007-07-30

    申请人： Nirman Kumar ,  Kaan Baloglu ,  Dheeraj Pandey ,  Krishna Kunchithapadam ,  Sujatha Muthulingam ,  Vipin Gokhale ,  Bharat Baddepudi

    发明人： Nirman Kumar ,  Kaan Baloglu ,  Dheeraj Pandey ,  Krishna Kunchithapadam ,  Sujatha Muthulingam ,  Vipin Gokhale ,  Bharat Baddepudi

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30318 ,  G06F17/3048

    摘要： A method, system and computer program product are described for state maintenance of a large object. In one approach, the method, system and computer program product perform by associating one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and storing data for the large object from the one or more buffers in one or more sets of contiguous blocks.In one approach, a system performs state maintenance of a large object with a cache that associates one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and the cache stores large object data from the one or more buffers in one or more sets of contiguous blocks in storage.

    摘要翻译： 描述了用于大对象的状态维护的方法，系统和计算机程序产品。 在一种方法中，方法，系统和计算机程序产品通过将一个或多个缓冲器与涉及大对象的事务相关联来执行，可以在事务期间使用一个或多个缓冲区来访问大对象数据，并且存储大的数据 一个或多个连续块集合中的一个或多个缓冲器的对象。 在一种方法中，系统使用将一个或多个缓冲器与涉及大对象的事务相关联的高速缓存执行大对象的状态维护，可以在事务期间使用一个或多个缓冲区来访问大对象数据，并且高速缓存 在存储中的一个或多个连续块集合中存储来自一个或多个缓冲器的大对象数据。

    METHOD AND SYSTEM FOR STATE MAINTENANCE OF A LARGE OBJECT
    10.
    发明申请
    METHOD AND SYSTEM FOR STATE MAINTENANCE OF A LARGE OBJECT 有权
    一种大型物体的状态维护方法与系统

    公开(公告)号：US20090037495A1

    公开(公告)日：2009-02-05

    申请号：US11830642

    申请日：2007-07-30

    申请人： Nirman Kumar ,  Kaan Baloglu ,  Dheeraj Pandey ,  Krishna Kunchithapadam ,  Sujatha Muthulingam ,  Vipin Gokhale ,  Bharat Baddepudi

    发明人： Nirman Kumar ,  Kaan Baloglu ,  Dheeraj Pandey ,  Krishna Kunchithapadam ,  Sujatha Muthulingam ,  Vipin Gokhale ,  Bharat Baddepudi

    IPC分类号： G06F12/16

    CPC分类号： G06F17/30318 ,  G06F17/3048

    摘要： A method, system and computer program product are described for state maintenance of a large object. In one approach, the method, system and computer program product perform by associating one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and storing data for the large object from the one or more buffers in one or more sets of contiguous blocks.In one approach, a system performs state maintenance of a large object with a cache that associates one or more buffers with a transaction involving a large object, the large object data may be accessed using the one or more buffers during the transaction, and the cache stores large object data from the one or more buffers in one or more sets of contiguous blocks in storage.

    摘要翻译： 描述了用于大对象的状态维护的方法，系统和计算机程序产品。 在一种方法中，方法，系统和计算机程序产品通过将一个或多个缓冲器与涉及大对象的事务相关联来执行，可以在事务期间使用一个或多个缓冲区来访问大对象数据，并且存储大的数据 一个或多个连续块集合中的一个或多个缓冲器的对象。 在一种方法中，系统使用将一个或多个缓冲器与涉及大对象的事务相关联的高速缓存执行大对象的状态维护，可以在事务期间使用一个或多个缓冲区来访问大对象数据，并且高速缓存 在存储中的一个或多个连续块集合中存储来自一个或多个缓冲器的大对象数据。