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.
展开▼
