Invention Application
US20160170987A1 Efficient Reference Counting in Content Addressable Storage 有权
内容可寻址存储中的高效引用计数

  • Patent Title: Efficient Reference Counting in Content Addressable Storage
  • Patent Title (中): 内容可寻址存储中的高效引用计数
  • Application No.: US15051612
    Application Date: 2016-02-23
  • Publication No.: US20160170987A1
    Publication Date: 2016-06-16
  • Inventor: Alex Kesselman
  • Applicant: GOOGLE INC.
  • Main IPC: G06F17/30
  • IPC: G06F17/30
Efficient Reference Counting in Content Addressable Storage
Abstract:
A process manages database storage. The process receives a first object comprising one or more content chunks. The first object is identified by a unique object ID and each content chunk has a unique offset within the first object. For each chunk, the process inserts a record into a reference table. The record includes a content hash and the object ID. The process stores each of the chunks in content storage. Later, the process obtains a request to delete a first chunk from storage. The first chunk has a corresponding first content hash. The process determines whether the reference table includes a reference record corresponding to the first content hash. When the reference table does not include any reference records corresponding to the first content hash, the process deletes the first chunk. When the reference table includes a corresponding reference record, the process does not delete the first chunk.
Public/Granted literature
Information query
Patent Agency Ranking
0/0