DBScholar

Back to papers

Independent and Separable Database Schemes

Summary: Introduces 'separability' to formalize independently updatable decompositions and proves equivalence to Bancilhon–Spyratos independent mappings. Characterizes separable schemes under FDs and the join dependency (and for dependency-preserving schemes) and gives a polynomial-time test. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
664
Venue
PODS
Year
1983
Pagerank
5.9569613e-05
Overall Rank
6,153 | 57.79%
DOI
10.1145/588058.588091

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chan_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Independent and Separable Database Schemes}},
        url = {https://dl.acm.org/doi/10.1145/588058.588091},
        doi = {10.1145/588058.588091},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chan, Edward P. F. and Mendelzon, Alberto O.},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
40 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00046918506
266 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00022823892
742 Independent Database Schemas (Extended Abstract) 1982 PODS 0.00014426824
4,843 Notions of Dependency Satisfaction 1982 PODS 6.482729e-05
Previous Page 1 / 1 Next

Semantically Similar Papers