Database Paper Browser

Back to papers

Practical algorithms for finding prime attributes and testing normal forms

Summary: Algorithms for testing attribute primality and normal forms with running time polynomial in the number of maximal non-determining sets (i.e., generators of the closure family) instead of all attribute subsets. Shows this parameter is small in practice, giving simple, fast implementations used in Design-By-Example. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
858
Venue
PODS
Year
1989
Pagerank
5.3298267e-05
Overall Rank
5,781 | 59.79%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,255 Discovering XSD Keys from XML Data 2013 SIGMOD 4.5491362e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
4,463 Computing Covers for Embedded Functional Dependencies 1987 PODS 6.160725e-05
5,408 An Improved Algorithm for Finding a Key of a Relation 1985 PODS 5.5240911e-05
Previous Page 1 / 1 Next

Semantically Similar Papers