This Article 
 Bibliographic References 
 Add to: 
Two-Dimensional Specification of Universal Quantification in a Graphical Database Query Language
March 1992 (vol. 18 no. 3)
pp. 216-224

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.

[1] P. P. Chen, "The Entity-Relationship Model -- Towards a Unified View of Data,"ACM Trans. Database Syst., Vol. 1, No. 1, Mar. 1976, pp. 9-36.
[2] E. F. Codd, "Relational completeness of data base sublanguages," inData Base Systems(Proc. 6th Courant Computer Science Symp., May 1971), R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 65-98.
[3] R. Demolombe, "Syntactical characterization of a subset of domain-independent formulas,"ONERACERT, Tech. Rep., 1982.
[4] R. Elmasri and J. A. Larson, "A graphical query facility for ER databases," inProc. 4th Int. Conf. Entity-Relationship Approach, Chicago, IL, 1985, pp. 236-245.
[5] "IBM database 2 reference," 3rd ed., IBM, Mar. 1986.
[6] W. Kim, "On optimizing an SQL-like nested query,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 443-469, Sept. 1982.
[7] H. J. Kimet al., "PICASSO: a graphical query language,"Software Pract. Experience, vol. 18, no. 3, pp. 169-203, Mar. 1988.
[8] R. Krishnamurthy and C. Zaniolo, "Safety and optimization of horn clause queries," inProc. Foundations of Deductive Databases and Logic Program. (Washington, DC), Aug. 1986, J. Minker, Ed.
[9] D. Maier and J.D. Ullman, "Maximal objects and the semantics of universal relation databases,"ACM Trans. Database Syst., vol. 8, no. 1, pp. 1-14, Mar. 1983.
[10] N. McDonald and M. Stonebraker, "CUPID--the friendly query language," inProc. ACM Pacific Conf.(San Francisco), 1975, pp. 127-131.
[11] G. Ozsoyoglu and H. Wong, "A relational calculus with set operators: its safety, and equivalent graphical languages,"Dept. Comp. Eng. and Sci., Case Western Reserve Univ., Cleveland, OH, Tech. Rep., 1987.
[12] J. C. Shepherdson, "Negation in logic programming," inProc. Foundations of Deductive Databases and Logic Program. (Washington, DC), 1986, J. Minker, Ed.
[13] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[14] A. Van Gelder and R. W. Topor, "Safety and correct translation of relational calculus formulas," inProc. ACM Symp. on Principles of Database Syst., 1987, pp. 313-326.
[15] H. K. T. Wong and I. Kuo, "GUIDE: Graphical user interface for database exploration," inProc. 8th VLDB Conf., Mexico City, Mexico, 1982, pp. 22-31.
[16] Z. Q. Zhang and A. O. Mendelzon, "A graphical query language for entity-relationship databases," inProc. 3rd Int. Conf. Entity-Relationship Approach, 1983.
[17] M. M. Zloof, "Query by example," inProc. Nat. Comput. Conf., 1975, pp. 431-438.

Index Terms:
graphical database query language; universal quantification; existential quantification; direct representation; two-dimensional translation; existentially quantified two-dimensional queries; relational queries; computer graphics; database theory; formal specification; query languages; relational databases
K.-Y. Whang, A. Malhotra, G.H. Sockut, L. Burns, K.-S. Choi, "Two-Dimensional Specification of Universal Quantification in a Graphical Database Query Language," IEEE Transactions on Software Engineering, vol. 18, no. 3, pp. 216-224, March 1992, doi:10.1109/32.126770
Usage of this product signifies your acceptance of the Terms of Use.