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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hughes, J.: Why Functional Programming Matters. Internal report, Programming Methodology Group, Chalmers Institute of Technology, Gothenburg, Sweden (1985)
Bird, R., Wadler, P.: Introduction to Functional Programming. Prentice-Hall, Englewood Cliffs (1988)
Nordin, T., Tolmach, A.: Modular Lazy Search for Constraint Satisfaction Problems. Pacific Software Research Center, Oregon Graduate Institute & Portland State University (1999)
van Rossum, G.: Programming Language Python. http://www.python.org
Maurer, D.: IncrementalSearch2. http://www.dieter.handshake.de/pyprojects/zope#IncrementalSearch2
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Maurer, D. (2007). Lazy Execution of Boolean Queries. In: Reps, T., Sagiv, M., Bauer, J. (eds) Program Analysis and Compilation, Theory and Practice. Lecture Notes in Computer Science, vol 4444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71322-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-71322-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71315-9
Online ISBN: 978-3-540-71322-7
eBook Packages: Computer ScienceComputer Science (R0)