DBScholar

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
740
Venue
PODS
Year
1985
Pagerank
-
Overall Rank
14,469 | 0.73%
DOI
10.1145/325405.325449

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{mannila_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{SMALL ARMSTRONG RELATIONS FOR DATABASE DESIGN (Extended abstract)}},
        url = {https://dl.acm.org/doi/10.1145/325405.325449},
        doi = {10.1145/325405.325449},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Mannila, Heikki and Räihä, Kari-Jouko},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,113 Test Data for Relational Queries (Extended abstract) 1986 PODS 6.3587816e-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