Design by example: An application of Armstrong relations (Q579962): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086073919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Armstrong Relations for Functional Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clauses and database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Armstrong databases for functional and inclusion dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the family of generalized dependency constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347338 / rank
 
Normal rank

Latest revision as of 11:14, 18 June 2024

scientific article
Language Label Description Also known as
English
Design by example: An application of Armstrong relations
scientific article

    Statements

    Design by example: An application of Armstrong relations (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Example relations, and especially Armstrong relations, can be used as user friendly representations of dependency sets. In this paper we analyze the use of Armstrong relations in database design with functional dependencies, and show how they and the usual representation of dependencies can be used together. Special attention is given to the size of Armstrong relations. We derive new bounds for the size of minimal Armstrong relations for normalized schemes. Specifically, any relation scheme in Boyce-Codd Normal Form has an Armstrong relation whose size is roughly the product of the lengths of the keys for the scheme. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation.
    0 references
    relational database
    0 references
    Armstrong relations
    0 references
    representations of dependency sets
    0 references
    database design
    0 references
    functional dependencies
    0 references
    Boyce-Codd Normal Form
    0 references

    Identifiers