Concept of checking integrity constraints in cellular network relational databases

Author

Chudziak, J.A.

Author_Institution

Inst. of Comput. Eng., Warsaw Univ. of Technol.

fYear

1990

fDate

7-9 Mar 1990

Firstpage

136

Lastpage

138

Abstract

A fully parallel algorithm for checking generalized dependencies in relational databases implemented in cellular arrays is presented. The author defines mappings between general dependencies given in a tabular notation and the special structure in cellular arrays, and then he introduces an algorithm operating in an associative way. He then shows how this algorithm operates for some types of dependencies. It is suggested that any complete DBMS (database management system) can be efficiently implemented in the cellular array architecture as a VLSI chip

Keywords

cellular arrays; parallel algorithms; parallel architectures; relational databases; special purpose computers; DBMS; VLSI chip; associative algorithm; cellular arrays; cellular network relational databases; checking; database management system; generalized dependencies; integrity constraints; parallel algorithm; special structure; tabular notation; Algebra; Intelligent networks; Land mobile radio cellular systems; Read-write memory; Relational databases; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Conference_Location

Miami Beach, FL

Print_ISBN

0-8186-2035-8

Type

conf

DOI

10.1109/PARBSE.1990.77132

Filename

77132