Concepts of Sorting and Projection in a Cellular Array.

M. Muraszkiewicz: Concepts of Sorting and Projection in a Cellular Array. VLDB 1981: 76-80

@inproceedings{DBLP:conf/vldb/Muraszkiewicz81,
  author    = {M. Muraszkiewicz},
  title     = {Concepts of Sorting and Projection in a Cellular Array},
  booktitle = {Very Large Data Bases, 7th International Conference, September
               9-11, 1981, Cannes, France, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1981},
  pages     = {76-80},
  ee        = {db/conf/vldb/Muraszkiewicz81.html},
  crossref  = {DBLP:conf/vldb/81},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Concepts of parallel algorithms of sorting and projection are presented in this paper. Implementation of the algorithms in a rectangular cellular array is suggested. The array is a two-dimensional iterative pattern of identical primitive one-character processors (cells ). Sorting is basedupon the parallel exchangings of words which arestored along the array rows. Sorting runs in O(n )time. The data arranged according to the Codd'srelational model can be memorized in the array.The projection operator implementation employingsorting and matching is presented.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings. IEEE Computer Society 1981
Contents

References

[1]: ...
[2]: E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970)
[3]: ...
[4]: ...
[5]: ...
[6]: ...