Global checkpoint SCN
    2.
    发明授权
    Global checkpoint SCN 有权
    全球检查点SCN

    公开(公告)号:US07991775B2

    公开(公告)日:2011-08-02

    申请号:US12244640

    申请日:2008-10-02

    IPC分类号: G06F17/30

    摘要: Described herein are techniques for generating a global checkpoint system change number and computing a snapshot query using the global checkpoint system change number without a need to acquire global locks. In many cases, the need to acquire global locks is eliminated, thereby saving the overhead attendant to processing global locks.

    摘要翻译: 这里描述了用于生成全局检查点系统改变号码并使用全局检查点系统改变号码计算快照查询而不需要获取全局锁的技术。 在许多情况下,消除了获取全局锁的需求,从而节省了处理全局锁的开销。

    Cluster delta push
    4.
    发明授权
    Cluster delta push 有权
    集群增量推

    公开(公告)号:US07921090B2

    公开(公告)日:2011-04-05

    申请号:US11450179

    申请日:2006-06-09

    IPC分类号: G06F17/00 G06F7/00 G06F15/16

    CPC分类号: G06F17/30362

    摘要: Methods and apparatuses for providing access to data in a cluster database are described. Embodiments of the invention include identifying situations in which many nodes require relatively equal access to a data block, and taking appropriate measures to improve the performance of the system in these situations. For example, a node may automatically downgrade its lock from an X lock to an S lock as soon as it has finished a modification of the data. S locks are sent to other nodes in the system as soon as a modification is complete. Modifications to the data are also sent to other nodes in the system as soon as a modification is complete. Depending on the size of the data modification, the entire data block may be sent, or only the modifications to the data may be sent.

    摘要翻译: 描述了用于提供对群集数据库中的数据的访问的方法和装置。 本发明的实施例包括识别许多节点需要对数据块相对相等的访问的情况,并且在这些情况下采取适当的措施来提高系统的性能。 例如,一旦节点完成数据的修改,节点就可以自动将其锁定从X锁降级到S锁。 一旦修改完成,S锁将被发送到系统中的其他节点。 一旦修改完成,对数据的修改也将发送到系统中的其他节点。 根据数据修改的大小,可以发送整个数据块,或者仅可以发送对数据的修改。

    Sharing, updating data blocks among multiple nodes in a distributed
system
    5.
    发明授权
    Sharing, updating data blocks among multiple nodes in a distributed system 失效
    在分布式系统中的多个节点之间共享,更新数据块

    公开(公告)号:US6012060A

    公开(公告)日:2000-01-04

    申请号:US865651

    申请日:1997-05-30

    IPC分类号: G06F17/30

    摘要: A method for preventing multiple pings. An embodiment of the invention detects requests of data blocks entailing pings likely to cause additional pings. The servicing of requests involving a pings likely to cause additional pings is deferred until a service enabling conditions occurs. Another embodiment of the invention detects situations where by further updating a data block before pinging the data block use of resources on the remote node requesting the data block are reduced. The servicing of the request for the data block is deferred until a service enabling conditions occurs.

    摘要翻译: 一种防止多次ping的方法。 本发明的一个实施例检测到可能导致额外ping的点的数据块的请求。 涉及可能引起额外波的呼吸的请求的服务被推迟到发生服务使能条件。 本发明的另一实施例检测在ping数据块之前进一步更新数据块的情况,数据块在远程节点上的资源使用被请求数据块减少。 对数据块的请求的服务被延迟,直到发生服务使能条件。

    GLOBAL CHECKPOINT SCN
    6.
    发明申请
    GLOBAL CHECKPOINT SCN 有权
    全球检验点

    公开(公告)号:US20100036843A1

    公开(公告)日:2010-02-11

    申请号:US12244640

    申请日:2008-10-02

    IPC分类号: G06F17/30

    摘要: Described herein are techniques for generating a global checkpoint system change number and computing a snapshot query using the global checkpoint system change number without a need to acquire global locks. In many cases, the need to acquire global locks is eliminated, thereby saving the overhead attendant to processing global locks.

    摘要翻译: 这里描述了用于生成全局检查点系统改变号码并使用全局检查点系统改变号码计算快照查询而不需要获取全局锁的技术。 在许多情况下,消除了获取全局锁的需求,从而节省了处理全局锁的开销。

    Techniques for improved read-write concurrency
    8.
    发明申请
    Techniques for improved read-write concurrency 有权
    改进的读写并发技术

    公开(公告)号:US20080071997A1

    公开(公告)日:2008-03-20

    申请号:US11521908

    申请日:2006-09-15

    IPC分类号: G06F13/00 G06F12/14

    摘要: Techniques are provided for performing changes to a resource governed by a locking mechanism. An entity (such as a server instance in a database system cluster) requests permission to modify the resource. In response to the request, the entity receives a first lock on the resource, which grants permission to perform the change to the resource without making the change permanent. After receiving the first lock, the entity performs the change to a copy of the resource that resides in shared memory without making another copy of the resource. After performing the change and until receiving permission to make the change permanent, the entity prevents the change to the resource from becoming permanent. After performing the change, the entity receives a second lock on the resource, which grants the entity permission to make the change permanent. After receiving the second lock, the entity ceases to prevent the change to the resource from becoming permanent.

    摘要翻译: 提供了用于对由锁定机构管理的资源进行更改的技术。 实体(如数据库系统集群中的服务器实例)请求修改资源的权限。 响应于该请求,实体在资源上接收到第一个锁定,该权限允许对资源执行更改,而不会使更改永久性。 在接收到第一个锁定之后,实体对驻留在共享内存中的资源的副本执行更改,而不创建资源的另一个副本。 执行变更后,直到获得变更永久性的许可,实体将防止资源变为永久性。 执行更改后,实体将在资源上收到第二个锁定,该实体授予实体永久性更改权限。 收到第二个锁后,实体停止防止资源变为永久性。

    Determining affinity in a cluster
    9.
    发明申请
    Determining affinity in a cluster 有权
    确定群集中的亲和力

    公开(公告)号:US20060265420A1

    公开(公告)日:2006-11-23

    申请号:US11132807

    申请日:2005-05-18

    IPC分类号: G06F7/00 G06F17/00

    CPC分类号: G06F17/30362

    摘要: A lock manager system is provided that includes multiple distinct mechanisms for assigning resources to masters. Specifically, the lock manager system includes (1) one or more assignment mechanisms that do not take into account the affinity between nodes and objects (“affinity-independent assignment mechanisms”), and (3) one or more assignment mechanisms that do take into account the affinity between nodes and objects (“affinity-based assignment mechanisms”). At any given time, the assignment of any given resource to a master is governed by only one of the multiple assignment mechanisms employed by the system. Various techniques are described for determining which assignment mechanism to use with which resources.

    摘要翻译: 提供了一种锁管理系统,其包括用于向主人分配资源的多个不同机制。 具体来说,锁管理系统包括(1)一个或多个不考虑节点和对象之间的亲和度的分配机制(“不依赖关系的分配机制”),以及(3)一个或多个分配机制 考虑节点和对象之间的亲和性(“基于亲和性的分配机制”)。 在任何给定的时间,将任何给定资源分配给主机仅由系统采用的多个分配机制之一来管理。 描述了各种技术来确定哪些分配机制与哪些资源一起使用。