This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Group-Select Operation for Relational Algebra and Implications for Database Machine Design
January 1988 (vol. 14 no. 1)
pp. 126-129

A group-select operation has been defined for relational algebra. This operation is found to be useful for efficiently reducing expressions of nonprocedural relational languages that permit natural quantifiers. Conceptually, the operation first partitions a relation into blocks of tuples that have the same value for an attribute or attribute concatenation. It then extracts each block for which a specified number of tuples meet a specifiedcondition. The quantity of tuples for the operation is specified by means of a natural quantifier. Performance of the group-select operation will be poor with conventional file processing, making the operation more suitable for use with a database machine with an associative memory.

[1] A. V. Aho, C. Beeri, and J. D. Ullman, "The theory of joins in relational databases,"ACM Trans. Database Syst., vol. 4, no. 3, pp. 314-317, 1979.
[2] W. W. Armstrong, "Dependency structures of database relationships, " inProc. IFIP 74. Amsterdam, The Netherlands: North-Holland, 1974, pp. 580-583.
[3] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 25-40, Jan. 1981.
[4] J. Bradley, "SQL/N and attribute/relation associations implicit in functional dependencies,"Int. J. Comput. Inform. Sci., vol. 12, no. 2, 1983.
[5] J. Bradley, "SQL/N and modes of association in relational databases," Univ. Calgary, Calgary, Alta., Canada, Res. Rep. 84/143/5, 39 pp., 1984.
[6] J. Bradley, "A fundamental classification of associations in relational databases," Univ. Calgary, Alta., Canada, Res. Rep. 85/204/17, 32 pp., 1985.
[7] D. D. Chamberlin, "Relational database management systems,"ACM Comput. Surveys, vol. 8, no. 1, pp. 43-66, 1976.
[8] D. D. Chamberlinet al., "SEQUEL 2: A unified approach to data definition, manipulation and control,"IBM J. Res. Develop., vol. 2, no. 6, pp. 560-575, 1976.
[9] 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.
[10] E. F. Codd, "Further normalization of the database relational model," inDatabase Systems(Courant Computer Science Symposium 6), R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971, pp. 33-74.
[11] E. F. Codd, "Relational completeness of database sublanguages," inDatabase Systems(Computer Science Symposium 6). R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1971, pp. 65-98.
[12] E. F. Codd, "ACM-Turing award lecture: Relational databases: A practical foundation for productivity,"Commun. ACM, vol. 25, no. 2, pp. 109-117, Feb. 1982.
[13] R. Fagin, "Multivariate dependencies and a new normal form for relational database,"ACM TODS, vol. 2, no. 3, pp. 262-278, 1977.
[14] W. Kim, "On optimizing an SQL-like nested query,"ACM Trans. Database Syst., vol. 7, no. 3, pp. 443-469, Sept. 1982.
[15] T. H. Merret, "QT logic: Simpler and more expressive than predicate calculus,"Inform. Processing Lett., vol. 7, no. 6, pp. 251-255, 1978.
[16] F. Sadri and J. D. Ullman, "Templete dependencies: A large class of dependencies in relational databases and its complete axiomatization,"J. ACM, vol. 29, no. 2, pp. 363-372, 1972.
[17] Y. Sagiv and S. F. Walecka, "Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies,"J. ACM, vol. 29, no. 1, pp. 363-372, 1982.
[18] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[19] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[20] J. A. Wald and P. G. Sorenson, "Resolving the query inference problem using Steiner trees,"ACM Trans. Database Syst., vol. 9, no. 3, pp. 348-368, 1984,
[21] G. Wiederhold,Database Design. New York: McGraw-Hill, 1983.
[22] D. Welty and D. W. Stemple, "Human factors comparison of procedural and nonprocedural query languages,"ACM Trans. Database Syst., vol. 6, no. 4, pp. 626-649, 1981.

Index Terms:
relational algebra; database machine design; group-select operation; nonprocedural relational languages; natural quantifiers; tuples; associative memory; relational databases
Citation:
J. Bradley, "A Group-Select Operation for Relational Algebra and Implications for Database Machine Design," IEEE Transactions on Software Engineering, vol. 14, no. 1, pp. 126-129, Jan. 1988, doi:10.1109/32.4630
Usage of this product signifies your acceptance of the Terms of Use.