A group-select operation for relational algebra and implications for database machine design

Author

Bradley, J.

Author_Institution

Dept. of Comput. Sci., Calgary Univ., Alta., Canada

Volume

14

Issue

1

fYear

1988

fDate

1/1/1988 12:00:00 AM

Firstpage

126

Lastpage

129

Abstract

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 specified condition. 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

Keywords

relational databases; associative memory; database machine design; group-select operation; natural quantifiers; nonprocedural relational languages; relational algebra; tuples; ANSI standards; Algebra; Associative memory; Calculus; Database machines; EMP radiation effects; Natural languages; Relational databases; Remuneration; Standards development;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.4630

Filename

4630