{"id":"W2104241878","doi":"10.1109/icde.1992.213204","title":"The design and implementation of a parallel join algorithm for nested relations on shared-memory multiprocessors","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Join (topology); Nesting (process); Parallelism (grammar); Shared memory; Nested loop join; Hash join; Speedup; Parallel algorithm; Hash function; Theoretical computer science; Algorithm; Programming language; Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003034154,0.00006545633,0.00007374034,0.00003033716,0.0002207024,0.00002759463,0.00008396179,0.00001676105,0.000005240689],"category_scores_gemma":[0.00005687735,0.00004259431,0.00001920875,0.0001135569,0.00002568593,0.0003465515,0.00002021499,0.00002595519,0.000001881254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001009606,"about_ca_system_score_gemma":0.00004424407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002853093,"about_ca_topic_score_gemma":0.00003628887,"domain_scores_codex":[0.9994005,0.00005205404,0.0001843515,0.0001577884,0.00009086941,0.0001144135],"domain_scores_gemma":[0.9992303,0.0003854925,0.00009180934,0.0001909087,0.00007360119,0.00002789886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009567902,0.00003139067,0.0001222139,0.00002248619,0.0000214662,7.868234e-7,0.001472982,0.001621366,0.0002833305,0.7578158,0.001944169,0.2366544],"study_design_scores_gemma":[0.005182601,0.0009697136,0.0047883,0.0001042913,0.00002790679,0.00003498476,0.008868708,0.8470463,0.03357203,0.01817566,0.08052246,0.0007071033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004719485,0.00009402286,0.9984988,0.0001717204,0.00005461708,0.000532952,0.00001629092,0.00002982712,0.0001298163],"genre_scores_gemma":[0.01049162,0.00001504505,0.9888219,0.0000554058,0.000007451719,0.0001444015,0.000007308925,0.000004754271,0.0004521587],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8454249,"threshold_uncertainty_score":0.1736946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02583467103076926,"score_gpt":0.2969546913942387,"score_spread":0.2711200203634694,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}