Supporting universal quantification in a two-dimensional database query language

A technique for specifying universal quantification and existential quantification (combined with negation) in a two-dimensional (graphical) database query language is proposed. Unlike other approaches that provide set operators to simulate universal quantification, this technique allows a direct representation of universal quantification. The authors present syntactic constructs for specifying universal and existential quantifications, two-dimensional translation of universal quantification to existential quantification (with negation), and translation of existentially quantified two-dimensional queries to relational queries. The resulting relational queries can be processed directly by many existing database systems. Traditionally, universal quantification has been considered a difficult concept for typical database programmers. The authors claim that this technique renders universal quantification easy to understand. To substantiate this claim, they provide a simple, easy-to-follow guideline for constructing universally quantified queries. They believe that the direct representation of universal quantification in a two-dimensional language is new and that the technique contributes significantly to the understanding of universal quantification in the context of database query languages.