Skip to main content
SpringerLink
Log in
Book cover

GI — 6. Jahrestagung pp 211–220Cite as

An Optimal Evaluation of Boolean Expressions in an On-Line Query System

  • Conference paper

  • 32 Accesses

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

Abstract

A method is given for a fast evaluation of a Boolean expression of attributes against a record of a file, and it thus enables a faster response to general queries for reports from a data bank stored as a file. In this method, the time it takes to test a particular attribute in a record and the probability that the attribute is possessed by a record are taken into account to produce an evaluation algorithm for which the expected time of evaluation of the Boolean expression for a record is minimal.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arden, B.W., Galler, B.A., and Graham, R.M., An algorithm for translating Boolean expressions. J. Assoc. Comput. Mach. 9 (1962) 222–239.

    Article  MathSciNet  MATH  Google Scholar 

  2. Casey, R.G., Design of tree structures for efficient quering. Comm. ACM 16,9 (Sept. 1973) 549–556.

    Article  Google Scholar 

  3. Cheatham, T.E., and Sattley, K., Syntax directed compiling. In Programming Systems and Languages, edited by Saul Rosen, McGraw-Hill 1967.

    Google Scholar 

  4. Codd, E.F., A relational model of data for large shared data banks. Comm. ACM 13,6 (June 1970) 377–387.

    Google Scholar 

  5. Codd, E.F., Further normalization of the data base relational model. In Data Base Systems, edited by R. Rustin, Prentice Hall (Courant Computer Science Symposium 6, 1971).

    Google Scholar 

  6. Codd, E.F., Relational completeness of data base sublanguages. (Same book as (5)).

    Google Scholar 

  7. Date, D.J., An Introduction to Database Systems. Addison Wesley 1975.

    Google Scholar 

  8. Knuth, D.E., The Art of Computer Programming, vol. 1, ch. 2. Addison Wesley.

    Google Scholar 

  9. Knuth, D.E., Structured programming with goto statements. Comput. Surveys 6, 4 (Dec. 1974) 261–301.

    Article  MathSciNet  MATH  Google Scholar 

  10. Nievergelt, J., Binary search trees and file organization. Comput. Surveys 6, 3 (Sept. 1974) 195–207.

    Article  MATH  Google Scholar 

  11. Nilsson, N. J., Problem Solving Methods in Artificial Intelligence, McGraw-Hill 1971.

    Google Scholar 

  12. Severance, D. G., Identifier search mechanism: a survey and generalized model. Comput. Surveys 6, 3 (Sept. 1974) 175–194.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Michael Z. Hanani

Authors
  1. Michael Z. Hanani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Herdweg 51, D-7000, Stuttgart 1, Deutschland

    Erich J. Neuhold

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Hanani, M.Z. (1976). An Optimal Evaluation of Boolean Expressions in an On-Line Query System. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation