In this paper we present a Prolog system for decomposing a database scheme into Boye-Codd normal form, based on an algorithm called Reduction by Resolution which allows one to compare a cover for a subset of attributes without building the complete closure of the set of functional dependencies. This leads to a better time performance and also, in some cases, to polynomial complexity.
A Multiple Answer Prolog System for Decomposing a Database into Boyce-Codd Normal Form
Giuliana Dettori;
1988
Abstract
In this paper we present a Prolog system for decomposing a database scheme into Boye-Codd normal form, based on an algorithm called Reduction by Resolution which allows one to compare a cover for a subset of attributes without building the complete closure of the set of functional dependencies. This leads to a better time performance and also, in some cases, to polynomial complexity.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_204728-doc_45741.pdf
non disponibili
Descrizione: A Multiple Answer Prolog System for Decomposing a Database into Boyce-Codd Normal Form
Dimensione
3.03 MB
Formato
Adobe PDF
|
3.03 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
