公开(公告)号：US20100054481A1

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

申请号：US12548975

申请日：2009-08-27

Applicant: Sushil Jajodia ,  Witold Litwin ,  Thomas Schwarz

Inventor： Sushil Jajodia ,  Witold Litwin ,  Thomas Schwarz

IPC: H04L9/08 ,  G06F12/08

CPC classification number: H04L9/085 ,  H04L9/0897

Abstract: Embodiments of the present invention store application data and associated encryption key(s) on at least k+1 remote servers using LH* addressing. At least k+1 buckets are created on separate remote servers. At least k+1 key shares are generated for each of at least one encryption key. Each encryption key has a unique key number. Each key share is stored in a different key share record. Each of the key share records is stored in a different bucket using LH* addressing. Encrypted application data is generated by encrypting the application data with the encryption key(s). The encrypted application data is stored in encrypted data record(s). Each of the encrypted data records is stored in a different bucket among the buckets using LH* addressing.

Abstract translation: 本发明的实施例使用LH *寻址在至少k + 1个远程服务器上存储应用数据和相关联的加密密钥。 在单独的远程服务器上至少创建k + 1个桶。 为至少一个加密密钥中的每一个产生至少k + 1个密钥份额。 每个加密密钥都有唯一的密钥号码。 每个密钥共享存储在不同的密钥共享记录中。 每个密钥共享记录使用LH *寻址存储在不同的存储桶中。 通过使用加密密钥加密应用数据来生成加密的应用数据。 加密的应用数据被存储在加密的数据记录中。 使用LH *寻址将每个加密的数据记录存储在桶中的不同桶中。

公开(公告)号：US06173415B2

公开(公告)日：2001-01-09

申请号：US09083828

申请日：1998-05-22

Applicant: Witold Litwin ,  Jaishankar Moothedath Menon ,  Tore Johan Martin Risch

Inventor： Witold Litwin ,  Jaishankar Moothedath Menon ,  Tore Johan Martin Risch

IPC: G06F1110

CPC classification number: G06F11/1076 ,  G06F2211/1028

Abstract: Disclosed is a system for generating parity information for a data file in a distributed data structure system. Data objects in the data file are distributed into data buckets located in memory areas in servers interconnected by a network. An nth set of bucket group numbers are generated. A data bucket and a parity bucket are associated with a bucket group number in the nth set. Parity data for the data objects is generated and stored in a parity bucket associated with a bucket group number in the nth set. After adding a data object to the data file an additional data bucket may be provided for additional data object storage space. After adding a data bucket, a determination is made as to whether bucket availability has decreased below a predetermined threshold. If so, an (n+1)th set of bucket group numbers is generated and parity data for at least one of the data objects is stored in a parity bucket associated with a bucket group number in the (n+1)th set. A bucket group number in the (n+1)th set is associated with a data bucket and a parity bucket.

Abstract translation: 公开了一种用于在分布式数据结构系统中为数据文件生成奇偶校验信息的系统。 数据文件中的数据对象被分配到位于由网络互连的服务器的存储器区域中的数据仓库中。 生成第n组桶组编号。 数据桶和奇偶校验桶与第n组中的组组号相关联。 产生数据对象的奇偶校验数据并将其存储在与第n组中的桶组号相关联的奇偶校验桶中。 在将数据对象添加到数据文件之后，可以为附加的数据对象存储空间提供附加的数据桶。 在添加数据桶之后，确定桶可用性是否降低到预定阈值以下。 如果是，则产生第（n + 1）组桶组编号，并且将用于至少一个数据对象的奇偶校验数据存储在与第（n + 1）组中的桶组编号相关联的奇偶校验桶中。 第（n + 1）组中的桶组号与数据桶和奇偶校验桶相关联。

公开(公告)号：US6122754A

公开(公告)日：2000-09-19

申请号：US83599

申请日：1998-05-22

Applicant: Witold Litwin ,  Jaishankar Moothedath Menon ,  Tore Johan Martin Risch

Inventor： Witold Litwin ,  Jaishankar Moothedath Menon ,  Tore Johan Martin Risch

IPC: G06F11/10 ,  G06F11/16

CPC classification number: G06F11/1076 ,  G06F2211/1028

Abstract: Disclosed is a system for recovering data objects stored in a data bucket in a computer system comprised of servers interconnected by a network. Each server includes a storage area. Data buckets are included in a plurality of the storage areas throughout the network. A failure of a data bucket and nth bucket group number associated with the failed data bucket are determined, wherein n is an integer value greater than zero. Parity data in a parity bucket associated with the nth bucket group number is then located. The data objects in the failed data bucket are then recovered from the parity data in the located parity bucket. After determining that the recovery of data objects using the parity data in the parity bucket associated with the nth bucket group number was unsuccessful, for each n' not equal to n and while the data objects have not been recovered and all n' have not been considered, performing the steps of: determining an n'th bucket group number associated with the failed data bucket; locating parity data in a parity bucket associated with the n'th bucket group number; and recovering the data objects in the failed data bucket from the parity data in the located parity bucket associated with the n'th bucket group number. Recovery can also be made of the parity data using the data objects.

Abstract translation: 公开了一种用于恢复存储在包括由网络互连的服务器的计算机系统中的数据桶中的数据对象的系统。 每个服务器包括一个存储区域。 数据桶包括在整个网络中的多个存储区域中。 确定与故障数据桶相关联的数据桶和第n个桶组编号的故障，其中n是大于零的整数值。 然后找到与第n个桶组号相关联的奇偶校验桶中的奇偶校验数据。 然后，故障数据桶中的数据对象将从位于奇偶校验位的奇偶校验数据中恢复。 在确定使用与第n个桶组号相关联的奇偶校验桶中的奇偶校验数据的数据对象的恢复不成功时，对于每个n'不等于n，并且数据对象尚未恢复并且全部n'尚未被恢复 考虑到，执行以下步骤：确定与故障数据桶相关联的第n个桶组号; 将奇偶校验数据定位在与第n个桶组号相关联的奇偶校验桶中; 并且从与第n个桶组号相关联的所位于的奇偶校验桶中的奇偶校验数据中恢复出现故障的数据桶中的数据对象。 也可以使用数据对象来恢复奇偶校验数据。

公开(公告)号：US5542087A

公开(公告)日：1996-07-30

申请号：US137871

申请日：1993-10-15

Applicant: Marie-Anne Neimat ,  Donovan Schnelder ,  Witold Litwin

Inventor： Marie-Anne Neimat ,  Donovan Schnelder ,  Witold Litwin

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30949

Abstract: A data processing method and apparatus, which generate a correct memory address from a character or digit string such as a record key value, and which is adapted for use in distributed or parallel processing architectures such as computer networks, multiprocessing systems, and the like. The invention provides a plurality of client data processors and a plurality of file servers, each server including at least a respective one memory location or "bucket". The method of the invention includes the following steps: generating the key value by means of any one of the client data processors; generating a first memory address from the key value, the first address identifying a first memory location; selecting from the plurality of servers a server that includes the first memory location; transmitting the key value from the one client to the server that includes the first memory location; and determining whether the first address is the correct address by means of the server. The method of the invention further provides that if the first address is not the correct address then the following steps are performed: generating a second memory address from the key value by means of the server, the second address identifying a second memory location; selecting from the plurality of servers another server, which includes the second memory location; transmitting the key value from the server that includes the first memory location to the other server, which includes the second memory location; determining whether the second address is the correct address by means of the other server; and generating a third memory address, which is the correct address, if neither the first or second addresses is the correct address. The present invention provides fast storage and subsequent searching and retrieval of data records in data processing applications such as database applications.

Abstract translation: 一种数据处理方法和装置，其从诸如记录密钥值的字符或数字串生成正确的存储器地址，并且适用于分布式或并行处理架构，例如计算机网络，多处理系统等。 本发明提供了多个客户端数据处理器和多个文件服务器，每个服务器至少包括相应的一个存储器位置或“桶”。 本发明的方法包括以下步骤：通过任何一个客户端数据处理器产生密钥值; 从所述键值生成第一存储器地址，所述第一地址识别第一存储器位置; 从所述多个服务器中选择包括所述第一存储器位置的服务器; 将所述密钥值从所述一个客户端发送到包括所述第一存储器位置的所述服务器; 以及通过所述服务器确定所述第一地址是否是正确的地址。 本发明的方法还提供了如果第一地址不是正确的地址，则执行以下步骤：通过服务器从密钥值生成第二存储器地址，第二地址标识第二存储器位置; 从所述多个服务器中选择包括所述第二存储器位置的另一个服务器; 将包括所述第一存储器位置的所述服务器的所述密钥值发送到包括所述第二存储器位置的所述其他服务器; 通过其他服务器确定第二个地址是否是正确的地址; 并且如果第一或第二地址都不是正确的地址，则生成第三存储器地址，其是正确的地址。 本发明提供了诸如数据库应用的数据处理应用中的数据记录的快速存储和随后的搜索和检索。