利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.027 秒)

    SYSTEMS AND METHODS FOR EFFICIENTLY STORING DATA
    1.
    发明申请
    SYSTEMS AND METHODS FOR EFFICIENTLY STORING DATA 有权
    有效存储数据的系统和方法

    公开(公告)号：US20140032861A1

    公开(公告)日：2014-01-30

    申请号：US13558481

    申请日：2012-07-26

    申请人： Rezaul Shah Mohammad ISLAM ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI ,  Gandhi SIVAKUMAR

    发明人： Rezaul Shah Mohammad ISLAM ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI ,  Gandhi SIVAKUMAR

    IPC分类号： G06F12/16

    CPC分类号： G06F12/0646 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/064 ,  G06F3/0641 ,  G06F3/0646 ,  G06F3/0649 ,  G06F3/0655 ,  G06F3/0673 ,  G06F3/0685 ,  G06F11/1453 ,  G06F11/3409 ,  G06F11/3485 ,  G06F17/30097 ,  G06F17/30156 ,  G06F2201/88 ,  G06F2212/1016

    摘要： One method includes assigning a pointer from multiple logical blocks to the same original physical block if the multiple logical blocks include the same data. The method further includes receiving a command to write data to the first logical block and determining if the first logical block is a frequently accessed logical block. If the first logical block is a frequently accessed logical block, ownership of the original physical block is assigned to the first logical block. If ownership is established, the method includes copying any data stored in the original physical block to a new physical block, assigning a pointer from a second logical block to the new physical block, and performing the write command on the original physical block. A system includes a processor for performing the above method. One computer program product includes computer code for performing the method described above.

    摘要翻译： 一种方法包括：如果多个逻辑块包括相同的数据，则将来自多个逻辑块的指针分配给相同的原始物理块。 该方法还包括接收将数据写入第一逻辑块的命令，以及确定第一逻辑块是否是频繁访问的逻辑块。 如果第一逻辑块是经常访问的逻辑块，则将原始物理块的所有权分配给第一逻辑块。 如果所有权建立，则该方法包括将存储在原始物理块中的任何数据复制到新的物理块，将指针从第二逻辑块分配给新的物理块，并在原始物理块上执行写入命令。 系统包括用于执行上述方法的处理器。 一个计算机程序产品包括用于执行上述方法的计算机代码。

    METHODS AND SYSTEMS FOR DATA CLEANUP USING PHYSICAL IMAGE OF FILES ON STORAGE DEVICES
    2.
    发明申请
    METHODS AND SYSTEMS FOR DATA CLEANUP USING PHYSICAL IMAGE OF FILES ON STORAGE DEVICES 有权
    使用存储设备文件的物理图像进行数据清理的方法和系统

    公开(公告)号：US20140046912A1

    公开(公告)日：2014-02-13

    申请号：US13584427

    申请日：2012-08-13

    申请人： Duane Mark BALDWIN ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI ,  Prashant SODHIYA

    发明人： Duane Mark BALDWIN ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI ,  Prashant SODHIYA

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30138

    摘要： Systems and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.

    摘要翻译： 提供了系统和计算机程序产品，用于优化从一个或多个数据存储设备中删除的文件的选择，以释放一个或多个数据存储设备中的预定量的空间。 一种方法包括分析一个或多个数据存储设备中的多个文件的每个文件占用的有效空间，从多个文件中识别构成文件的一个或多个数据块以释放预定量的空间 基于对所述多个文件中的每个文件的有效空间的分析，基于所识别的一个或多个数据块，将所述多个文件中的一个或多个作为一个或多个候选文件进行删除，并且删除所述一个或多个 用于从一个或多个数据存储设备删除的更多候选文件。

    OPTIMIZING WIDE AREA NETWORK (WAN) TRAFFIC BY PROVIDING HOME SITE DEDUPLICATION INFORMATION TO A CACHE SITE
    5.
    发明申请
    OPTIMIZING WIDE AREA NETWORK (WAN) TRAFFIC BY PROVIDING HOME SITE DEDUPLICATION INFORMATION TO A CACHE SITE 有权
    优化广域网（WAN）通过向家庭网站提供的缓存信息提供给缓存站点

    公开(公告)号：US20130218848A1

    公开(公告)日：2013-08-22

    申请号：US13402064

    申请日：2012-02-22

    申请人： Kalyan Chakravarthy GUNDA ,  Shah Mohammad Rezaul ISLAM ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI

    发明人： Kalyan Chakravarthy GUNDA ,  Shah Mohammad Rezaul ISLAM ,  Sandeep Ramesh PATIL ,  Riyazahamad Moulasab SHIRAGUPPI

    IPC分类号： G06F17/30 ,  G06F15/16

    CPC分类号： H04L67/2842 ,  H04L67/1097

    摘要： Methods, systems, and physical computer-readable storage medium are provided to optimize WAN traffic on cloud networking sites. In an embodiment, by way of example only, a method includes fetching deduplication information from a home site to build a repository comprising duplicate peer file sets, one or more of the duplicate peer file sets including one or more peer files, referring to the repository to determine whether a target file corresponds with a cache copy of a peer file of the one or more peer files included in the duplicate peer file sets, and creating a local copy of the peer file of the one or more peer files, if a determination is made that the target file corresponds with the cache copy of the peer file of the one or more peer files included in the duplicate peer file sets.

    摘要翻译： 提供方法，系统和物理计算机可读存储介质来优化云网络站点上的WAN流量。 在一个实施例中，仅作为示例，一种方法包括从归属站点获取重复数据删除信息以构建包含重复的对等文件集的存储库，包括一个或多个重复对等文件集，包括一个或多个对等文件，参考存储库 以确定目标文件是否对应于重复对等文件集中包括的一个或多个对等文件的对等文件的高速缓存副本，以及如果确定了所述一个或多个对等文件的对等文件的本地副本 使目标文件与包含在重复对等文件集中的一个或多个对等文件的对等文件的缓存副本相对应。

    INCREASED IN-LINE DEDUPLICATION EFFICIENCY
    6.
    发明申请
    INCREASED IN-LINE DEDUPLICATION EFFICIENCY 有权
    提高在线重复效率

    公开(公告)号：US20130268496A1

    公开(公告)日：2013-10-10

    申请号：US13440606

    申请日：2012-04-05

    申请人： Duane Mark BALDWIN ,  Nilesh P. BHOSALE ,  John Thomas OLSON ,  Sandeep Ramesh PATIL

    发明人： Duane Mark BALDWIN ,  Nilesh P. BHOSALE ,  John Thomas OLSON ,  Sandeep Ramesh PATIL

    IPC分类号： G06F7/00

    CPC分类号： G06F17/30156

    摘要： Exemplary method, system, and computer program product embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only hash values are calculated in nth iterations for accumulative data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the accumulative data chunks are matched in a nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object. Additional system and computer program product embodiments are disclosed and provide related advantages.

    摘要翻译： 提供了用于在计算环境中提高在线重复数据删除效率的示例性方法，系统和计算机程序产品实施例。 在一个实施例中，作为示例，仅在从用于在线重复数据消除所请求的对象提取的累积数据块的第n次迭代中计算散列值。 对于第n次迭代中的每一个，累积数据块的计算散列值在第n个散列索引表中与存储中的现有对象的对应散列值相匹配。 在匹配期间检测到不匹配时退出第n个散列索引表。 不匹配被确定为唯一对象并被存储。 计算对象的哈希值。 主散列索引表用对象的计算哈希值和唯一对象的计算散列值进行更新。 公开了附加的系统和计算机程序产品实施例并提供相关的优点。

    INCREASED IN-LINE DEDUPLICATION EFFICIENCY
    7.
    发明申请
    INCREASED IN-LINE DEDUPLICATION EFFICIENCY 有权
    提高在线重复效率

    公开(公告)号：US20130268497A1

    公开(公告)日：2013-10-10

    申请号：US13440659

    申请日：2012-04-05

    申请人： Duane Mark BALDWIN ,  Nilesh P. BHOSALE ,  John Thomas OLSON ,  Sandeep Ramesh PATIL

    发明人： Duane Mark BALDWIN ,  Nilesh P. BHOSALE ,  John Thomas OLSON ,  Sandeep Ramesh PATIL

    IPC分类号： G06F17/30

    CPC分类号： G06F3/0641 ,  G06F3/0604 ,  G06F3/0683 ,  G06F17/30159

    摘要： Exemplary embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only, hash values are calculated in nth iterations on data samples from fixed size data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the data samples from the fixed size data chunks are matched in an nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object.

    摘要翻译： 提供了用于在计算环境中提高在线重复数据删除效率的示例性实施例。 在一个实施例中，仅作为示例，在第n次迭代中计算散列值，该数据样本来自从用于在线重复数据消除所请求的对象提取的固定大小数据块。 对于第n次迭代中的每一个，来自固定大小数据块的数据样本的计算散列值在第n个散列索引表中与存储中现有对象的对应散列值相匹配。 在匹配期间检测到不匹配时退出第n个散列索引表。 不匹配被确定为唯一对象并被存储。 计算对象的哈希值。 主散列索引表用对象的计算哈希值和唯一对象的计算散列值进行更新。