公开(公告)号：US10754853B2

公开(公告)日：2020-08-25

申请号：US14933697

申请日：2015-11-05

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F16/2453 ,  G06F16/22 ,  G06F16/23 ,  G06F16/901 ,  G06F16/28

摘要： At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

公开(公告)号：US11423085B2

公开(公告)日：2022-08-23

申请号：US16786244

申请日：2020-02-10

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F16/00 ,  G06F16/901

摘要： In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

公开(公告)号：US20200242167A1

公开(公告)日：2020-07-30

申请号：US16786244

申请日：2020-02-10

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F16/901

摘要： In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

公开(公告)号：US20180081937A1

公开(公告)日：2018-03-22

申请号：US14933697

申请日：2015-11-05

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F17/30

摘要： At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

公开(公告)号：US10698955B1

公开(公告)日：2020-06-30

申请号：US15214313

申请日：2016-07-19

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F17/00 ,  G06F16/901 ,  G06F16/903

摘要： In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. One or more abstract paths between one or more vertices of the graph database are identified. Each abstract path is weighted based on a likelihood of a database query following the abstract path. The vertices of the graph database are assigned to the nodes according to the abstract paths between the vertices.

公开(公告)号：US10606892B1

公开(公告)日：2020-03-31

申请号：US15214312

申请日：2016-07-19

申请人： DataStax, Inc.

发明人： Matthias Broecheler

IPC分类号： G06F17/30 ,  G06F16/901

摘要： In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.