17938481. STORING GRAPH DATA IN A KEY-VALUE STORE simplified abstract (International Business Machines Corporation)
Contents
- 1 STORING GRAPH DATA IN A KEY-VALUE STORE
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 STORING GRAPH DATA IN A KEY-VALUE STORE - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
STORING GRAPH DATA IN A KEY-VALUE STORE
Organization Name
International Business Machines Corporation
Inventor(s)
Alexander Merschel of Stuttgart (DE)
Dennis Butterstein of Stuttgart (DE)
Martin Anton Oberhofer of Sindelfingen (DE)
Thomas Schwarz of Stuttgart (DE)
[[:Category:Tobias Kevin Fr�nzel of Tuebingen (DE)|Tobias Kevin Fr�nzel of Tuebingen (DE)]][[Category:Tobias Kevin Fr�nzel of Tuebingen (DE)]]
STORING GRAPH DATA IN A KEY-VALUE STORE - A simplified explanation of the abstract
This abstract first appeared for US patent application 17938481 titled 'STORING GRAPH DATA IN A KEY-VALUE STORE
Simplified Explanation
The abstract describes a method, computer system, and computer program product for storing a graph in a key-value store. The specific node of the graph and its k-hop neighborhood are stored as keys, with the attribute values of the specific node as the corresponding values.
- Key-value store used for storing a graph
- Storing specific nodes and their k-hop neighborhoods
- Attribute values of specific nodes stored as values
Potential Applications
This technology could be applied in various fields such as social networks, transportation systems, and telecommunications for efficient storage and retrieval of graph data.
Problems Solved
This technology solves the problem of efficiently storing and accessing graph data, especially in large-scale applications where traditional methods may be inefficient.
Benefits
The key-value store approach offers a scalable and flexible solution for storing graph data, allowing for quick retrieval and manipulation of information.
Potential Commercial Applications
"Efficient Graph Storage in Key-Value Stores" - Optimizing graph data storage for businesses
Possible Prior Art
One possible prior art could be the use of graph databases for storing and querying graph data, but the specific method of utilizing a key-value store for this purpose may be a novel approach.
Unanswered Questions
How does this technology compare to traditional graph databases in terms of performance and scalability?
This article does not provide a direct comparison between this technology and traditional graph databases in terms of performance and scalability. Further research or experimentation may be needed to determine the advantages and limitations of each approach.
What are the potential security implications of storing graph data in a key-value store?
The article does not address the potential security implications of storing graph data in a key-value store. It would be important to consider data privacy and access control measures when implementing this technology in sensitive applications.
Original Abstract Submitted
A method, computer system, and a computer program product for storing a graph is provided. The present invention may include providing a key-value store. The present invention may include storing a graph in the key-value store, wherein storing a specific node of the graph in the key-value store comprises: storing, as a key, identifiers of the specific node and of k-hop neighborhood of the specific node, and as value of the key, attribute values of the specific node, wherein the k-hop neighborhood of the specific node comprises a set of neighboring nodes that are reachable from the specific node within k edges.
