DBScholar

Back to papers

Algebraic Versus Probabilistic Independence in Data Bases (Extended Abstract)

Summary: Model database mappings as random variables over legal value distributions and define probabilistic independence for mappings, showing it is generally stronger than algebraic independence. Provide necessary and sufficient conditions characterizing when the two notions coincide. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
730
Venue
PODS
Year
1985
Pagerank
5.9685027e-05
Overall Rank
6,123 | 58.00%
DOI
10.1145/325405.325424

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bancilhon_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{Algebraic Versus Probabilistic Independence in Data Bases (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/325405.325424},
        doi = {10.1145/325405.325424},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bancilhon, F. and Spyratos, M.},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,088 A Formal Analysis of Information Disclosure in Data Exchange 2004 SIGMOD 0.00012248135
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
540 Synthesizing Independent Database Schemas 1979 SIGMOD 0.0001686137
Previous Page 1 / 1 Next

Semantically Similar Papers