Uploaded image for project: 'Infinispan'
  1. Infinispan
  2. ISPN-5388

Optimize redundant predicates (non-indexed query)

    Details

      Description

      Cases where predicates evaluate to constant values are already detected and handled. But besides such trivial simplifications we should also try to handle more advanced simplification rules like:

      • X || X => X
      • X && X => X
      • !X || !X => !X
      • !X && !X => !X
      • X || !X => TRUE (tautology)
      • X && !X => FALSE (contradiction)
        (where X is a predicate not a general boolean expression)

      Even further simplification could be achieved if we were able to handle the general case where X is a general boolean expression, but we'll not try that yet for the sake of complexity.

        Gliffy Diagrams

          Attachments

            Activity

              People

              • Assignee:
                anistor Nistor Adrian
                Reporter:
                anistor Nistor Adrian
              • Votes:
                0 Vote for this issue
                Watchers:
                2 Start watching this issue

                Dates

                • Created:
                  Updated:
                  Resolved: