Dynamic parallel evaluation of the cross-product set using time-stamps

DOI10.1016/0020-0190(92)90213-FMaRDI QIDQ1209356zbMATH OpenOpenAlexFDO

Authors Gopal Gupta

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90213-f

zbMATH Keywords

cross-product setnested-loop algorithmsparallel evaluation of data- base joinssequent symmetry multiprocessorshared memory machines

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4060711
• scientific article; zbMATH DE number 1239812
• Avoiding Cartesian products for multiple joins
• Parallel algorithms for evaluating sequences of set-manipulation operations
• Sorting on a parallel pointer machine with applications to set expression evaluation

Cites work

• scientific article; zbMATH DE number 3839290 (Why is no real title available?)
• scientific article; zbMATH DE number 194564 (Why is no real title available?)
• The Abelianization of almost free groups
• The join algorithms on a shared-memory multiprocessor database machine

Cited in

(2)

• Efficient vector time with dynamic process creation and termination
• scientific article; zbMATH DE number 1239812 (Why is no real title available?)

This page was built for publication: Dynamic parallel evaluation of the cross-product set using time-stamps

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