On optimizing the evaluation of a set of expressions
Copyright policy )On optimizing the evaluation of a set of expressions
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.
- University of Maryland, College Park United States
- Towson University United States
relational expressions, set optimization, Information storage and retrieval of data, branch-and-bound type algorithm, depth-first search, Boolean optimization, Searching and sorting
relational expressions, set optimization, Information storage and retrieval of data, branch-and-bound type algorithm, depth-first search, Boolean optimization, Searching and sorting
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!