专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08623099B2 System and method for securing data within a storage system 有权
标题翻译：用于保护存储系统内的数据的系统和方法
公开(公告)号：US08623099B2
公开(公告)日：2014-01-07
申请号：US12130970
申请日：2008-05-30
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G06F21/00
CPC分类号： G06F11/004 , G06F3/0623 , G06F3/0637 , G06F3/0674
摘要： According to the present invention, there is provided a system for securing data with a storage system. The system includes at least one storage device. In addition, the system includes a security mechanism for recognizing an attempt to insert or remove the storage device. Moreover, the system includes a management unit to control the insertion and removal of the storage device.
摘要翻译：根据本发明，提供了一种用于利用存储系统来保护数据的系统。该系统包括至少一个存储设备。此外，该系统包括用于识别插入或移除存储设备的尝试的安全机制。此外，该系统包括用于控制存储设备的插入和移除的管理单元。

2. 发明申请

US20090141619A1 SYSTEM AND METHOD FOR ENABLING EFFICIENT SMALL WRITES TO WORM STORAGE 有权
标题翻译：用于实现有效的小写入到存储的系统和方法
公开(公告)号：US20090141619A1
公开(公告)日：2009-06-04
申请号：US12334280
申请日：2008-12-12
申请人： Windsor Wee Sun Hsu , Lan Huang , Michael Anthony Ko , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Lan Huang , Michael Anthony Ko , Shauchi Ong
IPC分类号： G11B7/00
CPC分类号： G11B27/3027 , G11B2020/1232 , G11B2020/1292 , G11B2220/218 , G11B2220/2516
摘要： According to the present invention, there is provided a method of providing a WORM storage system, the method including a sector-append capability. The method includes receiving data to be written to a WORM storage system. In addition, the method includes identifying a target sector at which the data is to be written. Also, the method includes determining if the received data can be added to the target sector. Moreover, the method includes adding the received data to the target sector if it is determined that the received data can be added to the target sector.
摘要翻译：根据本发明，提供了一种提供WORM存储系统的方法，该方法包括扇区附加能力。该方法包括接收要写入WORM存储系统的数据。此外，该方法包括识别要写入数据的目标扇区。此外，该方法包括确定所接收的数据是否可以被添加到目标扇区。此外，如果确定可以将接收的数据添加到目标扇区，则该方法包括将接收到的数据添加到目标扇区。

3. 发明申请

US20060129588A1 SYSTEM AND METHOD FOR ORGANIZING DATA WITH A WRITE-ONCE INDEX 审中-公开
标题翻译：用于组织数据与写入索引的系统和方法
公开(公告)号：US20060129588A1
公开(公告)日：2006-06-15
申请号：US10905103
申请日：2004-12-15
申请人： Windsor Hsu , Shauchi Ong
发明人： Windsor Hsu , Shauchi Ong
IPC分类号： G06F17/00
摘要： According to the present invention, there is provided a system for organizing data objects for fast retrieval. The system includes at least one data storage medium defining data sectors. In addition, the system includes at least one data object on the data storage medium. Also, the system includes at least one key associated with the at least one data object. Moreover, the system includes at least one write-once index on the data storage medium to manage the at least one data object.
摘要翻译：根据本发明，提供了一种用于组织用于快速检索的数据对象的系统。该系统包括定义数据扇区的至少一个数据存储介质。另外，该系统在数据存储介质上包括至少一个数据对象。而且，该系统包括与至少一个数据对象相关联的至少一个密钥。此外，该系统在数据存储介质上包括至少一个一次写入索引，以管理该至少一个数据对象。

4. 发明申请

US20060095687A1 System and method for achieving reliable worm storage using WMRM storage 失效
标题翻译：使用WMRM存储实现可靠的蠕虫存储的系统和方法
公开(公告)号：US20060095687A1
公开(公告)日：2006-05-04
申请号：US10977160
申请日：2004-10-29
申请人： Windsor Hsu , Shauchi Ong
发明人： Windsor Hsu , Shauchi Ong
IPC分类号： G06F12/14
CPC分类号： G06F3/064 , G06F3/0623 , G06F3/0637 , G06F3/0674 , G06F11/1076 , G11B27/322 , G11B2220/211
摘要： The invention provides a method for ensuring that data stored on rewritable storage is immutable. The method includes initializing selected user-addressable blocks of storage to a writable state. In addition, the method includes accepting data to be stored in specified user-addressable blocks. Also, the method includes determining if the specified block(s) is writable. Also, the method includes storing the accepted data to the rewritable storage. Moreover, the method includes setting the state of the specified block(s) to non-writable. In one embodiment, the writable/non-writable state associated with each block is encoded and stored in the contents of the corresponding block. In another embodiment, the steps of determining whether the specified block(s) is writable, storing the accepted data to the rewritable storage, and setting the state of the specified block(s) to non-writable, are integrated and indivisible.
摘要翻译：本发明提供一种确保存储在可重写存储器上的数据是不可变的方法。该方法包括将所选择的用户可寻址的存储块初始化为可写状态。此外，该方法包括接受要存储在指定的用户可寻址块中的数据。此外，该方法包括确定指定的块是否是可写的。此外，该方法包括将可接受的数据存储到可重写存储器中。此外，该方法包括将指定块的状态设置为不可写。在一个实施例中，与每个块相关联的可写/不可写状态被编码并存储在相应块的内容中。在另一个实施例中，确定所指定的块是否是可写入的步骤，将所接受的数据存储到可重写存储器中，以及将指定块的状态设置为不可写入的步骤是集成且不可分割的。

5. 发明申请

US20060004808A1 System and method for performing compression/encryption on data such that the number of duplicate blocks in the transformed data is increased 失效
标题翻译：对数据执行压缩/加密的系统和方法使得变换数据中的重复块的数量增加
公开(公告)号：US20060004808A1
公开(公告)日：2006-01-05
申请号：US10880843
申请日：2004-06-30
申请人： Windsor Hsu , Shauchi Ong
发明人： Windsor Hsu , Shauchi Ong
IPC分类号： G06F17/00
CPC分类号： H03M7/3084 , Y10S707/99942
摘要： Desired transformations such as compression, encryption and/or encoding are applied to data such that the number of duplicate chunks in the transformed data is increased and the chunks are predominantly of a predetermined size. Additionally, the unique and duplicate chunks of transformed data are identified. A variable-sized window is passed over the set of data to generate a working chunk of transformed data that is of the predetermined size. When the working chunk is a duplicate chunk of data, a next group of untransformed data is selected from the set of data, transformed and then evaluated. When the working chunk is not a duplicate chunk of data, a next group of data is selected by sliding the window over the set of data to generate another working chunk that is evaluated.
摘要翻译：期望的变换例如压缩，加密和/或编码被应用于数据，使得变换数据中的重复块的数量增加，并且块主要是预定大小。另外，识别出转换数据的独特和重复的块。可变大小的窗口在该组数据上传递以生成具有预定大小的变换数据的工作块。当工作块是重复的数据块时，从数据集中选择下一组未转换的数据，进行变换，然后进行评估。当工作块不是重复的数据块时，通过在该组数据上滑动窗口来生成另一个被评估的工作块来选择下一组数据。

6. 发明申请

US20090193289A1 Reducing data loss and unavailability by integrating multiple levels of a storage hierarchy 失效
标题翻译：通过集成多个级别的存储层次结构来减少数据丢失和不可用性
公开(公告)号：US20090193289A1
公开(公告)日：2009-07-30
申请号：US12186676
申请日：2008-08-06
申请人： Windsor Wee Sun Hsu , Shauchi Ong , John Davis Palmer
发明人： Windsor Wee Sun Hsu , Shauchi Ong , John Davis Palmer
IPC分类号： G06F11/14
CPC分类号： G06F11/1474 , G06F11/1458 , G06F11/1471 , G06F11/1662 , G06F11/2094 , G06F11/2097 , Y10S707/99955
摘要： A method for reducing data loss and unavailability by integrating multiple levels of a storage hierarchy is provided. The method includes receiving a read request. In addition, the method includes recognizing a data failure in response to the read request. The method further includes locating an alternate source of the data to be read in response to recognizing the data failure. The alternate source includes data cached at devices in the storage hierarchy, data in a backup system, and cumulative changes to the data since the last backup. Moreover, the method includes responding to the read request with data from the alternate source.
摘要翻译：提供了一种通过集成多个级别的存储层次来减少数据丢失和不可用性的方法。该方法包括接收读请求。此外，该方法包括响应于读取请求来识别数据故障。该方法还包括响应于识别数据故障而定位要读取的数据的备用源。替代源包括在存储层次结构中的设备缓存的数据，备份系统中的数据以及自上次备份以来对数据的累积更改。此外，该方法包括用来自备用源的数据响应于读请求。

7. 发明申请

US20080161885A1 System and Method for Content-based Object Ranking to Facilitate Information Lifecycle Management 失效
标题翻译：基于内容的对象排名系统和方法，促进信息生命周期管理
公开(公告)号：US20080161885A1
公开(公告)日：2008-07-03
申请号：US11617585
申请日：2006-12-28
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： A61N1/00
CPC分类号： G06F3/0649 , G06F3/061 , G06F3/0617 , G06F3/0685
摘要： A method to manage objects in an information lifecycle management system is provided. The method includes determining a score for each of the objects based on a score of at least one feature within respective ones of each of the objects where the score of the at least one feature being associated with a valuation of the at least one feature. The method also includes managing each of the objects based on the score for each of the objects wherein higher scored objects are managed preferentially.
摘要翻译：提供了一种在信息生命周期管理系统中管理对象的方法。该方法包括基于每个对象中的每个对象中的至少一个特征的分数来确定每个对象的得分，其中至少一个特征的得分与至少一个特征的估值相关联。该方法还包括基于每个对象的分数管理每个对象，其中较高分数对象被优先管理。

8. 发明申请

US20050091234A1 System and method for dividing data into predominantly fixed-sized chunks so that duplicate data chunks may be identified 有权
标题翻译：将数据分割成主要是固定大小的块的系统和方法，以便可以识别重复的数据块
公开(公告)号：US20050091234A1
公开(公告)日：2005-04-28
申请号：US10693284
申请日：2003-10-23
申请人： Windsor Hsu , Shauchi Ong
发明人： Windsor Hsu , Shauchi Ong
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30985 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945
摘要： A data chunking system divides data into predominantly fixed-sized chunks such that duplicate data may be identified. The data chunking system may be used to reduce the data storage and save network bandwidth by allowing storage or transmission of primarily unique data chunks. The system may also be used to increase reliability in data storage and network transmission, by allowing an error affecting a data chunk to be repaired with an identified duplicate chunk. The data chunking system chunks data by selecting a chunk of fixed size, then moving a window along the data until a match to existing data is found. As the window moves across the data, unique chunks predominantly of fixed size are formed in the data passed over. Several embodiments provide alternate methods of determining whether a selected chunk matches existing data and methods by which the window is moved through the data. To locate duplicate data, the data chunking system remembers data by computing a mathematical function of a data chunk and inserting the computed value into a hash table.
摘要翻译：数据分块系统将数据分成主要固定大小的块，以便可以识别重复数据。数据分块系统可用于通过允许主要唯一数据块的存储或传输来减少数据存储并节省网络带宽。也可以通过允许使用识别的重复块来修复影响数据块的错误来提高数据存储和网络传输的可靠性。数据分块系统通过选择固定大小的块来块数据，然后沿着数据移动窗口直到找到与现有数据的匹配。当窗口移动数据时，在传递的数据中形成主要是固定大小的独特块。几个实施例提供了确定所选择的块是否匹配现有数据的替代方法，以及通过该窗口移动数据的方法。为了定位重复数据，数据分块系统通过计算数据块的数学函数并将计算的值插入散列表来记住数据。

9. 发明授权

US5600817A Asynchronous read-ahead disk caching using multiple disk I/O processes adn dynamically variable prefetch length 失效
标题翻译：使用多个磁盘I / O进程的异步预读磁盘缓存动态变量预取长度
公开(公告)号：US5600817A
公开(公告)日：1997-02-04
申请号：US371107
申请日：1995-01-11
申请人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien W. Shih
发明人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien W. Shih
IPC分类号： G06F12/08
CPC分类号： G06F12/0862 , G06F12/0866
摘要： A file-based Read-ahead method employs asynchronous I/O processes to fetch Demand and Read-ahead data blocks from a disk (4), depending on their physical and logical sequentialities. When a file system (10) issues an I/O address to obtain data blocks from a file, it also determines the disk location of data blocks that are logically consecutive with the demanded data. The number of such data blocks to be determined in this process is accomplished in accordance with a dynamic Read-ahead method. If the data blocks are physically consecutive, a single I/O request is sent to a disk driver to obtain both the Demand data block and to Prefetch the Read-Ahead data block(s). If, instead, the data blocks are found not to be physically consecutive, a plurality of asynchronous disk I/O requests are issued so as to separately obtain the Demand and the Read-Ahead data blocks.
摘要翻译：基于文件的预读方法使用异步I / O进程从磁盘（4）获取请求和预读数据块，具体取决于其物理和逻辑顺序。当文件系统（10）发出I / O地址以从文件中获取数据块时，它还确定逻辑上与要求数据连续的数据块的磁盘位置。在该过程中要确定的这种数据块的数量是根据动态预读方法来完成的。如果数据块在物理上是连续的，则将单个I / O请求发送到磁盘驱动器以获得需求数据块和预取预读数据块。如果发现数据块不是物理上连续的，则发出多个异步磁盘I / O请求，以分别获得需求和预读数据块。

10. 发明授权

US5410653A Asynchronous read-ahead disk caching using multiple disk I/O processes and dynamically variable prefetch length 失效
标题翻译：使用多个磁盘I / O进程和动态变量预取长度的异步预读磁盘缓存
公开(公告)号：US5410653A
公开(公告)日：1995-04-25
申请号：US899565
申请日：1992-06-16
申请人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien W. Shih
发明人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien W. Shih
IPC分类号： G06F12/08 , G06F13/00
CPC分类号： G06F12/0862 , G06F12/0866
摘要： A file-based Read-ahead method employs asynchronous I/O processes to fetch Demand and Read-ahead data blocks from a disk (4), depending on their physical and logical sequentialities. When a file system (10) issues an I/O address to obtain data blocks from a file, it also determines the disk location of data blocks that are logically consecutive with the demanded data. The number of such data blocks to be determined in this process is accomplished in accordance with a dynamic Read-ahead method. If the data blocks are physically consecutive, a single I/O request is sent to a disk driver to obtain both the Demand data block and to Prefetch the Read-Ahead data block(s). If, instead, the data blocks are found not to be physically consecutive, a plurality of asynchronous disk I/O requests are issued so as to separately obtain the Demand and the Read-Ahead data blocks.
摘要翻译：基于文件的预读方法使用异步I / O进程从磁盘（4）获取请求和预读数据块，具体取决于其物理和逻辑顺序。当文件系统（10）发出I / O地址以从文件中获取数据块时，它还确定逻辑上与要求数据连续的数据块的磁盘位置。在该过程中要确定的这种数据块的数量是根据动态预读方法来完成的。如果数据块在物理上是连续的，则将单个I / O请求发送到磁盘驱动器以获得需求数据块和预取预读数据块。如果发现数据块不是物理上连续的，则发出多个异步磁盘I / O请求，以分别获得需求和预读数据块。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式