In this thesis, we propose the query processing system for the stratified deductive database. The proposed query processing algorithm consists of two major steps-preprocessing step and postprocessing step. The preprocessing step is to reduce the search space by evaluating bounded negative subgoals in advance. In the postprocessing step, access plans for the query are transformed into the sequence of algebra operations and the algebra operation as early as possible.
We also implement the proposed stratified query processing system as a component of SOLDABAS (Set Oriented Logic Database System) which is developed on UNIX 4.2 BSD using C language.
