Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On optimizing the evaluation of a set of expressions

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

A branch- and-bound type algorithm is developed to optimize the evaluation of a set of expressions. The algorithm proceeds in a depth-first manner and achieves an optimal solution. The algorithm is applied to optimize the evaluation of sets of relational expressions. Analogies to the heuristic information associated with theA* algorithm are investigated. Examples are presented illustrating the use of the algorithm. Pragmatics associated with the algorithm and its application to Boolean optimization are also discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Grant and J. Minker, “On Optimizing the Evaluation of a Set of Expressions,” Technical Report (revised), Department of Computer Science, University of Maryland (1980).

  2. J. Grant and J. Minker, “Optimization in Deductive and Conventional Relational Database Systems,” inAdvances in Database Theory Volume I, 195–234, Edited by H. Gallaire, J. Minker, and J. -M. Nicolas (Plenum Press, New York, 1981).

    Google Scholar 

  3. L. R. Harris, “The Heuristic Search Under Conditions of Error,”Artificial Intelligence 5:217–234 (1974).

    Google Scholar 

  4. N. J. Nilsson,Principles of Artificial Intelligence (Tioga Publishing Co., Palo Alto, CA, 1980).

    Google Scholar 

  5. E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice (Prentice-Hall, Englewood-Cliffs, NJ., 1977).

    Google Scholar 

  6. P. G. Selinger et al., “Access Path Selection in a Relational Database Management System,”Proceedings of ACM-SIGMOD Conference (Boston, MA, 1979), pp. 23–34.

  7. J. D. Ullman,Principles of Database Systems (Computer Science Press, Potomac, MD, 1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Towson State University, 21204, Towson, Maryland

    John Grant

  2. University of Maryland, 20742, College Park, Maryland

    Jack Minker

Authors
  1. John Grant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by the National Science Foundation under grant number NSF MCS 79-19418 and by the National Aeronautics and Space Administration under grant number NGR 21-002-270-9.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grant, J., Minker, J. On optimizing the evaluation of a set of expressions. International Journal of Computer and Information Sciences 11, 179–191 (1982). https://doi.org/10.1007/BF00999727

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00999727

Key words

Search

Navigation