利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

5 条记录 (耗时 0.026 秒)

    System and method for space management of multidimensionally clustered tables
    3.
    发明授权
    System and method for space management of multidimensionally clustered tables 失效
    多维集群表的空间管理系统和方法

    公开(公告)号：US07765211B2

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

    申请号：US10425781

    申请日：2003-04-29

    申请人： Bishwaranjan Bhattacharjee ,  Leslie A. Cranston ,  Matthew A. Huras ,  Bruce G. Lindsay ,  Timothy R. Malkemus ,  Catherine S. McArthur ,  Sriram K. Padmanabhan ,  Michael J. Winer

    发明人： Bishwaranjan Bhattacharjee ,  Leslie A. Cranston ,  Matthew A. Huras ,  Bruce G. Lindsay ,  Timothy R. Malkemus ,  Catherine S. McArthur ,  Sriram K. Padmanabhan ,  Michael J. Winer

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

    CPC分类号： G06F17/30592

    摘要： An information retrieval system and method are provided for minimizing the number of blocks searched in a cell before recording a new record in the table and determining which block can be assigned if a table has space available to store a new record in the case an additional block should be associated with a cell. Dimensions for a table are identified, and at least one block in the table is associated with a dimension value for each dimension, where each block comprises contiguous storage pages. The block can be further associated with a cell; this associated cell has a unique combination of dimension values comprising an dimension value for each of the dimensions. A unique associated bit list for each dimension value for each dimension has a unique corresponding list entry for each block associated with that dimension value, and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell.

    摘要翻译： 提供了一种信息检索系统和方法，用于在记录表中的新记录之前最小化在小区中搜索的块的数量，并且如果在具有可用于存储新记录的空间的情况下确定可以分配哪个块的附加块 应该与一个单元格相关联。 识别表的尺寸，并且表中的至少一个块与每个维的维度值相关联，其中每个块包括连续的存储页。 该块可以进一步与细胞相关联; 该相关联的单元格具有维度值的唯一组合，其包括每个维度的维度值。 每个维度的每个维度值的唯一关联位列具有与该维度值相关联的每个块的唯一对应列表条目，并且每个单元的唯一关联位列表具有与该单元相关联的每个块的唯一对应列表条目。

    System and method for a multi-level locking hierarchy in a database with multi-dimensional clustering
    4.
    发明授权
    System and method for a multi-level locking hierarchy in a database with multi-dimensional clustering 失效
    具有多维聚类的数据库中多级锁定层次结构的系统和方法

    公开(公告)号：US07236974B2

    公开(公告)日：2007-06-26

    申请号：US10425760

    申请日：2003-04-29

    申请人： Bishwaranjan Bhattacharjee ,  Leslie A. Cranston ,  Matthew A. Huras ,  Timothy R. Malkemus ,  Catherine S. McArthur ,  Sriram K. Padmanabhan ,  Michael J. Winer

    发明人： Bishwaranjan Bhattacharjee ,  Leslie A. Cranston ,  Matthew A. Huras ,  Timothy R. Malkemus ,  Catherine S. McArthur ,  Sriram K. Padmanabhan ,  Michael J. Winer

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30592 ,  G06F17/30362 ,  Y10S707/99932 ,  Y10S707/99938 ,  Y10S707/99939

    摘要： A multi-level locking hierarchy for a relational database includes a locking level applied to a multi-dimensionally clustering table, a locking level applied to blocks within the table, and a locking level applied to rows within the blocks. The hierarchy leverages the multi-dimensional clustering of the table data for efficiency and to reduce lock overhead. Data is normally locked in order of coarser to finer granularity to limit deadlock. When data of finer granularity is locked, data of coarser granularity containing the finer granularity data is also locked. Block lock durations may be employed to ensure that a block remains locked if any contained row remains locked. Block level lock attributes may facilitate detection of at least one of a concurrent scan and a row deletion within a block. Detection of the emptying of a block during a scan of the block may bar scan completion in that block.

    摘要翻译： 关系数据库的多级锁定层次结构包括应用于多维聚类表的锁定级别，应用于表中块的锁定级别以及应用于块内的行的锁定级别。 层次结构利用表数据的多维聚类来提高效率并减少锁定开销。 数据通常以更细和更细粒度的顺序锁定，以限制死锁。 当更细粒度的数据被锁定时，包含更细粒度数据的较粗粒度的数据也被锁定。 可以使用块锁定持续时间来确保如果任何包含的行保持锁定，则块保持锁定。 块级锁定属性可以有助于检测块内的并行扫描和行删除中的至少一个。 在块的扫描期间检测块的排空可能会阻止该块中的扫描完成。

    Method and system for efficiently searching for free space in a table of a relational database having a clustering index
    5.
    发明授权
    Method and system for efficiently searching for free space in a table of a relational database having a clustering index 有权
    用于有效搜索具有聚类索引的关系数据库的表中的可用空间的方法和系统

    公开(公告)号：US06668263B1

    公开(公告)日：2003-12-23

    申请号：US09651884

    申请日：2000-08-30

    申请人： Leslie A. Cranston ,  Nelson Hop Hing ,  Matthew A. Huras ,  Bruce G. Lindsay ,  Michael J. Winer

    发明人： Leslie A. Cranston ,  Nelson Hop Hing ,  Matthew A. Huras ,  Bruce G. Lindsay ,  Michael J. Winer

    IPC分类号： G06F1730

    CPC分类号： G06F17/30595 ,  Y10S707/99933 ,  Y10S707/99956

    摘要： A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column of the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space to accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighborhood of pages in the series of pages is searched for sufficient free space to accommodate the new record. The target neighborhood of pages surrounds the target page. If sufficient free space is found on a page in a target neighborhood of pages, then the new record is inserted on to this page in the target neighborhood of pages. If sufficient free space is not found in the target neighborhood of pages, then the method further comprises searching for sufficient free space to accommodate the new record outside the target neighborhood of pages. If sufficient free space is found outside the target neighborhood of pages, then the new record is inserted on a non-neighboring page outside the target neighborhood of pages. If sufficient free space is not found outside the target neighborhood of pages, then a new page having the new record is appended to the end of table.

    摘要翻译： 在数据库管理系统中搜索用于将新记录插入表的可用空间的表的方法。 该表位于存储介质中，并且包括能够存储多个记录的一系列页面。 该表具有在表的列中定义的聚簇索引。 当新记录存储在表中时，新记录具有用于存储在表的列中的新记录属性。 所述方法包括搜索所述一系列页面中的目标页面，所述目标页面被选择以在新记录被插入时保持聚类。 找到目标页面后，将搜索足够的可用空间以容纳新记录。 如果在目标页面上找到足够的可用空间，则新记录将插入到目标页面上。 如果在目标页面上没有找到足够的可用空间，则搜索一系列页面中的页面的目标邻域以获得足够的可用空间以容纳新记录。 页面的目标邻域包围目标页面。 如果在页面的目标邻域中的页面上找到足够的可用空间，则将新记录插入到页面的目标邻域中的该页面上。 如果在页面的目标邻域中没有找到足够的可用空间，则该方法还包括搜索足够的可用空间以容纳目标页面附近的新记录。 如果在目标邻域之外找到足够的可用空间，则新记录被插入到目标邻域之外的非邻近页面上。 如果在目标邻域之外没有找到足够的可用空间，则在表的末尾附加具有新记录的新页面。