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

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

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

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
Title of host publicationConference Proceedings - Annual Symposium on Computer Architecture
PublisherIEEE Comput Soc Press
Pages407-423
Number of pages17
Publication statusPublished - 1981
Externally publishedYes
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

Fingerprint

Data structures
Data storage equipment
Processing
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kiyoki, Y., Tanaka, K., Aiso, H., & Kamibayashi, N. (1981). DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS. In Conference Proceedings - Annual Symposium on Computer Architecture (pp. 407-423). IEEE Comput Soc Press.

DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS. / Kiyoki, Yasushi; Tanaka, K.; Aiso, H.; Kamibayashi, N.

Conference Proceedings - Annual Symposium on Computer Architecture. IEEE Comput Soc Press, 1981. p. 407-423.

Research output: Chapter in Book/Report/Conference proceedingChapter

Kiyoki, Y, Tanaka, K, Aiso, H & Kamibayashi, N 1981, DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS. in Conference Proceedings - Annual Symposium on Computer Architecture. IEEE Comput Soc Press, pp. 407-423, Conf Proc Annu Symp Comput Archit 8th, Minneapolis, MN, USA, 81/5/12.
Kiyoki Y, Tanaka K, Aiso H, Kamibayashi N. DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS. In Conference Proceedings - Annual Symposium on Computer Architecture. IEEE Comput Soc Press. 1981. p. 407-423
Kiyoki, Yasushi ; Tanaka, K. ; Aiso, H. ; Kamibayashi, N. / DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS. Conference Proceedings - Annual Symposium on Computer Architecture. IEEE Comput Soc Press, 1981. pp. 407-423
@inbook{abd305b38eef4e9781bb9344517bf32d,
title = "DESIGN AND EVALUATION OF A RELATIONAL DATA BASE MACHINE EMPLOYING ADVANCED DATA STRUCTURES AND ALGORITHMS.",
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.",
author = "Yasushi Kiyoki and K. Tanaka and H. Aiso and N. Kamibayashi",
year = "1981",
language = "English",
pages = "407--423",
booktitle = "Conference Proceedings - Annual Symposium on Computer Architecture",
publisher = "IEEE Comput Soc Press",

}

TY - CHAP

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

AU - Kiyoki, Yasushi

AU - Tanaka, K.

AU - Aiso, H.

AU - Kamibayashi, N.

PY - 1981

Y1 - 1981

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0019892580&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019892580&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0019892580

SP - 407

EP - 423

BT - Conference Proceedings - Annual Symposium on Computer Architecture

PB - IEEE Comput Soc Press

ER -