TY - GEN
T1 - Variable independence and aggregation closure
AU - Chomicki, J.
AU - Goldin, D. Q.
AU - Kuper, G. M.
PY - 1996
Y1 - 1996
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0029709038
U2 - 10.1145/237661.237673
DO - 10.1145/237661.237673
M3 - Conference contribution
AN - SCOPUS:0029709038
T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS
SP - 40
EP - 48
BT - Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, PODS 1996
PB - ACM
T2 - 15th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, PODS 1996
Y2 - 4 June 1996 through 6 June 1996
ER -