Linear Derivations for Keys of a Database Relation Schema
| dc.creator | Wastl,Ralf | |
| dc.date | 1998 | |
| dc.date.accessioned | 2024-02-06T12:49:45Z | |
| dc.date.available | 2024-02-06T12:49:45Z | |
| dc.description | In [Wastl 1998] we have introduced the Hilbert style inference system K for deriving all keys of a database relation schema. In this paper we investigate formal K-derivations more closely using the concept of tableaux. The analysis gives insight into the process of deriving keys of a relation schema. Also, the concept of tableaux gives a proof procedure for computing all keys of a relation schema. In practice, the methods developed here will be usefull for computing keys or for deciding whether an attribute is a key attribute, respectively non-key attribute. This decision problem becomes relevant when checking whether a relation schema is in third normal form, or when applying the well-known 3NF-decomposition algorithm (a.k.a. 3NF-synthesis algorithm). | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-004-12-0883 | |
| dc.identifier | https://lib.jucs.org/article/27527/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7477 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 4(12): 883-897 | |
| dc.subject | database relation schema | |
| dc.subject | keys | |
| dc.subject | automated deduction | |
| dc.title | Linear Derivations for Keys of a Database Relation Schema | |
| dc.type | Research Article |