A multiprocessor organization for very large relational database

Author

Zhu, Jun ; Han, J.Y. ; Hurson, A.R.

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA

fYear

1991

fDate

14-17 May 1991

Firstpage

970

Abstract

The authors present a decentralized architecture for a multiprocessor database machine which supports multiple-user, online, very large relational database systems. A corresponding processor allocation strategy is proposed which applies the dataflow technique to distribute processors across all nodes of the vertically layered query tree and to pipeline pages of intermediate relation between them. Simulations show that the query execution time is 20%-25% less than that in the DIRECT database machine. The time used to process the messages in the authors´ database machine is almost 40% less than the time used in DIRECT. The simulation also indicated that the machine´s structure is less sensitive to the I/O bound than the DIRECT machine

Keywords

multiprocessor interconnection networks; relational databases; I/O bound; dataflow technique; decentralized architecture; intermediate relation; large relational database; multiple-user; multiprocessor database machine; multiprocessor organization; online database systems; pipeline pages; processor allocation strategy; query execution time; vertically layered query tree; Computer aided instruction; Computer architecture; Computer networks; Data engineering; Data flow computing; Database machines; Processor scheduling; Query processing; Relational databases; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on

Conference_Location

Monterey, CA

Print_ISBN

0-7803-0620-1

Type

conf

DOI

10.1109/MWSCAS.1991.251974

Filename

251974