LOCKING AND TRAVERSAL METHODS FOR ORDERED TREE DATA STRUCTURES
    1.
    发明申请
    LOCKING AND TRAVERSAL METHODS FOR ORDERED TREE DATA STRUCTURES 有权
    用于订单树数据结构的锁定和横向方法

    公开(公告)号:US20140310317A1

    公开(公告)日:2014-10-16

    申请号:US13861329

    申请日:2013-04-11

    Applicant: APPLE INC.

    CPC classification number: G06F17/30961 G06F17/30091

    Abstract: In one embodiment, two-phase mutation of an ordered tree data structure is performed, wherein a lock can be acquired on a first node in an ordered tree data structure, and an identifier for the first node can be added to a lock path data structure. A second node can also be locked, and an identifier for the second node can be added to the lock path data structure. Subsequently, a set of operations to perform on the ordered tree responsive to a modification of the second node can be determined for each node affected by the modification, and the operation for each node can be stored in the lock path data structure. Once the operations for the nodes have been determined, the operations listed in the lock path can be performed.

    Abstract translation: 在一个实施例中,执行有序树数据结构的两阶段变异,其中可以在有序树数据结构中的第一节点上获取锁,并且可以将第一节点的标识符添加到锁路数据结构 。 也可以锁定第二节点,并且可以将第二节点的标识符添加到锁路径数据结构。 随后,可以针对受修改影响的每个节点确定响应于第二节点的修改而在有序树上执行的一组操作,并且可以将每个节点的操作存储在锁定路径数据结构中。 一旦确定了节点的操作,就可以执行锁定路径中列出的操作。

    Locking and traversal methods for ordered tree data structures
    2.
    发明授权
    Locking and traversal methods for ordered tree data structures 有权
    有序树数据结构的锁定和遍历方法

    公开(公告)号:US09208258B2

    公开(公告)日:2015-12-08

    申请号:US13861329

    申请日:2013-04-11

    Applicant: Apple Inc.

    CPC classification number: G06F17/30961 G06F17/30091

    Abstract: In one embodiment, two-phase mutation of an ordered tree data structure is performed, wherein a lock can be acquired on a first node in an ordered tree data structure, and an identifier for the first node can be added to a lock path data structure. A second node can also be locked, and an identifier for the second node can be added to the lock path data structure. Subsequently, a set of operations to perform on the ordered tree responsive to a modification of the second node can be determined for each node affected by the modification, and the operation for each node can be stored in the lock path data structure. Once the operations for the nodes have been determined, the operations listed in the lock path can be performed.

    Abstract translation: 在一个实施例中,执行有序树数据结构的两相变异,其中可以在有序树数据结构中的第一节点上获取锁,并且可以将第一节点的标识符添加到锁路数据结构 。 也可以锁定第二节点,并且可以将第二节点的标识符添加到锁路径数据结构。 随后,可以针对受修改影响的每个节点确定响应于第二节点的修改而在有序树上执行的一组操作,并且可以将每个节点的操作存储在锁定路径数据结构中。 一旦确定了节点的操作,就可以执行锁定路径中列出的操作。

Patent Agency Ranking