公开(公告)号：US20180006898A1

公开(公告)日：2018-01-04

申请号：US15198575

申请日：2016-06-30

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Yaron Kanza ,  Theodore Johnson ,  Vladislav Shkapenyuk ,  Laks V.S. Lakshmanan

IPC: H04L12/24 ,  G06F17/30

CPC classification number: H04L41/145 ,  G06F16/9024 ,  H04L41/142 ,  H04W24/04

Abstract: A system may include a processor, an input, and memory comprising a graph database and executable instructions. The executable instructions may cause the processor to effectuate operations. The operations may include receiving, via the input, a query comprising pathway variables. The operations may also include determining an anchor set based on at least one of the pathway variables and identifying an evaluation order based on the anchor set. The operations may also include translating the pathway variables into a pathway algebraic expression based on the evaluation order. The operations may include executing the pathway algebraic expression on the graph database to return a pathway set.

公开(公告)号：US20180006897A1

公开(公告)日：2018-01-04

申请号：US15198448

申请日：2016-06-30

Applicant: AT&T Intellectual Property I, L.P.

Inventor： Yaron Kanza ,  Theodore Johnson ,  Vladislav Shkapenyuk ,  Laks V.S. Lakshmanan

IPC: H04L12/24 ,  G06F17/30

CPC classification number: H04L41/145 ,  G06F16/2455 ,  G06F16/9024 ,  H04L41/142 ,  H04W24/04

Abstract: A system may include a processor and an input adapted to communicate with a network. The system may also include memory storing instructions that cause the processor to effectuate operations. The operations may include detecting a plurality of nodes in the network based on data received at the input and for each of a plurality of nodes, instantiating a node data structure. The operations may also include, for each respective node of the plurality of nodes, identifying an edge indicative of a connection between the respective node and a second node of the plurality of nodes, and instantiating a plurality of edge data structures based on the edges. The operations may also include creating a graph database comprising a layered graph based on data structures, the data structures comprising the plurality of node data structures and the plurality of edge data structures.