Abstract
This study presents the architecture design and evaluation of a relational machine employing advanced data structures and algorithms to manipulate set-level operations required in a relational model. Data structures and algorithms are presented that are suitable for VLSI-oriented parallel pocessing. The data structure called VTF (valid tuple flags) is a simple bit string that is used to distinguish valid tuples from invalid ones. VTF helps to reduce the cost to recognize the valid tuples, to minimize the memory requirement, and to avoid constructing a temporary relation as a result of executed relational operations. A description is given of basic concepts of VTF, an efficient processing method using VTF, design of a relational machine architecture introducing this method, and performance evaluations of the method and the architecture.
| Original language | English |
|---|---|
| Pages | 407-423 |
| Number of pages | 17 |
| Publication status | Published - 1981 |
| Externally published | Yes |
| Event | Conf Proc Annu Symp Comput Archit 8th - Minneapolis, MN, USA Duration: 1981 May 12 → 1981 May 14 |
Other
| Other | Conf Proc Annu Symp Comput Archit 8th |
|---|---|
| City | Minneapolis, MN, USA |
| Period | 81/5/12 → 81/5/14 |
ASJC Scopus subject areas
- Engineering(all)