The design of a rotating associative memory for relational database applications
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
The architecture of CASSM: A cellular system for non-numeric processing
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
A problem-oriented inferential database system
ACM Transactions on Database Systems (TODS)
A Special-Function Unit for Sorting and Sort-Based Database Operations
IEEE Transactions on Computers
A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation
IEEE Transactions on Computers
A VLSI tree machine for relational data bases
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
| Hi-index | 0.01 |
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.