96 search results - page 1 / 20 » On Implicate Discovery and Query Optimization |
IDEAS
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
SWWS
2007
13 years 6 months ago
2007
−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...
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
—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 ...
PAKDD
2005
ACM
13 years 10 months ago
2005
ACM
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...
DLOG
2003
13 years 6 months ago
2003
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...