Skip Navigation

The Computer Journal 1982 25(2):239-241; doi:10.1093/comjnl/25.2.239
© 1982 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Papakonstantinou, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimal Evaluation of Queries

G. Papakonstantinou *

N.R.C. ‘Democritos’ Computer Center, Aghia Paraskevi, Athens, Greece

It is shown that the general case of optimal evaluation of Boolean expression queries, with different cost and truth probabilities for the different variables and without the uniqueness restriction, is a special case of finding the optimal decision tree of a limited entry decision table.

Received June 1981.

* N.R.C. ‘Democritos’ Computer Center, Aghia Paraskevi, Athens, Greece


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.