×

System and Method for Efficiently Evaluating Complex Boolean Expressions

  • US 20110225038A1
  • Filed: 03/15/2010
  • Published: 09/15/2011
  • Est. Priority Date: 03/15/2010
  • Status: Abandoned Application
First Claim
Patent Images

1. A computer system for evaluating Boolean expressions, comprising:

  • an index search engine that accesses an index by each of a plurality of attribute-value pairs to retrieve a plurality of positional identifiers for the plurality of attribute-value pairs to find a plurality of objects each represented by a Boolean expression of at least one of the plurality of attribute-value pairs, each of the plurality of positional identifiers indicating a position of a node in a plurality of virtual Boolean expression trees that each encode the plurality of objects each represented by the Boolean expression of the at least one of the plurality of attribute-value pairs;

    an expression evaluator operably coupled to the index search engine that determines whether the plurality of positional identifiers found in the index for the plurality of attribute-value pairs satisfy a virtual Boolean expression tree of at least one of the plurality of objects; and

    a storage operably coupled to the index search engine that stores the index with each of the plurality of positional identifiers for each of the plurality of attribute-value pairs in sorted order by at least one object identifier of the plurality of objects.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×