View source for 18456955. METHODS AND SYSTEM FOR IMPORTING DATA TO A GRAPH DATABASE USING NEAR-STORAGE PROCESSING simplified abstract (Samsung Electronics Co., Ltd.)

=METHODS AND SYSTEM FOR IMPORTING DATA TO A GRAPH DATABASE USING NEAR-STORAGE PROCESSING=


==Organization Name==

[[:Category:Samsung Electronics Co., Ltd.|Samsung Electronics Co., Ltd.]]


[[Category:Samsung Electronics Co., Ltd.]]

==Inventor(s)==

[[:Category:Seongyoung Kang of Irvine CA (US)|Seongyoung Kang of Irvine CA (US)]][[Category:Seongyoung Kang of Irvine CA (US)]]

[[:Category:Mohammadreza Soltaniyeh of Sunnyvale CA (US)|Mohammadreza Soltaniyeh of Sunnyvale CA (US)]][[Category:Mohammadreza Soltaniyeh of Sunnyvale CA (US)]]

[[:Category:Xuebin Yao of Mountain View CA (US)|Xuebin Yao of Mountain View CA (US)]][[Category:Xuebin Yao of Mountain View CA (US)]]

==METHODS AND SYSTEM FOR IMPORTING DATA TO A GRAPH DATABASE USING NEAR-STORAGE PROCESSING - A simplified explanation of the abstract==


This abstract first appeared for US patent application 18456955 titled 'METHODS AND SYSTEM FOR IMPORTING DATA TO A GRAPH DATABASE USING NEAR-STORAGE PROCESSING

==Simplified Explanation==

The abstract describes methods and memory devices for converting graph input data into a graph database using parsers and a merge sorter.

* Parsers in a memory device convert graph input data into an edge list and a vertex list.
* A merge sorter in the memory device sorts the vertex list to generate a sequential list of vertices.
* The edge list is converted into a translated list of edges using identifiers of the sequential list of vertices.
* The merge sorter then sorts the translated list of edges to generate a sequential list of edges.
* The graph database is created using the sequential list of edges.

== Potential Applications ==
* Data analysis
* Network optimization
* Social network analysis

== Problems Solved ==
* Efficiently converting graph input data into a graph database
* Sorting and organizing large amounts of data
* Creating a sequential list of vertices and edges

== Benefits ==
* Improved data organization
* Faster data processing
* Enhanced graph database generation


==Original Abstract Submitted==

Methods and memory devices are provided in which at least one parser of a memory device converts graph input data into an edge list and a vertex list for a graph database. A merge sorter of the memory device sorts the vertex list to generate a sequential list of vertices. The edge list is converted into a translated list of edges using identifiers (IDs) of the sequential list of vertices. The merge sorter sorts the translated list of edges to generate a sequential list of edges. The graph database is generated using the sequential list of edges.



[[Category:G06F16/901]]