Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
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
A look-ahead data staging architecture for relational data base machines
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Direct A Multiprocessor Organization for Supporting Relational Database Management Systems
IEEE Transactions on Computers
RAP.2 An Associative Processor for Databases and Its Applications
IEEE Transactions on Computers
RAP: an associative processor for data base management
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Hi-index | 0.00 |
This paper proposes an advanced architecture of the relational database machine (RDBM), named SPIRIT-III, which is basically organized into a three-level memory hierarchy with a sophisticated data-staging and preprocessing architecture for executing relational algebra. SPIRIT-III aims at totally improving both I/O and CPU processing boundary problems and has two major architectural features. One is the introduction of the relational-database-oriented data-staging mechanism, called the look-ahead data-staging mechanism, which can optimally schedule data movement in the memory hierarchy. The other is to attach refined preprocessing mechanisms for relational algebra operations to data transfer lines connected between each memory stage. When a relation stages up or down in the memory hierarchy, these preprocessing mechanisms can function to select tuples and attributes needed by a query and to arrange the relation for parallel processing. SPIRIT-III provides three basic preprocessing filters, called as a whole the Tuple Stream Filter: the tuple selector, the attribute selector, and the grouping filter, implemented with a hash function, which rearranges an original relation and groups the relation into subrelations. The operation of this grouping filter is the primitive preprocessing operation for executing Join and Projection. Then, without the overhead of interprocessor communications, each microprocessor can execute relational algebra operations to a few subsegments assigned to it in parallel. Therefore, SPIRIT-III can perform Join and Projection operations by O (N/L) (L = number of microprocessors), whereas the early RDBMs required O (N X N/L). The proposed SPIRIT-III, which includes features from data-staging architecture to relational algebra execution architecture under the total concept, is the most powerful RDBM based on the state of the art.