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 fac...

Full description

Saved in:
Bibliographic Details
Main Authors STUART, NICHOLAS ALEXANDER, HARTER, JAMES STERLING SHAPIRO, HERFIELD, ERIC STEVEN, LEE, NIENUNG
Format Patent
LanguageEnglish
Published 16.07.2015
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Application Number: AU20140204115