Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

DLOG
2003

favoriteEmaildiscussreport

105views Automated Reasoning» more DLOG 2003»

Rewriting Aggregate Queries using Description Logic

14 years 16 days ago

Rewriting Aggregate Queries using Description Logic

Download sunsite.informatik.rwth-aachen.de

This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are diﬃcult to optimize because care must be taken to guarantee that the output value of the aggregate function is not aﬀected. We present a mapping from an objectrelational aggregate query to a DL implication problem such that satisfaction of the implication is a suﬃcient condition for the correctness of a particular logical rewrite rule with respect to a given schema.

David DeHaan, David Toman, Grant E. Weddell

Real-time Traffic

Aggregate Function | Automated Reasoning | DL Implication Problem | DLOG 2003 | Objectrelational Aggregate Query |

claim paper

Related Content

» Tractable query answering and rewriting under description logic constraints

» Aggregation and Relevance in Deductive Databases

» Description Logics with Concrete Domains and Aggregation

» Algorithms for Rewriting Aggregate Queries Using Views

» Selecting and Using Views to Compute Aggregate Queries Extended Abstract

» Exploiting Conjunctive Queries in Description Logic Programs

» Aggregate queries over ontologies

» Query evaluation using overlapping views completeness and efficiency

» AggregateQuery Processing in Data Warehousing Environments

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	DLOG
Authors	David DeHaan, David Toman, Grant E. Weddell

Comments (0)