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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,353 | Formal Limits on the Automatic Generation and Maintenance of Integrity Constraints | 1987 | PODS | 0.00012431009 |
| 2,531 | Efficient Query Answering in the Representative Instance Approach | 1985 | PODS | 8.5916172e-05 |
| 3,367 | Functional Dependencies on Cyclic Database Schemes | 1983 | SIGMOD | 7.1665323e-05 |
| 7,070 | Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions | 1984 | SIGMOD | 4.8380576e-05 |
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 |
|---|---|---|---|---|
| 38 | Testing Implications Of Data Dependencies | 1979 | SIGMOD | 0.0007528369 |
| 131 | Can We Use The Universal Instance Assumption Without Using Nulls? | 1981 | SIGMOD | 0.00043719033 |
| 500 | Independent Database Schemas (Extended Abstract) | 1982 | PODS | 0.00021622167 |
| 4,842 | Notions of Dependency Satisfaction | 1982 | PODS | 5.8778608e-05 |
Previous
Page 1 / 1
Next