Hardware sorter and its application to data base machine
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 10 (3) , 218-225
- https://doi.org/10.1145/1067649.801730
Abstract
The main contribution of this paper is the design of a hardware sorter. This sorter is configured as a balanced, fixed binary tree of node units; the configuration of the sorter is independent of the length of data to be sorted. Each node unit can be realized on a single LSI chip. The logic of the hardware sorter design is heavily influenced by a specific, compressed, representation of sorted data. Using this hardware sorter and a few auxiliary functions based on the sorted property, we demonstrate the design of a relational data base machine.Keywords
This publication has 4 references indexed in Scilit:
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Sorting with associative secondary storage devicesPublished by Association for Computing Machinery (ACM) ,1977
- The design of a rotating associative memory for relational database applicationsACM Transactions on Database Systems, 1976
- The architecture of CASSMPublished by Association for Computing Machinery (ACM) ,1973