Database Paper Browser

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
628
Venue
PODS
Year
1982
Pagerank
0.00022657396
Overall Rank
458 | 96.82%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
1,196 On Computing Restricted Projections of Representative Instances 1985 PODS 0.00013403617
1,849 Improving Database Schemes by Adding Attributes 1983 PODS 0.00010329397
2,318 Efficient Query Answering in the Representative Instance Approach 1985 PODS 9.0400919e-05
2,918 Notions of Dependency Satisfaction 1982 PODS 7.9051531e-05
3,361 Functional Dependencies on Cyclic Database Schemes 1983 SIGMOD 7.1735665e-05
3,380 Independent and Separable Database Schemes 1983 PODS 7.1606467e-05
5,841 Constant Time Maintenance or The Triumph of the fd. 1986 PODS 5.3039672e-05
6,168 Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions 1984 SIGMOD 5.1716335e-05
7,979 Independence-reducible Database Schemes 1988 PODS 4.613363e-05
7,980 A Characterization of Constant-time-maintainability for BCNF Database Schemes 1988 SIGMOD 4.613363e-05
8,403 On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies 1987 PODS 4.5234988e-05
8,427 Designing Globally Consistent Network Schemas 1983 SIGMOD 4.5159344e-05
9,511 Computing Full Disjunctions 2003 PODS 4.3340927e-05
12,925 Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation 1990 SIGMOD 4.1945683e-05
12,926 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 4.1945683e-05
12,939 Can Constant-time Maintainability Be More Practical? 1989 PODS 4.1945683e-05
12,950 Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction 1988 PODS 4.1945683e-05
12,975 A New Basis for the Weak Instance Model 1987 PODS 4.1945683e-05
12,986 Independent Database Schemes Under Functional And Inclusion Dependencies 1987 VLDB 4.1945683e-05
12,995 On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract) 1986 PODS 4.1945683e-05
13,051 Algebraic Aspects of Relational Database Decomposition (Extended Abstract) 1983 PODS 4.1945683e-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
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
12,950 Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction 1988 PODS 4.1945683e-05
12,975 A New Basis for the Weak Instance Model 1987 PODS 4.1945683e-05
3,380 Independent and Separable Database Schemes 1983 PODS 7.1606467e-05
9,012 Querying Weak Instances 1984 PODS 4.4096041e-05
3,047 Comprehensive Approach to the Design of Relational Database Schemes 1984 VLDB 7.6561027e-05
1,062 Assumptions in Relational Database Theory 1982 PODS 0.00014366096
356 Synthesizing Independent Database Schemas 1979 SIGMOD 0.00026034713
13,060 A Systematic Approach to Relational Database Theory 1982 SIGMOD 4.1945683e-05
12,926 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 4.1945683e-05
12,986 Independent Database Schemes Under Functional And Inclusion Dependencies 1987 VLDB 4.1945683e-05