Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
−The ability for software agents to discover, query, and task ubiquitous sensors requires machineinterpretable service descriptions, such as those proposed by the Semantic Web ef...
J. Caleb Goodwin, David J. Russomanno, Joseph Qual...
—Many modern optimizers use a transformation rule based framework. While there has been a lot of work on identifying new transformation rules, there has been little work focused ...
Surajit Chaudhuri, Leo Giakoumakis, Vivek R. Naras...
Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are difficult to optimize be...