{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906141,0.0003615165,0.000624985,0.0004009416,0.0008959963,0.001314622,0.002341042,0.0007683109,0.001964628],"category_scores_gemma":[0.001806594,0.0006211436,0.0005933622,0.0006392365,0.0005164465,0.001507459,0.0009202084,0.000736803,0.0008247485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005943771,"about_ca_system_score_gemma":0.00142806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002287617,"about_ca_topic_score_gemma":0.001939891,"domain_scores_codex":[0.9992512,0.0001176866,0.00008123946,0.0001424324,0.0003089888,0.00009843145],"domain_scores_gemma":[0.9990979,0.0002004403,0.00005317186,0.0002194493,0.0003588829,0.00007015854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001023252,0.0004518934,0.003234703,0.000656869,0.0002730486,0.0004375449,0.0009482844,0.2046811,0.1411604,0.05965567,0.0107939,0.5766835],"study_design_scores_gemma":[0.0002344975,0.0003704521,0.0004879007,0.00002557324,0.00009276179,0.0002461798,0.0001162032,0.8936483,0.06054651,0.01508229,0.02910785,0.00004139008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01859531,0.0001712476,0.9775391,0.00009390827,0.00004440891,0.0001539061,0.00003961912,0.001866303,0.001496109],"genre_scores_gemma":[0.1039419,0.0001319388,0.8935093,0.0000541826,0.00003000345,0.0001891508,0.0001962988,0.0002146358,0.001732512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002341042,"threshold_uncertainty_score":0.006572366,"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."}}