{"id":"W2114615578","doi":"10.1109/icde.1996.492115","title":"Parallel pointer-based join algorithms in memory mapped environments","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Join (topology); Pointer (user interface); Programmer; Pointer analysis; Parallel computing; Algorithm; Shared memory; Parallel algorithm; Graph; Linked list; Theoretical computer science; Programming language; Static analysis; Mathematics; Artificial intelligence","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.0001984627,0.0001419461,0.0001494796,0.0001832736,0.00005277746,0.00007409745,0.0006530237,0.00006331864,0.0002136545],"category_scores_gemma":[0.0000129439,0.0001339102,0.00005456499,0.0002476675,0.00003013558,0.000206789,0.0001478527,0.000120467,0.0002317239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005360351,"about_ca_system_score_gemma":0.000008497504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002801846,"about_ca_topic_score_gemma":0.000003505548,"domain_scores_codex":[0.9987859,0.00008356787,0.0002674322,0.0003718243,0.0002145299,0.000276808],"domain_scores_gemma":[0.9993351,0.00004263037,0.00006336896,0.0004762163,0.000008582107,0.00007416592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004308842,0.004169771,0.007145123,0.00006897833,0.00007693281,0.0004951867,0.003337158,0.4631865,0.001385858,0.01836311,0.1430702,0.3586582],"study_design_scores_gemma":[0.0007564045,0.00005509858,0.0006819054,0.00001443771,7.85285e-7,0.000004287844,0.000005696701,0.9937519,0.001818552,0.0004621243,0.002264126,0.0001846594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009148297,0.00007430398,0.9825348,0.001171604,0.00007900463,0.0001422067,3.88027e-7,0.0003980595,0.01468476],"genre_scores_gemma":[0.2514286,0.00002755428,0.7417389,0.001489932,0.00002060697,0.00002045473,0.000002353542,0.00001074984,0.005260935],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5305654,"threshold_uncertainty_score":0.5460697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02416784841593343,"score_gpt":0.2357359698863822,"score_spread":0.2115681214704488,"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."}}