Fast parallel algorithms for processing of joins

Dennis Shasha, Paul Spirakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present and analyze here some innovative techniques for processing a join (or a semi-join) in a parallel computing environment. Our algorithms employ perfect hashing and, in some cases, copying of data in a group of processors, or filtering the data as they move through the network. By using the combinatorial properties of hashing we are able to prove almost optimal speedup, with high probability, when some uniformity assumptions hold for the data. Even in the absense of these assumptions our techniques achieve sub-optimal speedup and can be used as practical heuristics.

Original languageEnglish (US)
Title of host publicationSupercomputing - 1st International Conference, Proceedings
PublisherSpringer Verlag
Pages939-953
Number of pages15
Volume297 LNCS
ISBN (Print)9783540189916
DOIs
StatePublished - Jan 1 1988
Event1st International Conference on Supercomputing, 1987 - Athens, Greece
Duration: Jun 8 1987Jun 12 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume297 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Supercomputing, 1987
CountryGreece
CityAthens
Period6/8/876/12/87

Fingerprint

Copying
Parallel processing systems
Parallel algorithms
Parallel Algorithms
Fast Algorithm
Join
Hashing
Speedup
Processing
Parallel Computing
Uniformity
Filtering
Heuristics

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Shasha, D., & Spirakis, P. (1988). Fast parallel algorithms for processing of joins. In Supercomputing - 1st International Conference, Proceedings (Vol. 297 LNCS, pp. 939-953). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18991-2_55

Fast parallel algorithms for processing of joins. / Shasha, Dennis; Spirakis, Paul.

Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS Springer Verlag, 1988. p. 939-953 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shasha, D & Spirakis, P 1988, Fast parallel algorithms for processing of joins. in Supercomputing - 1st International Conference, Proceedings. vol. 297 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 297 LNCS, Springer Verlag, pp. 939-953, 1st International Conference on Supercomputing, 1987, Athens, Greece, 6/8/87. https://doi.org/10.1007/3-540-18991-2_55
Shasha D, Spirakis P. Fast parallel algorithms for processing of joins. In Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS. Springer Verlag. 1988. p. 939-953. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-18991-2_55
Shasha, Dennis ; Spirakis, Paul. / Fast parallel algorithms for processing of joins. Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS Springer Verlag, 1988. pp. 939-953 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9febcb9261d340089e63e35bc91bc48a,
title = "Fast parallel algorithms for processing of joins",
abstract = "We present and analyze here some innovative techniques for processing a join (or a semi-join) in a parallel computing environment. Our algorithms employ perfect hashing and, in some cases, copying of data in a group of processors, or filtering the data as they move through the network. By using the combinatorial properties of hashing we are able to prove almost optimal speedup, with high probability, when some uniformity assumptions hold for the data. Even in the absense of these assumptions our techniques achieve sub-optimal speedup and can be used as practical heuristics.",
author = "Dennis Shasha and Paul Spirakis",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/3-540-18991-2_55",
language = "English (US)",
isbn = "9783540189916",
volume = "297 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "939--953",
booktitle = "Supercomputing - 1st International Conference, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Fast parallel algorithms for processing of joins

AU - Shasha, Dennis

AU - Spirakis, Paul

PY - 1988/1/1

Y1 - 1988/1/1

N2 - We present and analyze here some innovative techniques for processing a join (or a semi-join) in a parallel computing environment. Our algorithms employ perfect hashing and, in some cases, copying of data in a group of processors, or filtering the data as they move through the network. By using the combinatorial properties of hashing we are able to prove almost optimal speedup, with high probability, when some uniformity assumptions hold for the data. Even in the absense of these assumptions our techniques achieve sub-optimal speedup and can be used as practical heuristics.

AB - We present and analyze here some innovative techniques for processing a join (or a semi-join) in a parallel computing environment. Our algorithms employ perfect hashing and, in some cases, copying of data in a group of processors, or filtering the data as they move through the network. By using the combinatorial properties of hashing we are able to prove almost optimal speedup, with high probability, when some uniformity assumptions hold for the data. Even in the absense of these assumptions our techniques achieve sub-optimal speedup and can be used as practical heuristics.

UR - http://www.scopus.com/inward/record.url?scp=85034817033&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034817033&partnerID=8YFLogxK

U2 - 10.1007/3-540-18991-2_55

DO - 10.1007/3-540-18991-2_55

M3 - Conference contribution

SN - 9783540189916

VL - 297 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 939

EP - 953

BT - Supercomputing - 1st International Conference, Proceedings

PB - Springer Verlag

ER -