Lazy execution of boolean queries

  • Authors:

  • Dieter Maurer

  • Affiliations:

  • -

  • Venue:
  • Program analysis and compilation, theory and practice
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lazy evaluation, the technique to build special data structures allowing to perform an evaluation at a later time, has many uses in functional programming languagues [1,2,3]. This article shows a use in imperative (object oriented) languages: the lazy execution of boolean queries. Applying lazy index lookup can result in drastic gains in search speed and reduce the amount of required main memory.