DMCA
A decomposition storage model (1985)
| Venue: | PROCEEDINGS OF THE 1985 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA |
| Citations: | 192 - 0 self |
BibTeX
@MISC{Copeland85adecomposition,
author = {George P. Copeland and Setrag N. Khoshafian},
title = {A decomposition storage model},
year = {1985}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This report examines the relative advantages of a storage model based on decomposition (of community view relations into binary relations containing a surrogate and one attribute) over conventional n-ary storage models. There seems to be a general consensus among the database community that the n-ary approach is better. This conclusion is usually based on a consideration of only one or two dimensions of a database system. The purpose of this report is not to claim that decomposition is better. Instead, we claim that the consensus opinion is not well founded and that neither is clearly better until a closer analysis is made along the many dimensions of a database system. The purpose of this report is to move further in both scope and depth toward such an analysis we examine such dimensions as simplicity, generality, storage requirements, update performance and retrieval performance.
Keyphrases
decomposition storage model database system general consensus relative advantage conventional n-ary storage model binary relation storage model database community retrieval performance community view relation update performance storage requirement many dimension consensus opinion n-ary approach
