发明名称 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.
申请公布号 US2016314196(A1) 申请公布日期 2016.10.27
申请号 US201615202121 申请日期 2016.07.05
申请人 RESEARCH NOW GROUP, INC. 发明人 HARTER James Sterling Shapiro;HERFIELD Eric Steven;STUART Nicholas Alexander;LEE Nien-Chung;MYERS Stephen Allen;ANTONIUK Jeremy Scott;COURTRIGHT Melanie Denise;MONETA Daren;FLOWER Peter David
分类号 G06F17/30;G06Q30/02 主分类号 G06F17/30
代理机构 代理人
主权项 1. An apparatus for matching a first entity to a second entity by evaluating Boolean expressions, the apparatus comprising: a memory that stores a graph database relating fact vertices to criteria vertices by edges corresponding to Boolean expressions for satisfying criteria for matching first entities to second entities; and a processor configured to: identify 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;select one of the first entities based on the criteria vertices of the set; andmatch the first entity to the second entity based on the selection.
地址 Plano TX US