Abstract: Computer-implemented methods and systems for automatic ring discovery and configuration are provided. An exemplary method may comprise connecting a data node to a network. When connected, the data node periodically sends an advertisement to the network and monitors the network for one or more further advertisements of further data nodes associated with one or more data rings. The monitoring is performed for a predetermined time period. If one or more further advertisements are received, the data node determines which data ring to join using predefined criteria. The predetermined criteria may include a number of data nodes in the data ring, free space in the data ring, allowable number of the data nodes, compatibility of software versions of the data node and the data ring. Alternatively, if no advertisements are received within the predetermined time period, the data node creates a new data ring.

Abstract: A method for bursting a hash table of a key-value database comprises receiving a key and a value, traversing trie nodes of the key-value database from a root node to a leaf node by recursively dividing the key into a prefix and a suffix, reaching the leaf node, the leaf node being the hash table, determining that the key is not stored in the hash table, determining that the hash table is not able to store the key and the value, removing the hash table, associating a new trie node with a parent trie node of the hash table, associating two or more new hash tables with the new trie node, moving all keys and associated values from the hash table into one of the two or more new hash tables, and inserting the key and the associated value into one of the two or more new hash tables.

Abstract: A method for bursting a hash table of a key-value database comprises receiving a key and a value, traversing trie nodes of the key-value database from a root node to a leaf node by recursively dividing the key into a prefix and a suffix, reaching the leaf node, the leaf node being the hash table, determining that the key is not stored in the hash table, determining that the hash table is not able to store the key and the value, removing the hash table, associating a new trie node with a parent trie node of the hash table, associating two or more new hash tables with the new trie node, moving all keys and associated values from the hash table into one of the two or more new hash tables, and inserting the key and the associated value into one of the two or more new hash tables.

Abstract: Computer-implemented methods and systems for managing data objects within a computer network infrastructure that facilitate more efficient and reliable data storage and access are provided. An exemplary method may comprise establishing a physical identifier for each storage resource. A plurality of unique virtual identifiers for each storage resource is generated based on the physical identifier. The plurality of unique virtual identifiers is stored in a consistent ring namespace accessible to every node. An object identifier associated with a location of a data object to be stored in a storage resource is generated. The object identifier is mapped to the consistent ring namespace. The method may also include enabling traversing the consistent ring namespace from any node in the computer network to locate and access the data object.