Traditional relational or deductive databases can store definite information only. In practical situations, however, much of the information is not precise. Disjunctive deductive databases are logic databases which allow for indefinite or partial information which is formally expressed by means of disjunctions. This paper describes a prototype implementation of such a database system that has been done at the University of Maryland at College Park. We present the main modules of the system and describe optimization techniques used in query evaluation and the storage of indefinite information. We also suggest ways the implemented architecture may be developed into a parallel system.