Two-Dimensional Specification of Universal Quantification in a Graphical Database Query Language

  • Authors:
  • Kyu-Young Whang;Ashok Malhotra;Gary H. Sockut;Luanne Burns;Key-Sun Choi

  • Affiliations:
  • Korea Advanced Institute of Science and Technology, Daejeon, Korea;IBM T. J. Watson Research Center, Yorktown Heights, NY;IBM T. J. Watson Research Center, Yorktown Heights, NY;IBM T. J. Watson Research Center, Yorktown Heights, NY;Korea Advanced Institute of Science and Technology, Daejeon, Korea

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

A technique is proposed for specifying universal quantification and existential quantification (combined with negation) in a two-dimensional (graphical) database query language. Unlike other approaches that provide set operators to simulate universal quantification, this technique allows a direct representation of universal quantification. 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 are presented. The resulting relational queries can be processed directly by many existing database systems. The authors claim that this technique renders universal quantifications easy to understand. To substantiate this claim, they provide a simple, easy-to-follow guideline for constructing universally quantified queries.