Variable Independence and Aggregation Closure (1996)
Cached
Download Links
- [www.cs.brown.edu]
- [hawkmail.monmouth.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS |
| Citations: | 31 - 10 self |
BibTeX
@INPROCEEDINGS{Chomicki96variableindependence,
author = {J. Chomicki and D. Q. Goldin and G. M. Kuper},
title = {Variable Independence and Aggregation Closure},
booktitle = {IN ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS},
year = {1996},
pages = {40--48},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We discuss the issue of adding aggregation to constraint databases. Previous work has shown that, in general, adding aggregates to constraint databases results in languages that are not closed. We show that by imposing a natural restriction, called variable independence (which is a generalization of the assumptions underlying the classical relational model of data) on the schema, we can guarantee that a restricted version of the language with aggregation is closed. We illustrate our approach in the context of linear constraint databases.
