Database Paper Browser

Back to papers

Logical Schema Design that Quantifies Update Inefficiency and Join Efficiency

Summary: Introduces the l-Bounded Cardinality Normal Form (l-BCNF), a parameterized schema design that quantifies update effort and join efficiency under FDs (BCNF = l=1). Algorithms compute the smallest l across FD-preserving decompositions, with FD loss or prioritization enabling de-normalization and predicting materialized-view maintenance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6264
Venue
SIGMOD
Year
2021
Pagerank
4.1945683e-05
Overall Rank
11,490 | 20.07%
DOI
10.1145/3448016.3459238

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 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank Cited Paper Year Venue Pagerank
356 Synthesizing Independent Database Schemas 1979 SIGMOD 0.00026034713
894 A Hybrid Approach to Functional Dependency Discovery 2016 SIGMOD 0.00015556428
1,047 Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms 2015 VLDB 0.00014459715
1,884 Normal forms and relational database operators 1979 SIGMOD 0.00010215563
2,077 Efficient Discovery of Approximate Dependencies 2018 VLDB 9.6001836e-05
2,450 Functional Dependencies for Graphs 2016 SIGMOD 8.7882979e-05
7,819 Main Memory Adaptive Denormalization 2016 SIGMOD 4.6432769e-05
11,854 SQL Schema Design: Foundations, Normal Forms, and Normalization 2016 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers