公开(公告)号：US20150100605A1

公开(公告)日：2015-04-09

申请号：US14186312

申请日：2014-02-21

Applicant: GOOGLE INC.

Inventor： Keith Golden ,  Amit Behal ,  Ben Hutchinson ,  Alexander Oliver Marks ,  Faen Zhang ,  Jason K. Macnak

IPC: G06F17/30

CPC classification number: G06F16/9024

Abstract: An efficient system for evaluating collection membership in a large data graph. The system includes a data graph of nodes connected by edges and an index of constraints from collection definitions, a definition specifying at least one condition with at least one constraint, where a constraint has a constraint type and a constraint expression. Multiple conditions in the definition may be conjunctive. The system may also include instructions that, when executed by the at least one processor, cause the system to: evaluate an edge for a node in the data graph against the index to determine conditions met by the edge and its associated neighborhood, repeat the evaluating for each edge associated with the node in the data graph, determine that conditions for a first collection are met, and generate an indication in the data graph that the node is a member of the first collection.

Abstract translation: 一种用于评估大型数据图表中的收集成员资格的高效系统。 该系统包括通过边缘连接的节点和来自集合定义的约束索引的数据图，指定具有至少一个约束的至少一个条件的定义，其中约束具有约束类型和约束表达式。 定义中的多个条件可能是连接的。 该系统还可以包括指令，当由至少一个处理器执行时，系统使得：根据该索引来评估数据图中的节点的边缘，以确定边缘及其相关邻域满足的条件，重复评估 对于与数据图中的节点相关联的每个边缘，确定满足第一集合的条件，并且在数据图中生成节点是第一集合的成员的指示。