Semantically Unconnected Relational Schemes
By means of normalizing data the relational scheme is decomposed into several smaller and more regular sub-schemes. During the decomposition there should be no loss of information. Using the Aho, Beri and Ullman algorithm it is possible to prove that the initial set of information has been kept. Usi...
| Permalink: | http://skupni.nsk.hr/Record/ffzg.KOHA-OAI-FFZG:311907/Similar |
|---|---|
| Matična publikacija: |
Zbornik radova "Težakovi dani" Tkalac, Slavko ; Lasić-Lazić, Jadranka |
| Glavni autori: | Mateljan, Vladimir (-), Tkalac, Slavk (Author), Čubrilo, Mirko |
| Vrsta građe: | Članak |
| Jezik: | eng |
APA stil citiranja
Mateljan, V. (2002). Semantically Unconnected Relational Schemes: Semantically Unconnected Relational Schemes. Zbornik radova "Težakovi dani".
Chicago stil citiranjaMateljan, Vladimir. "Semantically Unconnected Relational Schemes: Semantically Unconnected Relational Schemes." 2002.
MLA stil citiranjaMateljan, Vladimir. "Semantically Unconnected Relational Schemes: Semantically Unconnected Relational Schemes." 2002.