Database Paper Browser

Back to papers

SMALL ARMSTRONG RELATIONS FOR DATABASE DESIGN (Extended abstract)

Summary: Analyzes Armstrong relations as compact example-based representations of FD closures, deriving new bounds on minimal Armstrong-relation size for normalized schemas and giving algorithms to generate them. Demonstrates benefits for schema design and FD inference, and highlights open problems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
741
Venue
PODS
Year
1985
Pagerank
-
Overall Rank
14,268 | 0.74%
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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,638 Test Data for Relational Queries (Extended abstract) 1986 PODS 6.0291138e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

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

Semantically Similar Papers