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

1. 发明申请

US20050131905A1 Data repository and method for promoting network storage of data 审中-公开
标题翻译：数据存储库和数据库网络存储方法
公开(公告)号：US20050131905A1
公开(公告)日：2005-06-16
申请号：US10967705
申请日：2004-10-14
申请人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
发明人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
IPC分类号： G06F1/00 , G06F17/30
CPC分类号： G06F21/64 , G06F16/137 , G06F21/10 , G06F21/60 , G06F21/62 , G06F21/6209 , G06F21/6272 , G06F21/645 , G06Q20/206 , Y10S707/959 , Y10S707/99932 , Y10S707/99953
摘要： A method by which more than one client program connected to a network stores the same data item at the same location or locations in a data repository connected to the network, the method comprising having a first client program deposit a first data item in a data repository, the depositing including determining a digital fingerprint from the data item using a reproducible pseudorandom process that produces digital fingerprints having a pseudorandom distribution, storing the data item in the data repository at a location or locations associated with the digital fingerprint, and associating a deletion permission token with the data item, and storing this association in the data repository, having a second client program initiate a process for depositing a second data item in the data repository, wherein the second data item is identical to the data item stored by the first client program, the process including determining a digital fingerprint from the second data item using the reproducible pseudorandom process, determining from the digital fingerprint that a data item identical to the second data item is already stored in the data repository, relying on the data item already stored in the data repository for storage of the second data item rather than storing a separate copy of the second data item, and associating a second deletion permission token with the data item already stored, and storing this association in the data repository, having a client program initiate a process for deleting the data item already stored in the repository, wherein a deletion permission token associated with the data item is deleted from the repository, but the data item itself is not deleted.
摘要翻译：一种连接到网络的多于一个的客户端程序在连接到网络的数据存储库中的相同位置存储相同数据项的方法，该方法包括：将第一个客户程序存入数据存储库中的第一数据项存储包括使用产生具有伪随机分布的数字指纹的可重现的伪随机过程从数据项确定数字指纹，将数据项存储在与数字指纹相关联的位置或位置处的数据库中，并将删除许可令牌与数据项，并将该关联存储在数据存储库中，具有第二客户端程序启动用于在数据存储库中存储第二数据项的处理，其中第二数据项与第一客户端存储的数据项相同程序，该过程包括使用再现从第二数据项确定数字指纹根据已经存储在数据存储库中的数据项，从数字指纹确定与第二数据项相同的数据项已经存储在数据存储库中，而不是存储单独的将第二数据项的副本，以及将第二删除权限令牌与已经存储的数据项相关联，并将该关联存储在数据存储库中，具有客户端程序启动用于删除已经存储在存储库中的数据项的处理，其中a 与数据项相关联的删除权限令牌从存储库中删除，但数据项本身不会被删除。

2. 发明申请

US20050131904A1 Data repository and method for promoting network storage of data 有权
标题翻译：数据存储库和数据库网络存储方法
公开(公告)号：US20050131904A1
公开(公告)日：2005-06-16
申请号：US10967031
申请日：2004-10-14
申请人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
发明人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
IPC分类号： G06F1/00 , G06F17/30
CPC分类号： G06F21/64 , G06F17/30097 , G06F21/10 , G06F21/60 , G06F21/62 , G06F21/6209 , G06F21/6272 , G06F21/645 , G06Q20/206 , Y10S707/959 , Y10S707/99932 , Y10S707/99953
摘要： A method for providing naming and access control of data items in a data repository, the method comprising having a first client program deposit a data item in the data repository, the depositing including determining a digital fingerprint from the data item, and storing the data item in the data repository at a location or locations associated with the fingerprint, having the first client program specify an object name for an object that comprises a set of data items, storing in the repository an association between the name and the set of data items, and allowing the client program to retrieve a data item from the set of data items by specifying the object name and without providing the digital fingerprint of any data item or composite of data items.
摘要翻译：一种用于在数据存储库中提供数据项的命名和访问控制的方法，所述方法包括：将第一客户程序存储在所述数据存储库中的数据项，所述存入包括从所述数据项确定数字指纹，以及存储所述数据项在与所述指纹相关联的位置或位置处的数据存储库中，使所述第一客户端程序指定包括一组数据项的对象的对象名称，在所述存储库中存储所述名称和所述数据项集合之间的关联，并且允许客户端程序通过指定对象名称并且不提供任何数据项或数据项的组合的数字指纹来从该组数据项中检索数据项。

3. 发明申请

US20050131903A1 Data repository and method for promoting network storage of data 审中-公开
标题翻译：数据存储库和数据库网络存储方法
公开(公告)号：US20050131903A1
公开(公告)日：2005-06-16
申请号：US10966843
申请日：2004-10-14
申请人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
发明人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
IPC分类号： G06F1/00 , G06F17/30
CPC分类号： G06F21/64 , G06F16/137 , G06F21/10 , G06F21/60 , G06F21/62 , G06F21/6209 , G06F21/6272 , G06F21/645 , G06Q20/206 , Y10S707/959 , Y10S707/99932 , Y10S707/99953
摘要： A method by which objects that have content in common share storage in a data repository, the method comprising breaking an object into component data items at boundaries that depend upon the content of the object, determining digital fingerprints for the component data items, initiating processes to deposit a plurality of objects containing distinct occurrences of the identical component data item within their content, storing distinct information for some component data items of an object's content, but for other component data items relying on the identical component data item already stored, rather than storing a separate copy of the identical component data item.
摘要翻译：一种在数据存储库中具有公共共享存储中的内容的对象的方法，该方法包括将对象分解成依赖于对象的内容的边界处的组件数据项，确定组件数据项的数字指纹，启动过程在其内容中存储包含相同组件数据项的不同出现的多个对象，存储对象内容的某些组件数据项的不同信息，而对于依赖于已存储的相同组件数据项的其他组件数据项，而不是存储相同组件数据项的单独副本。

4. 发明申请

US20070245082A1 Storage Assignment Technique for Scalable and Fault Tolerant Storage System 有权
标题翻译：可扩展和容错存储系统的存储分配技术
公开(公告)号：US20070245082A1
公开(公告)日：2007-10-18
申请号：US11696644
申请日：2007-04-04
申请人： Norman Margolus , Jonathan Coburn
发明人： Norman Margolus , Jonathan Coburn
IPC分类号： G06F12/16 , G06F12/00
CPC分类号： G06F11/2094 , G06F11/1096 , G06F11/1662 , G06F2211/1023 , G06F2211/1028 , G06F2211/1057
摘要： A method for organizing a storage system that is scalable and fault tolerant, the method including grouping together a number D of storage elements to form the storage system, where D is more than one, constructing a storage assignment table that includes table entries, computing, for each of the storage elements, an available capacity that depends on constraints on the placement of redundant data within the storage system, summing the available capacities to form a total available capacity for the storage system; and assigning the table entries in the storage assignment table to each identify one of the storage elements, wherein the available capacity of each of the storage elements is its effective storage capacity when used as part of the storage system, wherein not all of the D storage elements that form the storage system have the same available capacity, and wherein the fraction of all table entries that identify a one of the storage elements depends upon its fraction of the total available capacity.
摘要翻译：一种用于组织可扩展和容错的存储系统的方法，所述方法包括将存储元件的数量D分组在一起以形成存储系统，其中D大于1，构建包括表条目，计算，对于每个存储元件，可用容量取决于对存储系统内的冗余数据的放置的约束，对可用容量求和以形成存储系统的总可用容量; 以及将所述存储分配表中的表条目分配给每个识别所述存储元件之一，其中当用作所述存储系统的一部分时，每个所述存储元件的可用容量是其有效存储容量，其中并非全部所述D存储形成存储系统的元件具有相同的可用容量，并且其中标识存储元件之一的所有表条目的部分取决于其总可用容量的分数。

5. 发明申请

US20060026220A1 History preservation in a computer storage system 有权
标题翻译：历史保存在计算机存储系统中
公开(公告)号：US20060026220A1
公开(公告)日：2006-02-02
申请号：US11240829
申请日：2005-09-30
申请人： Norman Margolus
发明人： Norman Margolus
IPC分类号： G06F17/30
CPC分类号： G06F17/30368 , G06F17/30082 , G06F17/30085 , Y10S707/99931 , Y10S707/99936 , Y10S707/99937 , Y10S707/99939 , Y10S707/99942 , Y10S707/99952 , Y10S707/99953
摘要： A method for protecting history in a file system in which rules governing which versions of files must be retained, and for how long, are enforced by one or more storage systems attached to a network, the method comprising associating with a storage system a time standard configured to prevent the accuracy of the time standard from being manipulated over the network, storing file information in the storage system, with files stored as objects adapted for separate retrieval in any order, storing, in the storage system, directory information which is sufficient to allow files to be retrieved starting from file system pathnames, marking at least some versions of files as archival file versions not subject to further change, and assigning an expiration time to each of at least some of the archival file versions, preventing storage system clients from deleting archival file versions before their expiration times, and allowing individual archival file versions that have passed their expiration times to be deleted and their storage space reused, with the decision to delete a particular archival file version being capable of being made separately and independently from the decision to delete other archival file versions.
摘要翻译：一种用于保护文件系统中的历史的方法，其中必须保留关于哪个版本的文件的规则以及连接到网络的一个或多个存储系统执行多长时间的方法，所述方法包括将存储系统与时间标准被配置为防止时间标准的准确性在网络上被操纵，将文件信息存储在存储系统中，存储为适于以任何顺序单独检索的对象的文件，在存储系统中存储足够的目录信息允许从文件系统路径名开始检索文件，将文件的至少一些版本标记为不需要进一步更改的归档文件版本，并为至少一些归档文件版本分配过期时间，从而防止存储系统客户端删除档案文件版本的到期时间，并允许通过其到期的个人档案文件版本要删除的时间和它们的存储空间被重用，决定删除特定的档案文件版本，其能够单独制作，并且独立于删除其他档案文件版本的决定。

6. 发明申请

US20070245083A1 Erasure Coding Technique For Scalable And Fault Tolerant Storage System 有权
标题翻译：用于可扩展和容错存储系统的擦除编码技术
公开(公告)号：US20070245083A1
公开(公告)日：2007-10-18
申请号：US11696654
申请日：2007-04-04
申请人： Norman Margolus , Thomas Jaskiewicz
发明人： Norman Margolus , Thomas Jaskiewicz
IPC分类号： G06F12/16
CPC分类号： G06F11/2094 , G06F11/1096 , G06F11/1662 , G06F2211/1023 , G06F2211/1028 , G06F2211/1057
摘要： A method for encoding a block of data to allow it to be stored or transmitted correctly in the face of accidental or deliberate modifications, the method including constructing a number n greater than one of original components, each of which is derived from the block and each of which is smaller than the block, and combining original components to construct a number m greater than one of new components, wherein each of the new components is smaller than the sum of the sizes of the original components combined to produce it, wherein the block can be reconstructed from any set of n different components selected from the original components and new components, and wherein a set of n different components selected from the original components and new components contains more redundant information about the block than the set of n original components.
摘要翻译：一种用于对数据块进行编码以便在面对意外或故意修改时正确地存储或传输数据的方法，所述方法包括构建大于原始组件的数目n，每个原始组件中的每一个都从块导出，并且每个其小于块，并且组合原始组件以构造大于新组件的数量m，其中每个新组件小于组合以产生组件的原始组件的大小的总和，其中块可以从从原始组件和新组件中选择的任何一组n个不同组件重建，并且其中从原始组件和新组件中选择的一组n个不同组件包含关于块的更多冗余信息，而不是n个原始组件的集合。

7. 发明申请

US20060112112A1 Storage system for randomly named blocks of data 有权
标题翻译：随机命名的数据块的存储系统
公开(公告)号：US20060112112A1
公开(公告)日：2006-05-25
申请号：US11246897
申请日：2005-10-06
申请人： Norman Margolus , Edwin Olson , Michael Sclafani , J. Coburn , Michael Fortson
发明人： Norman Margolus , Edwin Olson , Michael Sclafani , J. Coburn , Michael Fortson
IPC分类号： G06F7/00
CPC分类号： G06F17/30955 , G06F17/30949 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： A method for constructing an index suitable for indexing a large set of records identified by long generally randomly distributed record names, and for answering membership queries about the set, the method comprising adding a new record to the set and assigning the new record a new record name using a process designed to produce names where at least a portion of each name is at least approximately random, determining that the new record name is not already represented in the index by checking a first level index, combining the new record name with record name information already represented in the index to form a combined record name which is shorter than the new record name, and adding the combined record name to the first level index to form a new first level index entry that represents the new record, wherein the first level index does not contain information sufficient to conclude that the new record name has been added to the index, wherein each different record in the set is assigned a different record name, wherein at least a portion of the first level index is ordered based on record names.
摘要翻译：一种用于构建索引的索引的方法，所述索引适用于对由长一般随机分布的记录名称所识别的大量记录进行索引，以及用于回答关于该集合的成员关系查询，所述方法包括向该集合添加新记录并向新记录分配新记录使用被设计为产生名称的过程的名称，其中每个名称的至少一部分至少近似为随机的，通过检查第一级索引，将新记录名称与记录名称组合来确定新记录名称尚未在索引中表示已经在所述索引中表示的信息以形成比所述新记录名称更短的组合记录名称，以及将所述组合记录名称添加到所述第一级索引以形成表示所述新记录的新的第一级索引条目，其中所述第一级别索引不包含足以得出结论，新记录名称已被添加到索引的信息，其中集合中的每个不同的记录是屁股点燃了不同的记录名称，其中基于记录名称对第一级索引的至少一部分进行排序。

8. 发明申请

US20050131961A1 Data repository and method for promoting network storage of data 有权
标题翻译：数据存储库和数据库网络存储方法
公开(公告)号：US20050131961A1
公开(公告)日：2005-06-16
申请号：US10967071
申请日：2004-10-14
申请人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
发明人： Norman Margolus , Thomas Knight , Jered Floyd , George Homsy
IPC分类号： G06F1/00 , G06F17/30
CPC分类号： G06F21/64 , G06F17/30097 , G06F21/10 , G06F21/60 , G06F21/62 , G06F21/6209 , G06F21/6272 , G06F21/645 , G06Q20/206 , Y10S707/959 , Y10S707/99932 , Y10S707/99953
摘要： A method for turning variable-length file path names into fixed-length object identifiers in a data repository, the method comprising, assigning a fixed-value identifier to a file system in the data repository, computing a first deterministic pseudo-random function that combines a first component of a plurality of file system pathname components associated with a file with the fixed-value identifier, computing a second determininstic pseudo-random function that combines a second component of the plurality of file system pathname components with the result of the first function, and using at least one of the computed deterministic pseudo-random functions to produce a fixed-length object identifier for the file.
摘要翻译：一种用于将可变长度文件路径名转换为数据存储库中的固定长度对象标识符的方法，所述方法包括：向所述数据存储库中的文件系统分配固定值标识符，计算组合的第一确定性伪随机函数与具有固定值标识符的文件相关联的多个文件系统路径名组件的第一组件，计算将多个文件系统路径名组件的第二组件与第一功能的结果组合的第二确定性伪随机函数并且使用所计算的确定性伪随机函数中的至少一个来产生文件的固定长度对象标识符。

9. 发明申请

US20060116990A1 Storage system for randomly named blocks of data 有权
标题翻译：随机命名的数据块的存储系统
公开(公告)号：US20060116990A1
公开(公告)日：2006-06-01
申请号：US11246004
申请日：2005-10-06
申请人： Norman Margolus , Edwin Olson , Michael Sclafani , J. Coburn , Michael Fortson
发明人： Norman Margolus , Edwin Olson , Michael Sclafani , J. Coburn , Michael Fortson
IPC分类号： G06F17/30
CPC分类号： G06F17/30955 , G06F17/30949 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： A method for constructing an index suitable for indexing a large set of records identified by long generally randomly distributed record names, and for answering membership queries about the set, the method comprising adding a new record to the set and assigning the new record a new record name using a process designed to produce names where at least a portion of each name is at least approximately random, determining that the new record name is not already represented in the index by checking a first level index that does not contain information sufficient to reconstruct the complete record names of records that have already been added to the index, abbreviating the new record name to form a new abbreviated name that is shorter than the new record name but that is sufficient to distinguish it from record names already represented in the index, combining the new abbreviated name with an abbreviated name of a record already represented in the first level index, to form a combined record name which is shorter than either of the abbreviated names that were combined, adding the combined record name to the first level index to form a new first level index entry that represents the new record, adding a new entry to a second level index that includes the complete new record name or enough information to reconstruct it, determining that a queried record name is already represented in the index by first determining that the queried record name is represented by the new first level index entry and then determining that the queried record name is represented by the new second level index entry, wherein each different record in the set is assigned a different record name, wherein each different record in the set has a different entry in the first level index, wherein at least a portion of the first level index is ordered based on abbreviated record names.
摘要翻译：一种用于构建索引的索引的方法，所述索引适用于对由长一般随机分布的记录名称所识别的大量记录进行索引，以及用于回答关于该集合的成员关系查询，所述方法包括向该集合添加新记录并向新记录分配新记录使用被设计为产生名称的过程的名称，其中每个名称的至少一部分至少近似为随机的，通过检查不包含足够重建信息的信息的第一级索引来确定新记录名称尚未在索引中表示已经添加到索引的记录的完整记录名称，缩写新记录名称以形成比新记录名短的新缩写名称，但足以将其与索引中已经表示的记录名称区分开来，组合具有在第一级索引中已经表示的记录的缩写名称的新缩写名称，以形成组合记录名称比组合的缩写名称短，将组合的记录名称添加到第一级索引以形成表示新记录的新的第一级索引条目，将新条目添加到包括第二级索引的第二级索引完成新的记录名称或足够的信息来重建它，通过首先确定所查询的记录名称由新的第一级索引条目表示，然后确定所查询的记录名称被表示，确定已经在索引中表示查询的记录名称通过新的第二级索引条目，其中集合中的每个不同记录被分配不同的记录名称，其中集合中的每个不同记录在第一级索引中具有不同的条目，其中第一级索引的至少一部分是根据缩写记录命名。

10. 发明授权

US5691885A Three-dimensional interconnect having modules with vertical top and bottom connectors 失效
标题翻译：具有垂直顶部和底部连接器的模块的三维互连
公开(公告)号：US5691885A
公开(公告)日：1997-11-25
申请号：US323382
申请日：1994-10-14
申请人： Stephen A. Ward , Gill A. Pratt , John N. Nguyen , John S. Pezaris , Norman Margolus
发明人： Stephen A. Ward , Gill A. Pratt , John N. Nguyen , John S. Pezaris , Norman Margolus
IPC分类号： A63F9/12 , A63F9/24 , G06F15/80 , H01R12/50 , H05K1/14 , H05K7/02 , H05K7/10 , H01R29/00 , H05K5/00
CPC分类号： G06F15/803 , H01R23/68 , H05K1/14 , H05K7/023 , A63F9/12
摘要： Circuit supporting modules form a three-dimensional communication interconnect mesh. A first embodiment three-dimensional communication interconnect is a tetrahedral lattice having a regular, isotropic, three-dimensional topology in which each module connects to its four physically closest neighbors. The structure of the tetrahedral interconnect is isomorphic with a diamond lattice structure. In a second embodiment the interconnect is hexahedral. A characteristic of both is embodiments is that, although connections are made to plural other modules, the physical connections are made along the same direction.
摘要翻译：电路支持模块形成三维通信互连网格。第一实施例三维通信互连是具有规则，各向同性的三维拓扑的四面体网格，其中每个模块连接到其四个最接近的邻居。四面体互连的结构与金刚石晶格结构是同构的。在第二实施例中，互连是六面体的。两者的特征是实施例是尽管连接到多个其他模块，但是物理连接沿着相同的方向进行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式