Distributed database for one search key
First Claim
Patent Images
1. A distributed database using multiple network nodes and a search key referring user data, characterised in that the search key is used as an argument for a hash function to generate a pseudo-random key for pointing to an individualised node for storing the data in the network.
2 Assignments
0 Petitions
Accused Products
Abstract
Method and arrangement for storing information in data network into a network element in accordance with a hash value of the search key; and a method adding a new element using overlapping hash values for the primary and secondary element to keep the service available during the element adding process and in case of hardware failure.
-
Citations
10 Claims
- 1. A distributed database using multiple network nodes and a search key referring user data, characterised in that the search key is used as an argument for a hash function to generate a pseudo-random key for pointing to an individualised node for storing the data in the network.
-
8. A method for storing and accessing information in a multi-computer environment, characterised in the steps of calculating the hash function of the search key for the information;
- determining the node with the hash function value of the search key;
determining a secondary node from the said hash function value for determining a secondary node for backup;
storing the information in the servers in the primary and secondary node;
accessing the information by calculating the hash value of the search key and accessing the node with the hash value or with the secondary hash value. - View Dependent Claims (9, 10)
- determining the node with the hash function value of the search key;
Specification