公开(公告)号：US10180992B2

公开(公告)日：2019-01-15

申请号：US15058032

申请日：2016-03-01

申请人： LinkedIn Corporation

发明人： SungJu Cho ,  Jiahong Zhu ,  Yinyi Wang ,  Roman A. Averbukh ,  Scott M. Meyer ,  Shyam Shankar ,  Qingpeng Niu ,  Karan R. Parikh

IPC分类号： G06F17/30

摘要： The disclosed embodiments provide a system for updating an index structure of a graph database storing a graph. During operation, the system includes, in the index structure, a first compressed edge store containing a first compact representation of edges in the graph at a first virtual time and a first series of updates to the edges after the first virtual time. At a second virtual time, the system creates a second compact representation of the edges from the first compact representation and the first series of updates. The system then appends, to the second compact representation, a second series of updates to the edges after the second virtual time to produce a second compressed edge store. Finally, the system updates the index structure by atomically replacing, in the index structure, a reference to the first compressed edge store with a reference to the second compressed edge store.

公开(公告)号：US20170255709A1

公开(公告)日：2017-09-07

申请号：US15058032

申请日：2016-03-01

申请人： LinkedIn Corporation

发明人： SungJu Cho ,  Jiahong Zhu ,  Yinyi Wang ,  Roman A. Averbukh ,  Scott M. Meyer ,  Shyam Shankar ,  Qingpeng Niu ,  Karan R. Parikh

IPC分类号： G06F17/30

CPC分类号： G06F17/30949 ,  G06F17/3033 ,  G06F17/30336 ,  G06F17/30587 ,  G06F17/30958

摘要： The disclosed embodiments provide a system for updating an index structure of a graph database storing a graph. During operation, the system includes, in the index structure, a first compressed edge store containing a first compact representation of edges in the graph at a first virtual time and a first series of updates to the edges after the first virtual time. At a second virtual time, the system creates a second compact representation of the edges from the first compact representation and the first series of updates. The system then appends, to the second compact representation, a second series of updates to the edges after the second virtual time to produce a second compressed edge store. Finally, the system updates the index structure by atomically replacing, in the index structure, a reference to the first compressed edge store with a reference to the second compressed edge store.

公开(公告)号：US20170212930A1

公开(公告)日：2017-07-27

申请号：US15003520

申请日：2016-01-21

申请人： LINKEDIN CORPORATION

发明人： Andrew J. Carter ,  Yongling Song ,  Joshua D. Ehrlich ,  Roman A. Averbukh ,  Scott M. Meyer ,  Jiahong Zhu

IPC分类号： G06F17/30

CPC分类号： G06F16/9024

摘要： The disclosed embodiments provide a system for processing data. During operation, the system launches a set of child processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system transmits the query to one or more of the child processes. Next, the system receives a result of the query from the one or more child processes. The system then provides the result in a response to the query.

公开(公告)号：US20170255708A1

公开(公告)日：2017-09-07

申请号：US15058028

申请日：2016-03-01

申请人： LinkedIn Corporation

发明人： SungJu Cho ,  Jiahong Zhu ,  Yinyi Wang ,  Roman A. Averbukh ,  Scott M. Meyer ,  Shyam Shankar ,  Qingpeng Niu ,  Karan R. Parikh

IPC分类号： G06F17/30

CPC分类号： G06F16/22 ,  G06F16/2228

摘要： The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes a set of processes for accessing a lock-free hash table stored in memory on a computer system, wherein the processes include a write process and multiple read processes. Next, the system uses the processes and the lock-free hash table to index a graph database storing a graph. The system then uses the processes to access a compressed edge store containing a compact representation of the set of edges at a virtual time in the graph and a series of updates to the edges after the virtual time. During use of the processes and the lock-free hash table to index the graph database, the system references the set of edges in the compact representation from a set of entries in the lock-free hash table.