Aggregate Queries Over Conditional Tables

Authors: Lechtenbörger J.¹; Shu H.²; Vossen G.³

Source: Journal of Intelligent Information Systems, Volume 19, Number 3, November 2002 , pp. 343-362(20)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

Conditional tables have been identified long ago as a way to capture unknown or incomplete information. However, queries over conditional tables have never been allowed to involve column functions such as aggregates. In this paper, the theory of conditional tables is extended in this direction, and it is shown that a strong representation system exists which has the closure property that the result of an aggregate query over a conditional table can be again represented by a conditional table. It turns out, however, that the number of tuples in a conditional table representing the result of an aggregate query may grow exponentially in the number of variables in the table. This phenomenon is analyzed in detail, and tight upper and lower bounds concerning the number of tuples contained in the result of an aggregate query are given. Finally, representation techniques are sketched that approximate aggregation results in tables of reasonable size.

Keywords: database; incomplete information; aggregate query; data warehouse

Language: English

Document Type: Research article

Affiliations: 1: Department of Information Systems, University of Münster, Leonardo-Campus 3, D-48149 Münster, Germany. lechten@helios.uni-muenster.de 2: IBM Silicon Valley Lab, 555 Bailey Avenue, San Jose, CA 95141, USA. huashu@us.ibm.com 3: Department of Information Systems, University of Münster, Leonardo-Campus 3, D-48149 Münster, Germany. vossen@helios.uni-muenster.de

Publication date: 2002-11-01