Propeties of storage hierarchy systems with multiple page sizes and redundant data
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
A comparative analysis of disk scheduling policies
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
A relational database machine based on functional programming concepts
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
| Hi-index | 0.00 |
This paper proposes a novel data staging architecture of the relational data base machine (RDBM) using a memory hierarchy system and moving head disks as a data base store (DBS). From a realistic viewpoint of implementing RDBM to support large data bases, RDBM based on this configuration is the most practical approach. However, a crucial problem exists in RDBM of this type; namely, the total performance is restricted by poor throughput of the data movement between the processing subsystem and DBS. To solve the problem, we have designed a powerful architecture to enhance the capability of the data staging, taking the properties of a relational data base environment into consideration. This paper describes the design and implementation issues of the data staging subsystem for RDBM developed by the authors and confirms the advantages through simulation study with GPSS.