Sort computation
- Author:
- Dorband, John E.
- Published:
- JAN 1, 1988.
- Physical Description:
- 1 electronic document
Online Version
- hdl.handle.net , Connect to this object online.
- Restrictions on Access:
- Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access - Summary:
- Sorting has long been used to organize data in preparation for further computation, but sort computation allows some types of computation to be performed during the sort. Sort aggregation and sort distribution are the two basic forms of sort computation. Sort aggregation generates an accumulative or aggregate result for each group of records and places this result in one of the records. An aggregate operation can be any operation that is both associative and commutative, i.e., any operation whose result does not depend on the order of the operands or the order in which the operations are performed. Sort distribution copies the value from a field of a specific record in a group into that field in every record of that group.
- Other Subject(s):
- Collection:
- NASA Technical Reports Server (NTRS) Collection.
- Note:
- Document ID: 19900007130.
Accession ID: 90N16446.
The 2nd Symposium on the Frontiers of Massively Parallel Computations; p 137-141. - Terms of Use and Reproduction:
- No Copyright.
View MARC record | catkey: 15687680