公开(公告)号：US20060181980A1

公开(公告)日：2006-08-17

申请号：US10906352

申请日：2005-02-15

申请人： Windsor Hsu ,  Lan Huang ,  Michael Ko ,  Shauchi Ong

发明人： Windsor Hsu ,  Lan Huang ,  Michael Ko ,  Shauchi Ong

IPC分类号： G11B5/09

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.

公开(公告)号：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.

摘要翻译： 根据本发明，提供了一种用于组织用于快速检索的数据对象的系统。 该系统包括定义数据扇区的至少一个数据存储介质。 另外，该系统在数据存储介质上包括至少一个数据对象。 而且，该系统包括与至少一个数据对象相关联的至少一个密钥。 此外，该系统在数据存储介质上包括至少一个一次写入索引，以管理该至少一个数据对象。

公开(公告)号：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.

摘要翻译： 本发明提供一种确保存储在可重写存储器上的数据是不可变的方法。 该方法包括将所选择的用户可寻址的存储块初始化为可写状态。 此外，该方法包括接受要存储在指定的用户可寻址块中的数据。 此外，该方法包括确定指定的块是否是可写的。 此外，该方法包括将可接受的数据存储到可重写存储器中。 此外，该方法包括将指定块的状态设置为不可写。 在一个实施例中，与每个块相关联的可写/不可写状态被编码并存储在相应块的内容中。 在另一个实施例中，确定所指定的块是否是可写入的步骤，将所接受的数据存储到可重写存储器中，以及将指定块的状态设置为不可写入的步骤是集成且不可分割的。

公开(公告)号：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.

摘要翻译： 期望的变换例如压缩，加密和/或编码被应用于数据，使得变换数据中的重复块的数量增加，并且块主要是预定大小。 另外，识别出转换数据的独特和重复的块。 可变大小的窗口在该组数据上传递以生成具有预定大小的变换数据的工作块。 当工作块是重复的数据块时，从数据集中选择下一组未转换的数据，进行变换，然后进行评估。 当工作块不是重复的数据块时，通过在该组数据上滑动窗口来生成另一个被评估的工作块来选择下一组数据。

公开(公告)号：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.

摘要翻译： 数据分块系统将数据分成主要固定大小的块，以便可以识别重复数据。 数据分块系统可用于通过允许主要唯一数据块的存储或传输来减少数据存储并节省网络带宽。 也可以通过允许使用识别的重复块来修复影响数据块的错误来提高数据存储和网络传输的可靠性。 数据分块系统通过选择固定大小的块来块数据，然后沿着数据移动窗口直到找到与现有数据的匹配。 当窗口移动数据时，在传递的数据中形成主要是固定大小的独特块。 几个实施例提供了确定所选择的块是否匹配现有数据的替代方法，以及通过该窗口移动数据的方法。 为了定位重复数据，数据分块系统通过计算数据块的数学函数并将计算的值插入散列表来记住数据。

公开(公告)号：US20070011751A1

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

申请号：US11160806

申请日：2005-07-11

申请人： Windsor Hsu ,  Shauchi Ong

发明人： Windsor Hsu ,  Shauchi Ong

IPC分类号： G06F11/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.

摘要翻译： 根据本发明，提供了一种用于利用存储系统来保护数据的系统。 该系统包括至少一个存储设备。 此外，该系统包括用于识别插入或移除存储设备的尝试的安全机制。 此外，该系统包括用于控制存储设备的插入和移除的管理单元。

公开(公告)号：US20090112843A1

公开(公告)日：2009-04-30

申请号：US11927167

申请日：2007-10-29

申请人： Windsor Hsu ,  Shauchi Ong

发明人： Windsor Hsu ,  Shauchi Ong

IPC分类号： G06F7/10

CPC分类号： G06F16/93

摘要： Programs, systems and methods for providing differentiated service levels for a search index are disclosed. Data object documents are processed by extracting terms and scoring each of the terms associated with each document according to criteria to indicate relative importance of the associated document. A plurality of posting lists are generated for each term each comprising entries identifying documents that include the term. The entries are allocated to the different posting lists for the given term depending upon the score for the term associated with particular document. The different posting lists, e.g. a high score and low score posting list, may then be stored as data objects managed according to their indicated importance. For example, the high score posting list data object may be stored in higher performance storage than the low score posting list data object. Scores may be regularly updated.

摘要翻译： 公开了用于为搜索索引提供差异化​​服务水平的程序，系统和方法。 通过提取术语并根据标准对与每个文档相关联的每个术语进行评分来处理数据对象文档，以指示相关文档的相对重要性。 为每个术语生成多个发布列表，每个术语包括标识包括该术语的文档的条目。 根据与特定文档相关联的术语的分数，将条目分配给给定术语的不同的发布列表。 不同的发布列表，例如 然后可以将高分和低分的发布列表存储为根据其所指示的重要性来管理的数据对象。 例如，高分数发布列表数据对象可以存储在比低分信息列表数据对象更高的性能存储器中。 分数可能会定期更新。

公开(公告)号：US20050071436A1

公开(公告)日：2005-03-31

申请号：US10674375

申请日：2003-09-30

申请人： Windsor Hsu ,  Shauchi Ong

发明人： Windsor Hsu ,  Shauchi Ong

IPC分类号： G06F11/00 ,  G06F12/00 ,  G06F13/00 ,  G06F15/173 ,  G06F17/30

CPC分类号： G06F11/008 ,  G06F11/1096 ,  G06F11/1662 ,  G06F11/2097 ,  G06F17/30097 ,  H04L67/1097

摘要： A system and method of optimizing storage of common data blocks within a networked storage system comprises receiving a data block to be stored in the networked storage system, analyzing contents of the received data block to determine how many copies of the data block the system is entrusted to store and how many copies of the data block existing within the system, and to identify a location of each copy of the data block within the system, identifying performance and reliability requirements of the system, determining an optimal number of copies of the received data block to store in the system, wherein the determination is made according to a number of copies of the data block the system is entrusted to store together with the identified performance and reliability requirements of the system, and maintaining the optimal number of copies of the received data block within the system.

摘要翻译： 一种优化网络存储系统内公共数据块存储的系统和方法包括接收要存储在网络存储系统中的数据块，分析接收到的数据块的内容，以确定系统被委托的数据块的副本数 存储和存储系统内存在的数据块的副本，以及识别系统内的数据块的每个副本的位置，识别系统的性能和可靠性要求，确定接收数据的最佳拷贝数 块存储在系统中，其中根据系统被委托存储的数据块的副本数量与所识别的系统的性能和可靠性要求一起进行确定，并且保持所接收的最佳拷贝数 系统内的数据块。

公开(公告)号：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存储系统的数据。 此外，该方法包括识别要写入数据的目标扇区。 此外，该方法包括确定所接收的数据是否可以被添加到目标扇区。 此外，如果确定可以将接收的数据添加到目标扇区，则该方法包括将接收到的数据添加到目标扇区。

公开(公告)号：US07512044B2

公开(公告)日：2009-03-31

申请号：US10906352

申请日：2005-02-15

申请人： Windsor Wee Sun Hsu ,  Lan Huang ,  Michael Anthony Ko ,  Shauchi Ong

发明人： Windsor Wee Sun Hsu ,  Lan Huang ,  Michael Anthony Ko ,  Shauchi Ong

IPC分类号： G11B27/36

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存储系统的数据。 此外，该方法包括识别要写入数据的目标扇区。 此外，该方法包括确定所接收的数据是否可以被添加到目标扇区。 此外，如果确定可以将接收的数据添加到目标扇区，则该方法包括将接收到的数据添加到目标扇区。