Using scratch extents to facilitate copying operations in an append-only storage system

    公开(公告)号:US10248356B2

    公开(公告)日:2019-04-02

    申请号:US14519907

    申请日:2014-10-21

    Applicant: Dropbox, Inc.

    Abstract: An append-only data storage system is described that stores sets of data blocks in extents that are located in storage devices. During operation of the system, upon receiving a request to copy an extent from a source storage device to a destination storage device, the system creates a scratch extent on the destination storage device, and associates the scratch extent with a private identifier, whereby the scratch extent can only be accessed through the private identifier. The system uses the private identifier to perform a copying operation that copies the extent from the source storage device to the scratch extent on the destination storage device. After the copying operation is complete and the scratch extent is closed, the system associates the scratch extent with a public identifier, whereby the copy of the extent on the destination storage device becomes publically accessible to other entities in the data storage system.

    FACILITATING DISTRIBUTED DELETES IN A REPLICATED STORAGE SYSTEM
    13.
    发明申请
    FACILITATING DISTRIBUTED DELETES IN A REPLICATED STORAGE SYSTEM 有权
    在替代存储系统中实现分布式删除

    公开(公告)号:US20160140201A1

    公开(公告)日:2016-05-19

    申请号:US14540628

    申请日:2014-11-13

    Applicant: Dropbox, Inc.

    CPC classification number: G06F17/30578 G06F11/14 G06F11/2094 G06F17/30117

    Abstract: A data storage system includes multiple zones that comprise separate geographic storage locations and store replicated copies of data items. Upon receiving a delete operation at a local zone at a time td, if a copy of the first data item exists in the local zone, the system computes a maximum last update time tmlu=td−tmin, wherein tmin is a minimum lifetime for a data item. Next, the system determines, from a local index, a time tlu that the first data item was last updated. If tlu

    Abstract translation: 数据存储系统包括多个区域,其包括单独的地理存储位置并存储数据项的复制副本。 在时刻td在本地区域接收到删除操作时,如果本地区域中存在第一数据项目的副本,则系统计算最大上次更新时间tmlu = td-tmin,其中tmin为 数据项。 接下来,系统从本地索引确定第一数据项最后更新的时间tlu。 如果tlu

    USING COLOCATION HINTS TO FACILITATE ACCESSING A DISTRIBUTED DATA STORAGE SYSTEM
    14.
    发明申请
    USING COLOCATION HINTS TO FACILITATE ACCESSING A DISTRIBUTED DATA STORAGE SYSTEM 有权
    使用协调交易来加快访问分布式数据存储系统

    公开(公告)号:US20150254320A1

    公开(公告)日:2015-09-10

    申请号:US14224786

    申请日:2014-03-25

    Applicant: Dropbox, Inc.

    Inventor: James Cowling

    CPC classification number: G06F17/30581 G06F3/067 G06F17/30194

    Abstract: The disclosed embodiments relate to a system that uses colocation hints to facilitate storing data blocks in a distributed data storage system, which includes a plurality of data centers. During operation, the system receives a write request from a client to write a data block to the distributed data storage system, wherein the write request includes a colocation hint that identifies a colocation group associated with the data block. In response to the write request, the system uses the colocation hint to identify one or more data centers associated with the colocation group. Next, the system writes copies of the data block to the one or more identified data centers. In this way, the system situates copies of data blocks associated with the colocation group in the same data centers when possible.

    Abstract translation: 所公开的实施例涉及使用托槽提示以有助于将数据块存储在包括多个数据中心的分布式数据存储系统中的系统。 在操作期间,系统从客户端接收写请求以将数据块写入分布式数据存储系统,其中写请求包括标识与数据块相关联的托管组的托卡提示。 响应于写入请求,系统使用托管提示来识别与托管组相关联的一个或多个数据中心。 接下来,系统将数据块的副本写入一个或多个识别的数据中心。 以这种方式,如果可能,系统将与托管组相关联的数据块的副本置于同一数据中心。

    Managing distributed deletes in a replicated storage system

    公开(公告)号:US10296518B2

    公开(公告)日:2019-05-21

    申请号:US15399249

    申请日:2017-01-05

    Applicant: Dropbox, Inc.

    Abstract: A data storage system includes multiple storage zones that store replicated copies of data items. Upon receiving a delete operation at a particular time to delete a data item, the system computes a maximum last update time based on the particular time and a minimum data item lifetime. Based on determining that a copy of the data item is stored in the data storage zone, the system then determines a last update time of the data item. In addition, based on determining that the last update time is less than the first maximum last update time, the system deletes the copy of the data item from the data storage zone.

    Using an RPC framework to facilitate out-of-band data transfers

    公开(公告)号:US09967310B2

    公开(公告)日:2018-05-08

    申请号:US14519888

    申请日:2014-10-21

    Applicant: Dropbox, Inc.

    CPC classification number: H04L67/02 G06F9/547 H04L67/1097 H04L67/40

    Abstract: A system that stores sets of data blocks in extents located in storage devices is described. During operation, a receiving device receives, through an RPC framework, a first call asking to transfer an extent from a sending device to the receiving device. In response, the receiving device opens a port for a data connection that operates outside the RPC framework. The receiving device makes a second call, to the sending device through the RPC framework, asking to stream the extent to the port. The receiving device subsequently receives the extent from the sending device through the port and computes a checksum for the extent. The receiving device also receives a return from the second call, including a checksum for the extent computed by the sending device. If the computed checksum matches the received checksum, the receiving device returns the first call to indicate the transfer operation completed successfully.

    Append-only storage system supporting open and closed extents

    公开(公告)号:US09720607B2

    公开(公告)日:2017-08-01

    申请号:US14497195

    申请日:2014-09-25

    Applicant: Dropbox, Inc.

    Abstract: The disclosed embodiments relate to the design of an append-only data storage system that stores sets of data blocks in extents that are located in storage devices in the system. During operation of the system, when an extent is in an open state, the system allows data blocks to be appended to the extent, and disallows operations to be performed on the extent that are incompatible with data being concurrently appended to the extent. When the extent becomes full, the system changes the extent from the open state to a closed state. Then, while the extent is in the closed state, the system disallows data blocks to be appended to the extent, and allows operations to be performed on the extent that are incompatible with data being concurrently appended to the extent.

    MANAGING DISTRIBUTED DELETES IN A REPLICATED STORAGE SYSTEM

    公开(公告)号:US20170116301A1

    公开(公告)日:2017-04-27

    申请号:US15399249

    申请日:2017-01-05

    Applicant: Dropbox, Inc.

    CPC classification number: G06F17/30578 G06F11/14 G06F11/2094 G06F17/30117

    Abstract: A data storage system includes multiple storage zones that store replicated copies of data items. Upon receiving a delete operation at a particular time to delete a data item, the system computes a maximum last update time based on the particular time and a minimum data item lifetime. Based on determining that a copy of the data item is stored in the data storage zone, the system then determines a last update time of the data item. In addition, based on determining that the last update time is less than the first maximum last update time, the system deletes the copy of the data item from the data storage zone.

    Facilitating distributed deletes in a replicated storage system
    19.
    发明授权
    Facilitating distributed deletes in a replicated storage system 有权
    促进复制存储系统中的分布式删除

    公开(公告)号:US09569515B2

    公开(公告)日:2017-02-14

    申请号:US14540628

    申请日:2014-11-13

    Applicant: Dropbox, Inc.

    CPC classification number: G06F17/30578 G06F11/14 G06F11/2094 G06F17/30117

    Abstract: A data storage system includes multiple zones that comprise separate geographic storage locations and store replicated copies of data items. Upon receiving a delete operation at a local zone at a time td, if a copy of the first data item exists in the local zone, the system computes a maximum last update time tmlu=td−tmin, wherein tmin is a minimum lifetime for a data item. Next, the system determines, from a local index, a time tlu that the first data item was last updated. If tlu

    Abstract translation: 数据存储系统包括多个区域,其包括单独的地理存储位置并存储数据项的复制副本。 在时刻td在本地区域接收到删除操作时,如果本地区域中存在第一数据项目的副本,则系统计算最大上次更新时间tmlu = td-tmin,其中tmin为 数据项。 接下来,系统从本地索引确定第一数据项最后更新的时间tlu。 如果tlu

    ERASURE-CODING EXTENTS IN AN APPEND-ONLY STORAGE SYSTEM
    20.
    发明申请
    ERASURE-CODING EXTENTS IN AN APPEND-ONLY STORAGE SYSTEM 有权
    附件存储系统中的擦除编码现象

    公开(公告)号:US20160139980A1

    公开(公告)日:2016-05-19

    申请号:US14540610

    申请日:2014-11-13

    Applicant: Dropbox, Inc.

    CPC classification number: G06F11/1048 H03M13/1515

    Abstract: A data storage system stores sets of data blocks in extents located on storage devices. During operation, the system performs an erasure-coding operation by obtaining a set of source extents, wherein each source extent is stored on a different machine in the data storage system. The system also selects a set of destination machines for storing destination extents, wherein each destination extent is stored on a different destination machine. Next, the system performs the erasure-coding operation by retrieving data from the set of source extents, performing the erasure-coding operation on the retrieved data to produce erasure-coded data, and then writing the erasure-coded data to the set of destination extents on the set of destination machines. Finally, after the erasure-coding operation is complete, the system commits results of the erasure-coding operation to enable the set of destination extents to be accessed in place of the set of source extents.

    Abstract translation: 数据存储系统存储位于存储设备上的盘区中的数据块集合。 在操作期间,系统通过获得一组源盘区进行擦除编码操作,其中每个源盘区存储在数据存储系统中的不同机器上。 该系统还选择一组用于存储目的地盘区的目的地机器,其中每个目的地盘区存储在不同的目的地机器上。 接下来,系统通过从源区间集合中检索数据,对检索的数据执行擦除编码操作来执行擦除编码操作,以产生擦除编码数据,然后将擦除编码数据写入目的地集合 目标机器组上的范围。 最后,在擦除编码操作完成之后,系统执行擦除编码操作的结果,以使得能够访问目标盘区的集合来代替该源盘区的集合。

Patent Agency Ranking