Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 4 / Issue 12

available in:   PDF (218 kB) PS (79 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-004-12-0883

 

Linear Derivations for Keys of a Database Relation Schema

Ralf Wastl (University of W├╝rzburg, Germany)

Abstract: 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).

Keywords: automated deduction, database relation schema, keys

Categories: H.2.1, H.2.8