ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (3)
  • functional dependency  (3)
  • Springer  (3)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Frontiers Media
  • Institute of Electrical and Electronics Engineers (IEEE)
  • National Academy of Sciences
  • Periodicals Archive Online (PAO)
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (3)
  • 2017
  • 2009
  • 2008
  • 2005
  • 1983  (3)
  • Informatik  (3)
  • Philosophie
Sammlung
  • Artikel  (3)
Verlag/Herausgeber
  • Springer  (3)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Frontiers Media
  • +
Erscheinungszeitraum
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (3)
Jahr
  • 2017
  • 2009
  • 2008
  • 2005
  • 1983  (3)
Thema
  • Informatik  (3)
  • Philosophie
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    International journal of parallel programming 12 (1983), S. 65-86 
    ISSN: 1573-7640
    Schlagwort(e): Association ; data base ; functional dependency ; natural quantifier ; quantifier ; relation ; retrieval language ; SQL ; SQL/N
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract SQL/N is an expressive nonprocedural data base language that is upward compatible with SQL. Its expressive power is derived from both the use of natural quantifiers and the quantification of subsets of relations, in particular the subsets that are the groups of related tuples that occur in associations between relations. We show that SQL/N is also very expressive in specifying requests involving attribute-relation associations, and that attribute-relation associations are implicit in functional dependencies. We show that an attribute-relation association may be derived from the association between an algebraic projection relation and the relation on which the projection operation is performed. Two common cases of attribute-relation associations are investigated: first the case of an association restricted to a single relation, and second a more general attribute-relation association where an attribute from one relation is associated with a second relation.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    International journal of parallel programming 12 (1983), S. 247-267 
    ISSN: 1573-7640
    Schlagwort(e): Relational database model ; integrity constraints ; functional dependency ; multivalued dependency
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract In this paper, pseudo-functional and pseudo-multivalued dependencies are introduced. They are shown to be isomorphic with functional and multivalued dependencies, i.e., they behave in the same way with respect to implication. This formalism leads in a very natural way to a rather efficient algorithm for the inference of functional and multivalued dependencies. Some applications to acyclic join dependencies are discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    International journal of parallel programming 12 (1983), S. 269-283 
    ISSN: 1573-7640
    Schlagwort(e): Entity-relationship diagram ; functional dependency ; fundamental fd ; relational scheme ; regular ERD ; Boyce-Codd normal form ; loop-free ERD
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract In Ref. 8, we introduced a simplifying assumption about entity-relationship diagrams (ERDs), called regularity, and showed that regular ERDs have several desirable properties. One such property is that every relation schema in the ERD's canonical relational scheme can be put into Third Normal Form. We left open there the more basic question: under what conditions would the original relation schemas actually be in Boyce-Codd Normal Form (BCNF)? Since the visible semantics of ERDs determine naturally their associated functional dependencies (fd's), it is important to know when an ERD, as designed, already has this strongest normal form given purely in terms of fd's. We show here a sufficient diagrammatic condition (loop-free) under which a regular ERD will have databases enjoying the benefits of BCNF.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...