System and method for using a buffer to facilitate log catchup for online operations
    1.
    发明授权
    System and method for using a buffer to facilitate log catchup for online operations 失效
    使用缓冲区来促进在线操作的日志追踪的系统和方法

    公开(公告)号:US07203802B2

    公开(公告)日:2007-04-10

    申请号:US10425163

    申请日:2003-04-29

    IPC分类号: G06F12/00

    CPC分类号: G06F17/30368

    摘要: A memory buffer facilitates log catchup for online operations. Certain designated areas of memory are allocated for one or more buffers for use during online operations (e.g., reorganization, create index, etc.). Concurrent update activities to the target object write informational records into the one or more buffers. If the buffers become full, the informational records may be written to logs for persistent storage. After online operations finish building all or a suitable portion of the shadow object, log catchup is performed by first applying activities in the informational records from the buffer and thereafter applying activities from logs, if necessary. The invention helps solve the drawbacks of log catchup since the buffer contains only the information related to the target shadow object. Also it does not involve physical I/Os, as these records are all in memory.

    摘要翻译: 内存缓冲区有助于日志追踪在线操作。 某些指定的存储区域被分配用于在线操作期间使用的一个或多个缓冲器(例如,重组,创建索引等)。 目标对象的并发更新活动将信息记录写入一个或多个缓冲区。 如果缓冲区已满,则可将信息记录写入日志以进行持久存储。 在线操作完成构建阴影对象的所有或适当部分后,通过首先在缓冲区中的信息记录中应用活动,然后在必要时从日志应用活动来执行日志追踪。 本发明有助于解决日志追踪的缺点,因为缓冲器仅包含与目标影子对象相关的信息。 此外,它不涉及物理I / O,因为这些记录都在内存中。

    System and method for handling resource transaction requests
    2.
    发明授权
    System and method for handling resource transaction requests 有权
    处理资源事务请求的系统和方法

    公开(公告)号:US07069366B2

    公开(公告)日:2006-06-27

    申请号:US10346214

    申请日:2003-01-18

    IPC分类号: G06F12/00

    摘要: A system and method handle resource transaction requests. The system marks a waiting transaction request, having an access mode which is incompatible with the access mode of the executing transaction, with an ignore bit, so that a transaction request with an access mode compatible with the access mode of the executing transaction may receive a lock in order to access the resource. The transaction request is then marked with a bypass indicator such that when the executing transactions are finished accessing the resource, the waiting transaction request may be notified that it may have access to the resource. The system includes the ignore bit so that each transaction request that arrives after the ignore bit has been set, does not suffer from a long waiting time before being provided access to the resource.

    摘要翻译: 系统和方法处理资源事务请求。 该系统标记具有与执行事务的访问模式不兼容的访问模式的等待事务请求,具有忽略位,使得具有与执行事务的访问模式兼容的访问模式的事务请求可以接收 锁定以访问资源。 然后,交易请求被标记旁路指示符,使得当执行的事务完成访问资源时,可以通知等待的事务请求它可以访问该资源。 该系统包括忽略位,使得在忽略位之后到达的每个事务请求在被提供给资源的访问之前不会受到漫长的等待时间的困扰。

    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

    IPC分类号: G06F17/30

    摘要: 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.

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

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

    公开(公告)号:US07765211B2

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

    申请号:US10425781

    申请日:2003-04-29

    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.

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

    Managing attributed-tagged index entries
    6.
    发明授权
    Managing attributed-tagged index entries 失效
    管理归因标记的索引条目

    公开(公告)号:US07266539B2

    公开(公告)日:2007-09-04

    申请号:US10421178

    申请日:2003-04-22

    IPC分类号: G06F17/30

    摘要: The invention herein provides method and apparatus for managing attribute-tagged index entries contained in an index by assigning or tagging an index entry attribute indicator to a newly inserted index entry (that is, at the time when a key data value is inserted into the index, the key data value becomes a newly inserted index entry and an attribute indicator is tagged to the newly inserted index entry). The index entry can be placed anywhere within the index. Once a group of attribute-tagged index entries have been inserted into the index, the attribute identifiers can be switched off instantaneously (that is, the attribute associated with the attribute indicators is disabled).

    摘要翻译: 本发明提供了通过将索引条目属性指示符分配或标记到新插入的索引条目(即,当将密钥数据值插入到索引中时)来管理包含在索引中的属性标记索引条目的方法和装置 ,密钥数据值变为新插入的索引条目,并且将属性指示符标记到新插入的索引条目)。 索引条目可以放置在索引中的任何位置。 一旦一组属性标记的索引条目已被插入到索引中,属性标识符就可以立即关闭(即与属性指示符关联的属性被禁用)。

    Efficient index-data fetch via callback for table data
    7.
    发明授权
    Efficient index-data fetch via callback for table data 失效
    通过表格数据的回调有效的索引数据提取

    公开(公告)号:US07103587B2

    公开(公告)日:2006-09-05

    申请号:US09757431

    申请日:2001-01-10

    IPC分类号: G06F7/00 G06F17/30

    摘要: A callback to a data manager is carried out from an index manager in a query processing system for an index-data fetch to enable an index page held stabilized by an index manager to remain stabilized during predicate checking or data consumption operations. The index manager locates a data identifier in an index and calls back to a data manager to access the data indicated by the data identifier. The data manager may carry out a predicate check or a data consuming operation on the data and if this is the case the index manager may access the next data identifier in the index when the data manager callback is complete. The index page need not be destabilized in such a case.

    摘要翻译: 在索引数据提取的查询处理系统中从索引管理器执行对数据管理器的回调,以使由索引管理器保持的索引页在谓词检查或数据消耗操作期间保持稳定。 索引管理器将数据标识符定位在索引中,并且回拨给数据管理器以访问由数据标识符指示的数据。 数据管理器可以对数据执行谓词检查或数据消耗操作,如果是这种情况,索引管理器可以在数据管理器回调完成时访问索引中的下一个数据标识符。 在这种情况下,索引页不需要不稳定。

    Optimizing command execution in database systems that provide support for updatable scrollable cursors
    8.
    发明授权
    Optimizing command execution in database systems that provide support for updatable scrollable cursors 有权
    优化在可更新的可滚动游标中提供支持的数据库系统中的命令执行

    公开(公告)号:US07010552B2

    公开(公告)日:2006-03-07

    申请号:US09872827

    申请日:2001-05-31

    IPC分类号: G06F17/30

    摘要: A procedure optimizes command execution in a database system. According to one embodiment, the database system stores data records on data pages, and provides an identifier for each data page. The identifier indicates when any of the data records contained in the data page were last modified. A data record is selected from a data page and copied to a second storage area. Verification that the selected data record has not been modified since the time that is was copied to the second storage area is based upon the identifier, and then the command is executed.

    摘要翻译: 一个过程优化数据库系统中的命令执行。 根据一个实施例,数据库系统将数据记录存储在数据页上,并为每个数据页提供标识符。 标识符表示最后一次修改数据页中包含的任何数据记录。 从数据页面选择数据记录并复制到第二存储区域。 验证所选择的数据记录自被复制到第二存储区域的时间以来未被修改是基于标识符,然后执行该命令。

    Latch mechanism for concurrent computing environments

    公开(公告)号:US07013463B2

    公开(公告)日:2006-03-14

    申请号:US09894215

    申请日:2001-06-27

    IPC分类号: G06F9/46

    CPC分类号: G06F9/52

    摘要: A system, method and computer readable medium containing programming structions for an improved latch mechanism for use in a programming environment running concurrent tasks is disclosed. According to one aspect of the present invention, a latch is provided to a first task which is requesting access to a resource. After such access, the first task holds the latch, which is also released from the first task. The first task holding the latch marks the latch stealable, and if the latch is not marked stolen by another task, the first task can mark the latch unstealable. In another embodiment of the present invention, if the first task is provided a latch marked stealable, the resource associated with the stealable latch will be placed in a consistent state before the first task accesses the resource.

    Method and system for efficiently searching for free space in a table of a relational database having a clustering index
    10.
    发明授权
    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

    IPC分类号: G06F1730

    摘要: 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.

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