Design by example: an application of Armstrong relations
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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, NY
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report
665. |
| Schlagworte: | |
| Zusammenfassung: | 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. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation. |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006524721 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 930210s1985 |||| 00||| eng d | ||
| 035 | |a (OCoLC)16651372 | ||
| 035 | |a (DE-599)BVBBV006524721 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a SS 4570 |0 (DE-625)143475: |2 rvk | ||
| 100 | 1 | |a Mannila, Heikki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Design by example |b an application of Armstrong relations |c Heikki Mannila ; Kari-Jouko Räihä |
| 264 | 1 | |a Ithaca, NY |c 1985 | |
| 300 | |a 18 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report |v 665. | |
| 520 | 3 | |a 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. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation. | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Database management | |
| 650 | 4 | |a Set theory | |
| 700 | 1 | |a Räihä, Kari-Jouko |e Verfasser |4 aut | |
| 810 | 2 | |a Dept. of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 665. |w (DE-604)BV006185504 |9 665 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-004154954 | ||
Datensatz im Suchindex
| _version_ | 1804120790574039040 |
|---|---|
| any_adam_object | |
| author | Mannila, Heikki Räihä, Kari-Jouko |
| author_facet | Mannila, Heikki Räihä, Kari-Jouko |
| author_role | aut aut |
| author_sort | Mannila, Heikki |
| author_variant | h m hm k j r kjr |
| building | Verbundindex |
| bvnumber | BV006524721 |
| classification_rvk | SS 4570 |
| ctrlnum | (OCoLC)16651372 (DE-599)BVBBV006524721 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01715nam a2200337 cb4500</leader><controlfield tag="001">BV006524721</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930210s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16651372</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006524721</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4570</subfield><subfield code="0">(DE-625)143475:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mannila, Heikki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Design by example</subfield><subfield code="b">an application of Armstrong relations</subfield><subfield code="c">Heikki Mannila ; Kari-Jouko Räihä</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report</subfield><subfield code="v">665.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Set theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Räihä, Kari-Jouko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dept. of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">665.</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">665</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004154954</subfield></datafield></record></collection> |
| id | DE-604.BV006524721 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:47:41Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004154954 |
| oclc_num | 16651372 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report |
| spelling | Mannila, Heikki Verfasser aut Design by example an application of Armstrong relations Heikki Mannila ; Kari-Jouko Räihä Ithaca, NY 1985 18 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Dept. of Computer Science: Technical report 665. 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. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation. Computational complexity Database management Set theory Räihä, Kari-Jouko Verfasser aut Dept. of Computer Science: Technical report Cornell University <Ithaca, NY> 665. (DE-604)BV006185504 665 |
| spellingShingle | Mannila, Heikki Räihä, Kari-Jouko Design by example an application of Armstrong relations Computational complexity Database management Set theory |
| title | Design by example an application of Armstrong relations |
| title_auth | Design by example an application of Armstrong relations |
| title_exact_search | Design by example an application of Armstrong relations |
| title_full | Design by example an application of Armstrong relations Heikki Mannila ; Kari-Jouko Räihä |
| title_fullStr | Design by example an application of Armstrong relations Heikki Mannila ; Kari-Jouko Räihä |
| title_full_unstemmed | Design by example an application of Armstrong relations Heikki Mannila ; Kari-Jouko Räihä |
| title_short | Design by example |
| title_sort | design by example an application of armstrong relations |
| title_sub | an application of Armstrong relations |
| topic | Computational complexity Database management Set theory |
| topic_facet | Computational complexity Database management Set theory |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT mannilaheikki designbyexampleanapplicationofarmstrongrelations AT raihakarijouko designbyexampleanapplicationofarmstrongrelations |