Abstract
Parallel database systems are designed to handle data-intensive and logic-intensive queries. Disjunctive deductive databases (DDDB) — logic databases which allow for indefinite, or partial information - must handle such queries at the extreme. Therefore, a parallel architecture would be ideal for implementing a DDDB. This paper presents a brief description of a non-parallel DDDB, a prototype of which has been implemented at the University of Maryland, along with its query processing algorithm. The main design issues in parallel relational database architectures that are applicable to disjunctive databases are then reviewed. Finally, we investigate the sources of parallelism in DDDB and present a potential architecture for a parallel DDDB system.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
