-
公开(公告)号:US20230409545A1
公开(公告)日:2023-12-21
申请号:US17845683
申请日:2022-06-21
Applicant: VMware, Inc.
Inventor: Abhishek GUPTA , Christos KARAMANOLIS , Richard P. SPILLANE , Marin NOZHCHEV
CPC classification number: G06F16/219 , G06F16/2219
Abstract: A version control interface provides for time travel with metadata management under a common transaction domain as the data. Examples generate a time-series of master branch snapshots for data objects stored in a data lake, with the snapshot comprising a tree data structure such as a hash tree and associated with a time indication. Readers select a master branch snapshot from the time-series, based on selection criteria (e.g., time) and use references in the selected master branch snapshot to read data objects from the data lake. This provides readers with a view of the data as of a specified time.
-
公开(公告)号:US20210064581A1
公开(公告)日:2021-03-04
申请号:US16552976
申请日:2019-08-27
Applicant: VMware, Inc.
Inventor: Wenguang WANG , Junlong GAO , Marcos K. AGUILERA , Richard P. SPILLANE , Christos KARAMANOLIS , Maxime AUSTRUY
IPC: G06F16/174 , G06F16/13 , G06F16/172
Abstract: The present disclosure provides techniques for deduplicating files. The techniques include creating a cache or subset of a large data structure. The large data structure organizes information by random hash values. The random hash values result in a random organization of information within the data structure, with the information spanning a large number of storage blocks within a storage system. The cache, however, is within memory and is small relative to the data structure. The cache is created so as to contain information that is likely to be needed during deduplication of a file. Having needed information within memory rather than in storage results in faster read and write operations to that information, improving the performance of a computing system.
-
公开(公告)号:US20210064579A1
公开(公告)日:2021-03-04
申请号:US16552908
申请日:2019-08-27
Applicant: VMware, Inc.
Inventor: Wenguang WANG , Junlong GAO , Marcos K. AGUILERA , Richard P. SPILLANE , Christos KARAMANOLIS , Maxime AUSTRUY
IPC: G06F16/174 , G06F16/14
Abstract: Disclosed techniques include deduplication. Techniques include determining whether a file is unique, and depending on whether the file is unique, deduplicating only part of the file or the entire file. The techniques include processing the first chunk of a file to determine whether the hash of the chunk hash is already within a chunk hash table, and if not, then a percentage of chunks of the file is similarly processed. If any of the hashes of chunks are already in the chunk hash table, then at least some of file has been previously deduplicated, and file is not unique the storage system. If none of the processed chunks have a hash that is already in the chunk hash table, then the file is considered to be unique within chunk store and only a partial percentage of the file's chunks are deduplicated. Not all of a unique file's chunks are deduplicated.
-
公开(公告)号:US20210064522A1
公开(公告)日:2021-03-04
申请号:US16552954
申请日:2019-08-27
Applicant: VMware, Inc.
Inventor: Wenguang WANG , Junlong GAO , Marcos K. AGUILERA , Richard P. SPILLANE , Christos KARAMANOLIS , Maxime AUSTRUY
Abstract: The present disclosure provides techniques for deallocating previously allocated storage blocks. The techniques include obtaining a list of chunk IDs to analyze, choosing a chunk ID, and determining the storage blocks spanned by the chunk corresponding to the chosen chunk ID. The technique further includes determining whether any file references any storage blocks spanned by the chunk. The determining may be performed by comparing an internal reference count to a total reference count, where the internal reference count is the number of reference to the storage block by a chunk ID data structure. If no files reference any of the storage blocks spanned by the chunk, then all the storage blocks of the chunk can be deallocated.
-
公开(公告)号:US20200293506A1
公开(公告)日:2020-09-17
申请号:US16353535
申请日:2019-03-14
Applicant: VMware, Inc.
Inventor: Abhishek GUPTA , Robert T. JOHNSON , Richard P. SPILLANE , Sandeep RANGASWAMY , Jorge GUERRA DELGADO , Srinath PREMACHANDRAN , Kapil CHOWKSEY
IPC: G06F16/22 , G06F16/2455 , G06F7/08
Abstract: Embodiments described herein are related to bulk loading data into a B-tree. Embodiments include generating a first leaf node of a B-tree by allocating a first page for the first leaf node from a leaf page queue comprising a first plurality of sequential pages; and writing one or more tuples to the first page allocated for the first leaf node. Embodiments further include generating an parent node for the first leaf node and a second leaf node of the B-tree by allocating a third page for the parent node from an parent page queue comprising a second plurality of sequential pages, the parent node comprising a first indication of the first leaf node and a second indication of the second leaf node, the first indication and the second indication stored in the third page allocated for the parent.
-
公开(公告)号:US20190311047A1
公开(公告)日:2019-10-10
申请号:US15947072
申请日:2018-04-06
Applicant: VMware, Inc.
Inventor: Jorge GUERRA DELGADO , Richard P. SPILLANE , Kapil CHOWKSEY , Sandeep RANGASWAMY , Abhishek GUPTA , Srinath PREMACHANDRAN
Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.
-
公开(公告)号:US20190294710A1
公开(公告)日:2019-09-26
申请号:US15927025
申请日:2018-03-20
Applicant: VMware, Inc.
Inventor: Abhishek GUPTA , Rob T. JOHNSON , Srinath PREMACHANDRAN , Richard P. SPILLANE , Sandeep RANGASWAMY , Jorge GUERRA DELGADO , Kapil CHOWKSEY , Wenguang WANG
Abstract: Exemplary methods, apparatuses, and systems include a file system process determining to a flush a node in a first tree. The first node includes a buffer structured as a second tree. The file system process generates an input/output instruction to load the buffer from a first memory to a second memory. The second tree is stored in two more non-contiguous locations in the first memory and the input/output operation includes a read operation corresponding to each of the two or more non-contiguous locations. The file system process causes the input/output instruction to be executed concurrently on the first memory.
-
公开(公告)号:US20190220211A1
公开(公告)日:2019-07-18
申请号:US15870506
申请日:2018-01-12
Applicant: VMware, Inc.
Inventor: Wenguang WANG , Eric KNAUFT , Srinath PREMACHANDRAN , Zhaohui GUO , Richard P. SPILLANE
CPC classification number: G06F16/10 , G06F3/0617 , G06F3/0665 , G06F3/0667 , G06F3/067 , G06F2009/45579
Abstract: Techniques are disclosed for using in-memory replicated object to support file services. Certain embodiments provide a method of storing persistent file handles in a storage system comprising a plurality of computing devices. The method may include requesting to write a persistent file handle corresponding to a file to a file system stored on the plurality of computing devices. The request may be translated to a block input/output (I/O) command to an in-memory object, the in-memory object representing at least a portion of the file system, a copy of the in-memory object being stored at each of the plurality of computing devices in volatile memory. The persistent file handle may then be written to the copy of the in-memory object stored in the volatile memory of each of the plurality of computing devices.
-
-
-
-
-
-
-