公开(公告)号：US08793226B1

公开(公告)日：2014-07-29

申请号：US11846033

申请日：2007-08-28

Applicant: Sandeep Yadav ,  Don Trimmer ,  Yong Cho

Inventor： Sandeep Yadav ,  Don Trimmer ,  Yong Cho

IPC: G06F17/30

CPC classification number: G06F17/30156

Abstract: The present invention provides a system and method for estimating duplicate data in a storage system. A duplicate estimation application executes on a client of a storage system selects an element from an intended destination such as, e.g., a data store of the storage system. If the element is a file (or other data container), the application reads data from the file and computes a fingerprint of the read data. The computed fingerprint is then logged in a fingerprint database, which is illustratively stored on a storage device connected to the client executing the application. This process repeats until the entire file (or other data container) has been read and fingerprinted. Once all elements have been scanned, fingerprinted and recorded, the application identifies any unique entries within the fingerprint database. Utilizing this information, the application computes an estimated space savings that may be realized by employing a data de-duplication technique.

Abstract translation: 本发明提供一种用于估计存储系统中的重复数据的系统和方法。 在存储系统的客户端上执行的重复估计应用从预期目的地（例如，存储系统的数据存储）中选择一个元素。 如果元素是文件（或其他数据容器），则应用程序从文件读取数据并计算读取数据的指纹。 然后将计算出的指纹记录在指纹数据库中，该指纹数据库被示例性地存储在连接到执行应用程序的客户端的存储设备上。 该过程重复，直到整个文件（或其他数据容器）已被读取和指纹。 一旦所有元素被扫描，指纹和记录，应用程序将识别指纹数据库中的任何唯一条目。 利用该信息，应用程序计算可以通过采用重复数据删除技术来实现的估计空间节省。

公开(公告)号：US08600949B2

公开(公告)日：2013-12-03

申请号：US13165631

申请日：2011-06-21

Applicant: Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

IPC: G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

公开(公告)号：US08539191B2

公开(公告)日：2013-09-17

申请号：US12349423

申请日：2009-01-06

Applicant: Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

Inventor： Dnyaneshwar Pawar ,  Rahul Khona ,  Subramanian Periyagaram ,  Sandeep Yadav

IPC: G06F12/00

CPC classification number: G06F3/0608 ,  G06F3/0611 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/067

Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.

Abstract translation: 一种用于估计压缩卷空间的方法和系统，以使得存储服务器能够在实际压缩和/或分配磁盘上的数据之前对写请求做出响应。 在一些实施例中，响应于接收到存储数据的请求，存储服务器估计将数据存储在盘上所需的存储空间量。 存储服务器将估计的数量与可用磁盘空间的数量进行比较。 当可用磁盘空间量小于估计的空间时，存储服务器发送一个响应，指示请求失败。 否则，当可用磁盘空间量大于或等于估计空间时，存储服务器发送一个响应，指示该请求成功。 在存储服务器分配与请求相关联的任何磁盘空间之前发送响应。

公开(公告)号：US08539008B2

公开(公告)日：2013-09-17

申请号：US13098310

申请日：2011-04-29

Applicant: Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeff Kimmel ,  Steve Daniel

Inventor： Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeff Kimmel ,  Steve Daniel

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：US20130018857A1

公开(公告)日：2013-01-17

申请号：US13589763

申请日：2012-08-20

Applicant: Jim Voll ,  Sandeep Yadav

Inventor： Jim Voll ,  Sandeep Yadav

IPC: G06F17/30

CPC classification number: H03M7/30 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0643 ,  G06F3/0689

Abstract: A system and method for transparently compressing file system data using compression group descriptors is provided. When data contained within a compression group be compressed beyond a predefined threshold value, a compression group descriptor is included in the compression group that signifies that the data for the group of level 0 blocks is compressed into a lesser number of physical data blocks. When performing a read operation, the file system first determines the appropriate compression group that contains the desired data and determines whether the compression group has been compressed. If so, the file system decompresses the data in the compression group before returning the decompressed data. If the magic value is not the first pointer position, then the data within the compression group was previously stored in an uncompressed format, and the data may be returned without performing a decompression operation.

Abstract translation: 提供了一种使用压缩组描述符对文件系统数据进行透明压缩的系统和方法。 当包含在压缩组中的数据被压缩超过预定义的阈值时，压缩组中包括压缩组描述符，该压缩组表示用于组0级块的数据被压缩成较少数量的物理数据块。 执行读取操作时，文件系统首先确定包含所需数据的适当的压缩组，并确定压缩组是否被压缩。 如果是这样，文件系统在返回解压缩数据之前解压缩压缩组中的数据。 如果魔术值不是第一个指针位置，则压缩组中的数据先前以未压缩格式存储，并且可以在不执行解压缩操作的情况下返回数据。

公开(公告)号：US20120278382A1

公开(公告)日：2012-11-01

申请号：US13098310

申请日：2011-04-29

Applicant: Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeff Kimmel ,  Steve Daniel

Inventor： Rickard E. Faith ,  Subramaniam Periyagaram ,  Sandeep Yadav ,  Ashish Prakash ,  Blake Lewis ,  Jeff Kimmel ,  Steve Daniel

IPC: G06F15/16

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组相邻块，并且所述读取请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：US20100058002A1

公开(公告)日：2010-03-04

申请号：US12198952

申请日：2008-08-27

Applicant: Jim Voll ,  Sandeep Yadav

Inventor： Jim Voll ,  Sandeep Yadav

IPC: G06F12/02

CPC classification number: H03M7/30 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0643 ,  G06F3/0689

Abstract: A system and method for transparently compressing file system data using compression group descriptors is provided. When data contained within a compression group be compressed beyond a predefined threshold value, a compression group descriptor is included in the compression group that signifies that the data for the group of level 0 blocks is compressed into a lesser number of physical data blocks. When performing a read operation, the file system first determines the appropriate compression group that contains the desired data and determines whether the compression group has been compressed. If so, the file system decompresses the data in the compression group before returning the decompressed data. If the magic value is not the first pointer position, then the data within the compression group was previously stored in an uncompressed format, and the data may be returned without performing a decompression operation.

Abstract translation: 提供了一种使用压缩组描述符对文件系统数据进行透明压缩的系统和方法。 当包含在压缩组中的数据被压缩超过预定义的阈值时，压缩组中包括压缩组描述符，该压缩组表示用于组0级块的数据被压缩成较少数量的物理数据块。 执行读取操作时，文件系统首先确定包含所需数据的适当的压缩组，并确定压缩组是否被压缩。 如果是这样，文件系统在返回解压缩数据之前解压缩压缩组中的数据。 如果魔术值不是第一个指针位置，则压缩组中的数据先前以未压缩格式存储，并且可以在不执行解压缩操作的情况下返回数据。

公开(公告)号：US07496678B2

公开(公告)日：2009-02-24

申请号：US11228689

申请日：2005-09-16

Applicant: Sandeep Yadav ,  Stephen Wu ,  Anureita Rao ,  Venkatesh Ks

Inventor： Sandeep Yadav ,  Stephen Wu ,  Anureita Rao ,  Venkatesh Ks

IPC: G06F15/16

CPC classification number: G06F17/30902 ,  G06F17/30017

Abstract: A method and system for unified caching of media content are described. The system includes a streaming media protocol engine to receive a request for a data stream in a first format from a client system; a streaming media mass storage subsystem to locate the data stream stored by a cache server in a second format; and a network protocol engine to serve the located data stream to the client system in the first format.

Abstract translation: 描述了媒体内容统一缓存的方法和系统。 该系统包括流媒体协议引擎，以从客户端系统接收对第一格式的数据流的请求; 流媒体大容量存储子系统，以第二格式定位由缓存服务器存储的数据流; 以及网络协议引擎，以第一格式将定位的数据流提供给客户端系统。

公开(公告)号：US20060259637A1

公开(公告)日：2006-11-16

申请号：US11228689

申请日：2005-09-16

Applicant: Sandeep Yadav ,  Stephen Wu ,  Anureita Rao ,  Venkatesh Ks

Inventor： Sandeep Yadav ,  Stephen Wu ,  Anureita Rao ,  Venkatesh Ks

IPC: G06F15/16

CPC classification number: G06F17/30902 ,  G06F17/30017

Abstract: A method and system for unified caching of media content are described. The system includes a streaming media protocol engine to receive a request for a data stream in a first format from a client system; a streaming media mass storage subsystem to locate the data stream stored by a cache server in a second format; and a network protocol engine to serve the located data stream to the client system in the first format.