DBScholar

Back to papers

Variable Independence and Aggregation Closure

Summary: Introduce variable independence, a schema restriction (generalizing classical relational assumptions) that ensures closure of constraint-database languages under aggregation. Show for linear constraint databases that area and higher-dimensional aggregates fit this closed relational-algebra fragment. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1074
Venue
PODS
Year
1996
Pagerank
6.858392e-05
Overall Rank
4,165 | 71.43%
DOI
10.1145/237661.237673

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chomicki_pods96,
        address = {New York, NY, USA},
        series = {{PODS} '96},
        title = {{Variable Independence and Aggregation Closure}},
        url = {https://dl.acm.org/doi/10.1145/237661.237673},
        doi = {10.1145/237661.237673},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chomicki, J. and Goldin, D. Q. and Kuper, G. M.},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers