知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

130 条记录 (耗时 0.024 秒)

    TWO-TIER STORAGE PROTOCOL FOR COMMITTING CHANGES IN A STORAGE SYSTEM
    2.
    发明申请
    TWO-TIER STORAGE PROTOCOL FOR COMMITTING CHANGES IN A STORAGE SYSTEM 审中-公开

    公开(公告)号：US20180121492A1

    公开(公告)日：2018-05-03

    申请号：US15338829

    申请日：2016-10-31

    申请人： Oracle International Corporation

    发明人： Aditya Sawhney

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30377 ,  G06F17/30359 ,  G06F17/30371

    摘要： Systems and methods for implementing a two-tier commit protocol are described herein. In one or more embodiments, a storage system is configured to receive a request to store an object within a storage system, the object comprising (a) data and (b) metadata. Responsive to the request, the metadata is transmitted to a metadata tier of the storage system, which generates a first acknowledgment that a metadata record has been created in the metadata tier with a pending status. Responsive to the first acknowledgment, the object data is transmitted to a data tier of the storage system. A second acknowledgment is then generated indicating that a data record has been created with a pending status. Responsive to the second acknowledgement, the metadata record is updated to a committed status. The data record in the data tier is then updated to a committed status.

    Alleviation of index hot spots in datasharing environment with remote update and provisional keys
    3.
    发明授权
    Alleviation of index hot spots in datasharing environment with remote update and provisional keys 有权

    公开(公告)号：US09959303B2

    公开(公告)日：2018-05-01

    申请号：US14590993

    申请日：2015-01-07

    申请人： International Business Machines Corporation

    发明人： Robert W. Lyle

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

    CPC分类号： G06F17/30321 ,  G06F17/30359 ,  G06F17/30371

    摘要： In a remote index operation, a first system in a datasharing group performs an operation on a data object in a database, determines a second system in the datasharing group has exclusive access to an index page to be updated according to the operation, and sends to the second system a remote request to change the index page according to the operation. In response, the second system changes the index page with an index entry referencing the data object and marks a key in the index entry as a provisional key. When a third system in the datasharing group reads the index entry, it determines that the key in the index entry is the provisional key. In response, the third system determines whether the data object exists in the database and a committed state of the transaction, and accordingly determines a current state of the data object.

    Providing eventual consistency for multi-shard transactions
    5.
    发明授权
    Providing eventual consistency for multi-shard transactions 有权

    公开(公告)号：US09613122B2

    公开(公告)日：2017-04-04

    申请号：US14268888

    申请日：2014-05-02

    申请人： Facebook, Inc.

    发明人： Neil Earnest Chao ,  Daniel Nota Peek ,  Dmitri Perelman ,  Philippe Vincent Ajoux

    IPC分类号： G06F17/30 ,  G06F15/16

    CPC分类号： G06F17/30359 ,  G06F17/30227 ,  G06F17/30371 ,  G06F17/30584

    摘要： A multi-shard database system receives a transaction including multiple actions directed to different shards of the database system. The database system creates a transaction record including a transaction identifier and a transaction status for the transaction in a transaction database. The database system then executes, in parallel, the multiple actions on the different shards by associating with each data item involved in the transaction a data structure that includes the transaction identifier and new data to be applied to the data item. The database system then updates the transaction status in the transaction record for the transaction from pending to completed when each of the multiple actions is successfully executed on the corresponding shard. Consistency is eventually implemented when the data structures associated with the data items involved in the transaction are evaluated. The evaluation of a data structure can be triggered by a read request or other events.

    REDUCING LOCK OCCURRENCES IN SERVER/DATABASE SYSTEMS
    9.
    发明申请
    REDUCING LOCK OCCURRENCES IN SERVER/DATABASE SYSTEMS 有权
    减少服务器/数据库系统中的锁定事件

    公开(公告)号：US20160070738A1

    公开(公告)日：2016-03-10

    申请号：US14943057

    申请日：2015-11-17

    申请人： International Business Machines Corporation

    发明人： Pawel Gocek ,  Grzegorz K. Lech ,  Bartlomiej T. Malecki ,  Jan Marszalek ,  Joanna Wawrzyczek

    IPC分类号： G06F17/30 ,  G06F9/52

    CPC分类号： G06F17/30362 ,  G06F9/526 ,  G06F17/30168 ,  G06F17/30289 ,  G06F17/30306 ,  G06F17/30359 ,  G06F17/30371 ,  G06F17/30598 ,  G06F17/30876

    摘要： Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

    摘要翻译： 限制数据库系统中的并发请求数。 在至少一个队列中安排要由数据库系统处理的请求。 定义与所述至少一个队列相对应的并发请求的最大值（SS）。 监视与所述至少一个队列对应的至少一个队列利用率参数，并基于所述至少一个队列利用参数来计算性能值。 基于性能值（PF）动态调整至少一个队列的并发请求的最大值（SS），以提高系统性能。 基于动态适应的最大值（SS）来动态地限制至少一个队列的并发请求数。

    Lock state synchronization for non-disruptive persistent operation
    10.
    发明授权
    Lock state synchronization for non-disruptive persistent operation 有权
    锁定状态同步用于非中断持久性操作

    公开(公告)号：US09280396B2

    公开(公告)日：2016-03-08

    申请号：US13666805

    申请日：2012-11-01

    申请人： NetApp, Inc.

    发明人： Omprakaash C. Thoppai ,  William Zumach ,  Wangyuan Zhang ,  Vinay Sridhar ,  Robert Wyckoff Hyer, Jr.

    IPC分类号： G06F15/173 ,  G06F9/52 ,  G06F17/30

    CPC分类号： H04L67/1095 ,  G06F9/52 ,  G06F17/30171 ,  G06F17/30359 ,  G06F17/30362 ,  G06F17/30575 ,  G06F17/30578 ,  H04L67/1097

    摘要： Techniques for synchronization between data structures for original locks and mirror lock data structures are disclosed herein. The mirror lock data structures are being maintained during various scenarios including volume move and aggregate relocation, in order to preserve the non-disruptive persistent operation on storage initiated by clients. According to one embodiment, a storage node determines a plurality of data container locks to be synchronized to a partner node of the storage node and transfers metadata that indicates states of variables that represent the plurality of data container locks to the partner node in a batch. When a client initiates a data access operation that causes an attempt to modify a data container lock of the plurality of data container locks, the storage node sends a retry code to a client that prompts the client to retry the data access operation after a predetermined time period.

    摘要翻译： 本文中公开了用于原始锁和数据结构的数据结构之间同步的技术。 在包括卷移动和聚合重定位的各种场景期间，正在维护镜像锁数据结构，以便保持由客户端启动的存储上的非中断持久性操作。 根据一个实施例，存储节点确定要与存储节点的伙伴节点同步的多个数据容器锁，并将指示表示多个数据容器锁的变量的状态的元数据传送到批次中的伙伴节点。 当客户端启动导致尝试修改多个数据容器锁的数据容器锁的数据访问操作时，存储节点向客户端发送重试代码，该客户端在预定时间后提示客户端重试数据访问操作 期。