Abstract
The importance of the efficient enforcement of integrity constraints over deductive databases has long been recognised. Most of this work, however, has been done in the context of logic-based languages. In contrast, we here consider the specification and enforcement of constraints in the functional database language PFL. We show how an optimisation strategy developed for fast constraint enforcement in logic databases [8] can be adapted to the functional context and extended to support a wider class of constraints, including static aggregate constraints.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have