A GROUP-SELECT OPERATION FOR RELATIONAL ALGEBRA AND IMPLICATIONS FOR DATABASE MACHINE DESIGN
dc.contributor.author | Bradley, James | eng |
dc.date.accessioned | 2008-02-27T22:58:23Z | |
dc.date.available | 2008-02-27T22:58:23Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1985-06-01 | eng |
dc.description.abstract | A group select operation has been defined for relational algebra. This operation is found to be useful for very efficiently reducing expressions of non procedural 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 data base machine with an associative memory. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1985-206-19 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30413 | |
dc.identifier.uri | http://hdl.handle.net/1880/46284 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | A GROUP-SELECT OPERATION FOR RELATIONAL ALGEBRA AND IMPLICATIONS FOR DATABASE MACHINE DESIGN | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |