International business machines corporation (20240119091). STORING GRAPH DATA IN A KEY-VALUE STORE simplified abstract
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 20240119091 titled 'STORING GRAPH DATA IN A KEY-VALUE STORE
Simplified Explanation
The present invention provides a method, computer system, and computer program product for storing a graph using a key-value store. Storing a specific node of the graph involves storing identifiers of the node and its k-hop neighborhood as keys, and attribute values of the node as the corresponding values.
- Key-value store used for storing a graph
- Storing specific nodes by storing identifiers and k-hop neighborhood as keys, and attribute values as values
Potential Applications
This technology can be applied in various fields such as social networks, recommendation systems, and network analysis.
Problems Solved
Efficient storage and retrieval of graph data, especially in large-scale applications.
Benefits
Improved performance in handling graph data, scalability, and flexibility in managing graph structures.
Potential Commercial Applications
"Graph Storage Optimization for Big Data Applications"
Possible Prior Art
There are existing methods for storing and querying graph data, but the specific approach of using a key-value store with k-hop neighborhood information may be novel.
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 with traditional graph databases in terms of performance and scalability. It would be interesting to see a benchmark study or case studies showcasing the advantages of this technology over traditional approaches.
What are the potential challenges or limitations of using a key-value store for storing graph data?
The article does not address potential challenges or limitations of using a key-value store for storing graph data. It would be beneficial to discuss any drawbacks or constraints that may arise when implementing this technology in real-world 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.
