Rewriting Aggregate Queries using Description Logic.
David DeHaan, David Toman, Grant Weddell · 2003
This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are dicult to optimize because care must be taken to ensure that the output value of the aggregate function is not aected. We present a mapping from an object-relational aggregate query to a DL implication problem such that satisfaction of the implication is a sucient condition for the correctness of a particular logical rewrite rule with respect to a given schema.