DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS.

Y. Kiyoki, K. Tanaka, H. Aiso, N. Kamibayashi

Research output: Contribution to conferencePaper

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 languageEnglish
Pages407-423
Number of pages17
Publication statusPublished - 2017 Jan 1
EventConf Proc Annu Symp Comput Archit 8th - Minneapolis, MN, USA
Duration: 1981 May 121981 May 14

Other

OtherConf Proc Annu Symp Comput Archit 8th
CityMinneapolis, MN, USA
Period81/5/1281/5/14

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kiyoki, Y., Tanaka, K., Aiso, H., & Kamibayashi, N. (2017). DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS.. 407-423. Paper presented at Conf Proc Annu Symp Comput Archit 8th, Minneapolis, MN, USA, .