US 11,874,875 B2
Graph processing system
Ryan Wright, Portland, OR (US)
Assigned to thatDot, Inc., Portland, OR (US)
Filed by THATDOT, INC., Portland, OR (US)
Filed on Mar. 11, 2022, as Appl. No. 17/693,213.
Application 17/693,213 is a continuation of application No. 16/510,746, filed on Jul. 12, 2019, granted, now 11,321,394.
Claims priority of provisional application 62/865,882, filed on Jun. 24, 2019.
Prior Publication US 2022/0269730 A1, Aug. 25, 2022
Int. Cl. G06F 16/901 (2019.01); G06F 16/903 (2019.01)
CPC G06F 16/9024 (2019.01) [G06F 16/90335 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system, comprising:
a computing device comprising at least one processor and at least one memory, the at least one memory comprising instructions that, in response to execution by the at least one processor, cause the computing device to at least:
receive at least one message indicative of storing data in a graph to comprise a first node linked to a second node by a first half-edge stored in association with the first node and a second half-edge stored in association with the second node;
in response to determining that no message processor is assigned to the first node, assign a message processor to the first node, wherein the message processor processes messages directed to the first node in a defined order;
store, based at least in part on the at least one message, a first record indicative of the first node, the first record comprising information indicative of a property of the first node and information indicative of the first half-edge;
store, based at least in part on the at least one message, in a second record indicative of the second node, information indicative of the second half-edge; and
process a query of the graph by at least identifying a pattern in the graph comprising at least the first node and the second node.