DBScholar

Back to papers

Independent Database Schemas (Extended Abstract)

Summary: Complete characterization of schemas that admit no interrelation constraints under the weak-instance semantics (a weakened universal-relation assumption). Focuses on JD+FD constraints and pinpoints exactly when admissible states coincide with a weak instance. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
hd8cb5808c3a1d617
Venue
PODS
Year
1982
Pagerank
0.00014104125
Overall Rank
769 | 94.84%
DOI
10.1145/588111.588144

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{graham_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Independent Database Schemas (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/588111.588144},
        doi = {10.1145/588111.588144},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Graham, Marc H. and Yannakakis, Mihalis},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
1,455 On Computing Restricted Projections of Representative Instances 1985 PODS 0.00010599099
2,163 Improving Database Schemes by Adding Attributes 1983 PODS 8.9350033e-05
3,598 Functional Dependencies on Cyclic Database Schemes 1983 SIGMOD 7.1782813e-05
3,619 Efficient Query Answering in the Representative Instance Approach 1985 PODS 7.1558272e-05
4,964 Notions of Dependency Satisfaction 1982 PODS 6.337274e-05
5,480 Constant Time Maintenance or The Triumph of the fd. 1986 PODS 6.1130394e-05
6,281 Independent and Separable Database Schemes 1983 PODS 5.8238839e-05
7,279 Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions 1984 SIGMOD 5.5671882e-05
8,465 Independence-reducible Database Schemes 1988 PODS 5.3350162e-05
8,466 A Characterization of Constant-time-maintainability for BCNF Database Schemes 1988 SIGMOD 5.3350162e-05
9,141 Designing Globally Consistent Network Schemas 1983 SIGMOD 5.2209105e-05
9,789 Computing Full Disjunctions 2003 PODS 5.1265605e-05
13,410 Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation 1990 SIGMOD 4.9793485e-05
13,411 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 4.9793485e-05
13,424 Can Constant-time Maintainability Be More Practical? 1989 PODS 4.9793485e-05
13,435 Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction 1988 PODS 4.9793485e-05
13,461 On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies 1987 PODS 4.9793485e-05
13,463 A New Basis for the Weak Instance Model 1987 PODS 4.9793485e-05
13,474 Independent Database Schemes Under Functional and Inclusion Dependencies 1987 VLDB 4.9793485e-05
13,483 On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) 1986 PODS 4.9793485e-05
13,540 Algebraic Aspects of Relational Database Decomposition (Extended Abstract) 1983 PODS 4.9793485e-05
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
278 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00022313978
Previous Page 1 / 1 Next

Semantically Similar Papers