One major operation in a deductive database is to verify the contents of the database with integrity constraints whenever the database is changed. The number of facts and integrity constraints in a deductive database often makes the validation process the bottleneck of the system. In this paper, we describe a set of approaches to process integrity constraints efficiently on sequential computers and on massively parallel computers.
Bibliographical noteFunding Information:
With the growth of research on use of database for nonconventional applications, much attention has been paid to deductive database systems \[9,10,13\].T he advantages of such systems can be easily stated as follows: (a) By taking advantages of the ability to capture rules on various subjects (such as family membership, VLSI data, and geometric information), deductive database systems ease the users in posing naive and high level queries. (b) Rules, themselves, are data. They are intensional in nature. Deductive databases make it possible to handle a huge amount of intensional data in a fairly nature way. (c) Consider, for example, two relations father(X, Y) and ancestor(X, Y). Instead of saving all the extensional data of these two relations, we can save all the extensional data of father(X, Y) and the following two rules: * This research is supported in part by the National Science Foundation under grant number CDR-85-00022.
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Networks and Communications