发明名称 Using a graph database to match entities by evaluating boolean expressions
摘要 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.
申请公布号 US9390195(B2) 申请公布日期 2016.07.12
申请号 US201313733069 申请日期 2013.01.02
申请人 Research Now Group, Inc. 发明人 Harter James Sterling Shapiro;Herfield Eric Steven;Stuart Nicholas Alexander;Lee Nien-Chung
分类号 G06F17/30 主分类号 G06F17/30
代理机构 Baker & McKenzie LLP 代理人 Baker & McKenzie LLP
主权项 1. A method of matching a first entity to a second entity by evaluating Boolean expressions, the method comprising: identifying one or more fact vertices for the second entity; generating a first set of criteria vertices by traversing a graph database constrained to the fact vertices identified for the second entity, wherein the graph database relates fact vertices to criteria vertices by edges corresponding to a Boolean expression for matching the first entity to the second entity; and for a first criteria vertex in the first set of criteria vertices: determining whether the first criteria vertex matches a first fact vertex among the fact vertices identified for the second entity,in response to determining the first criteria vertex matches the first fact vertex, assembling a second set of criteria vertices by adding the first criteria vertex to the second set of criteria vertices, or in response to determining the first criteria vertex does not match a fact vertex among the fact vertices identified for the second entity, retaining the second set of criteria vertices,determining whether the second set of criteria vertices completes the Boolean expression, andin response to determining the second set of criteria vertices completes the Boolean expression, completing the assembly of the second set of criteria vertices, or in response to determining the second set of criteria vertices does not complete the Boolean expression, processing a second criteria vertex in the first set of criteria vertices,wherein completion of an include criteria of the Boolean expression is determined separately from completion of an exclude criteria of the Boolean expression.
地址 Plano TX US