On evaluating boolean expressions

E. Gudes, A. Reiter

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

An evaluation algorithm for Boolean expressions is efficient if it recognizes when particular conditions cannot affect the value of the result. Of special interest are efficient algorithms which do not expect the conditions to be evaluated in the order in which they appear in the expression. This is important for selective retrieval from a large data base, when the evaluation (retrieval) order depends on the data organization and not on the order in which the qualifiers appear in the query. Another aspect of data retrieval is that we may repeatedly change part (but not all) of the values of the variables, and wish to re‐evaluate part of the expression. Algorithms are given for representing and efficiently evaluating Boolean expressions both for the sequential and random cases; for the latter, an algorithm for partial re‐initialization is also given.

Original languageEnglish
Pages (from-to)345-350
Number of pages6
JournalSoftware - Practice and Experience
Volume3
Issue number4
DOIs
StatePublished - 1 Jan 1973
Externally publishedYes

Keywords

  • Boolean expressions
  • Data base systems
  • Information retrieval
  • Optimization
  • Query languages
  • Searches
  • Trees

ASJC Scopus subject areas

  • Software

Cite this