Rewriting Aggregate Queries using Description Logic

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 because care must be taken to guarantee that the output value of the aggregate function is not affected. We present a mapping from an objectrelational aggregate query to a DL implication problem such that satisfaction of the implication is a sufficient condition for the correctness of a particular logical rewrite rule with respect to a given schema.

• Type: Conference
• Year: 2003
• Where: DLOG
• Authors: David DeHaan, David Toman, Grant E. Weddell
• Keywords: Aggregate Function, Automated Reasoning, DL Implication Problem, DLOG 2003, Objectrelational Aggregate Query