An efficient permutation-based parallel algorithm for range-join in hypercubes

DOI10.1016/0167-8191(94)00069-MzbMATH Open0841.68058WikidataQ126975385 ScholiaQ126975385MaRDI QIDQ1907155FDOQ1907155

Hong Shen

Publication date: 29 January 1996

Published in: Parallel Computing (Search for Journal in Brave)

Recommendations

• Range search in parallel using distributed data structures
• scientific article; zbMATH DE number 1444292
• Radix sort on the hypercube
• Parallel distributive join algorithm on the Intel Paragon
• Parallel fractional cascading on hypercube multiprocessors

zbMATH Keywords

hypercubestime complexityparallel range-join algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computer system organization (68M99)

Cited In (2)

• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
• Range search in parallel using distributed data structures

This page was built for publication: An efficient permutation-based parallel algorithm for range-join in hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907155)