Distributed graph databases that facilitate streaming data insertion and queries by efficient throughput edge addition
First Claim
Patent Images
1. A computer-implemented method for efficient throughput edge addition, comprising:
- determining, by a device operatively coupled to a processor, vertex placement, based on a hash or an arbitrary placement function;
placing, by the device, outgoing edge requests into appropriate queues of a firehose; and
placing, by the device, incoming edge requests into appropriate queues of the firehose, wherein for each queue, in parallel, the device;
sends requests to add vertices for all sources in an outgoing edges set, and all targets in an incoming edges set, and wait for vertex ids of all added vertices and MAXEID from each machine, respectively.
1 Assignment
0 Petitions
Accused Products
Abstract
A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.
31 Citations
20 Claims
-
1. A computer-implemented method for efficient throughput edge addition, comprising:
-
determining, by a device operatively coupled to a processor, vertex placement, based on a hash or an arbitrary placement function; placing, by the device, outgoing edge requests into appropriate queues of a firehose; and placing, by the device, incoming edge requests into appropriate queues of the firehose, wherein for each queue, in parallel, the device; sends requests to add vertices for all sources in an outgoing edges set, and all targets in an incoming edges set, and wait for vertex ids of all added vertices and MAXEID from each machine, respectively. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system, comprising:
-
a memory that stores computer executable components; and a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise; a graph database component that; determines vertex placement, based on a hash or an arbitrary placement function; places outgoing edge requests into appropriate queues of a firehose; and places incoming edge requests into appropriate queues of the firehose, wherein for each queue, in parallel, sends requests to add vertices for all sources in an outgoing edges set, and all targets in an incoming edges set, and waits for vertex ids of all added vertices and MAXEID from each machine, respectively. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A computer program product for efficient throughput edge addition, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing component to cause the processing component to:
-
determine vertex placement, based on a hash or an arbitrary placement function; place outgoing edge requests into appropriate queues of a firehose; and place incoming edge requests into appropriate queues of the firehose, wherein for each queue, in parallel, the processing component is caused to; send requests to add vertices for all sources in an outgoing edges set, and all targets in an incoming edges set, and wait for vertex ids of all added vertices and MAXEID from each machine, respectively. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification