Database Paper Browser

Back to papers

Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation

Summary: Introduces independence-reducibility, a tractable modification of key dependencies, and uses it to build BCNF designs optimized for updates and query answering, with a polynomial-time test and minimal relation count. Unifies designs for constant-time-maintainable, independence-reducible, and separable BCNF schemes under a single polynomial-time construction. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2472
Venue
SIGMOD
Year
1990
Pagerank
4.1945683e-05
Overall Rank
12,925 | 10.09%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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.00075110004
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
458 Independent Database Schemas (Extended Abstract) 1982 PODS 0.00022657396
2,318 Efficient Query Answering in the Representative Instance Approach 1985 PODS 9.0400919e-05
12,939 Can Constant-time Maintainability Be More Practical? 1989 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers