Using a graph database to match entities by evaluating boolean expressions
    1.
    发明授权
    Using a graph database to match entities by evaluating boolean expressions 有权
    使用图形数据库通过评估布尔表达式来匹配实体

    公开(公告)号:US09390195B2

    公开(公告)日:2016-07-12

    申请号:US13733069

    申请日:2013-01-02

    CPC classification number: G06F17/30958 G06F17/30533 G06F17/30587

    Abstract: A method of matching a first entity to a second entity by evaluating Boolean expressions includes identifying a set of criteria vertices for a second entity vertex by traversing a graph database in a manner constrained to fact vertices identified for the second entity. The graph database relates fact vertices to the criteria vertices by edges corresponding to Boolean expressions for satisfying criteria for matching first entities to second entities. The method additionally includes selecting one of the first entities based on the criteria vertices of the set. The method further includes matching the first entity to the second entity based on the selection.

    Abstract translation: 通过评估布尔表达式来将第一实体与第二实体匹配的方法包括通过以限制为为第二实体标识的事实顶点的方式遍历图形数据库来识别第二实体顶点的一组标准顶点。 图形数据库通过与布尔表达式相对应的边缘将实际顶点与标准顶点相关联,以满足将第一个实体与第二个实体相匹配的条件。 该方法还包括基于集合的准则顶点来选择第一实体之一。 所述方法还包括基于所述选择将所述第一实体与所述第二实体进行匹配。

Patent Agency Ranking