Consistent Ring Namespace for Efficient Data Object Location
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage and retrieval methods in computing networks are inefficient, requiring multiple lookups and being time-consuming, especially in large networks, due to the lack of a straightforward way to traverse data object locations across networked nodes.
Innovation Solution
Implementing a consistent ring namespace that uses unique virtual identifiers generated through consistent hashing, allowing any node to locate and access data objects by mapping object identifiers to a shared namespace, and redistributing identifiers when nodes or storage resources change.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If hierarchical namespaces or relational tables are used for data storage, then data organization is structured, but data retrieval requires multiple lookups and is time-consuming
Solution Approach 1:
The patent segments the namespace into a hierarchical structure where each node maintains a local namespace mapping. This allows data retrieval to be divided into multiple independent lookup operations across different nodes, parallelizing the search process and reducing overall retrieval time compared to sequential lookups in traditional hierarchical namespaces.
Solution Approach 2:
The patent introduces namespace mapping tables as intermediary structures that cache and redirect namespace references. These mapping tables act as mediators between the global namespace and local storage, enabling faster resolution of data locations without requiring full traversals of the hierarchical structure, thus reducing lookup time.
2Ease of operation
If a flat namespace with unique identifiers is used, then data retrieval is simple via identifier computation, but traversing data object locations across networked nodes is ineffective
Solution Approach 1:
The patent segments the flat namespace by introducing hierarchical namespace mapping at each node. Instead of a single global flat namespace, the system divides namespace management into node-specific segments with local mapping tables, enabling parallel traversal and improving access speed across distributed nodes.
Solution Approach 2:
The patent adds a hierarchical dimension to the flat namespace structure by introducing namespace mapping tables that organize data locations in multiple levels. This dimensional transformation allows the system to leverage both the simplicity of flat namespaces and the efficiency of hierarchical organization for traversing data object locations.
3Reliability
If data objects are distributed among multiple nodes, then storage capacity and availability increase, but locating data objects requires two actions (node lookup and object lookup)
Solution Approach 1:
The patent merges the node lookup and object lookup operations by integrating namespace mapping information directly at each node. The namespace mapping tables combine location metadata with object identifiers, allowing a single lookup operation to resolve both the target node and the object within it, thereby reducing the two-action process to one action while maintaining distributed storage benefits.
Solution Approach 2:
The namespace mapping table serves as an intermediary that pre-computes and stores the relationship between object identifiers and their physical locations. This intermediary structure eliminates the need for separate node and object lookups by providing direct mapping information, reducing operational complexity while preserving data distribution for reliability.
4Stability of the object's composition
If consistent hashing is used to generate virtual identifiers, then namespace consistency is maintained during node changes, but computational overhead increases
Solution Approach 1:
The patent applies preliminary action by pre-computing and caching namespace mapping tables during idle periods or during controlled updates. This allows the system to maintain namespace consistency through consistent hashing while reducing real-time computational overhead, as the heavy hashing and mapping operations are performed in advance rather than during data access operations.
Data Source
AI summary
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.