Implementation of a Database System with Boolean Algebra Constraints

Authors

András Salamon, University of Nebraska - Lincoln

First Advisor

Peter Z. Revesz

Date of this Version

5-1998

Comments

A THESIS Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfillment of Requirements For the Degree of Master of Science, Major: Computer Science, Under the Supervision of Professor Peter Z. Revesz. Lincoln, Nebraska: May, 1998

Copyright (c) 1998 András Salamon

Abstract

This thesis describes an implementation of a constraint database system with constraints over a Boolean Algebra of sets. The system allows within the input database as well as the queries equality, subset-equality and monotone inequality constraints between Boolean Algebra terms built up using the operators of union, intersection and complement. Hence the new system extends the earlier DISCO system, which only allowed equality and subset-equality constraints between Boolean algebra variables and constants. The new system allows Datalog with Boolean Algebra constraints as the query lan- guage. The implementation includes an extension of Naive and Semi-Naive evaluation methods for Datalog programs and algebraic optimization techniques for relational algebra formulas. The thesis also includes three example applications of the new system in the area of family tree genealogy, genome map assembly, and two-player game analysis. In each of these three cases the optimization provides a significant improvement in the running time of the queries.

Advisor: Peter Z. Revesz