{"id":"W2069307110","doi":"10.1145/1529282.1529629","title":"Exploiting join cardinality for faster hash joins","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Joins; Join (topology); Computer science; Cardinality (data modeling); Hash join; Hash function; Theoretical computer science; Parallel computing; Database; Mathematics; Programming language","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.006382171,0.0007743221,0.0009224152,0.001356056,0.001503487,0.002868322,0.001669869,0.0006899859,0.001786708],"category_scores_gemma":[0.01548,0.0008350071,0.0005678932,0.001353232,0.001099028,0.007276976,0.003797838,0.001498426,0.000708526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009567992,"about_ca_system_score_gemma":0.001940979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001066384,"about_ca_topic_score_gemma":0.002011331,"domain_scores_codex":[0.9950092,0.001141391,0.0005951346,0.0007398931,0.002097061,0.0004173234],"domain_scores_gemma":[0.9807174,0.01019063,0.001747776,0.005047997,0.001796331,0.0004999087],"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.003101189,0.0008490311,0.04532296,0.0005548783,0.0002253463,0.0004566682,0.001858091,0.1237237,0.3281688,0.05344352,0.008016206,0.4342797],"study_design_scores_gemma":[0.0002617255,0.0008359224,0.006899834,0.00006309672,0.0001467517,0.0007082815,0.0006670475,0.5824507,0.3453331,0.04161677,0.02082274,0.0001939846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2785953,0.0009089861,0.7067398,0.0005750552,0.0001353572,0.0002458992,0.0004289216,0.007182198,0.005188532],"genre_scores_gemma":[0.6754754,0.0002484643,0.3215369,0.0001004104,0.0001222557,0.0001033841,0.0007183662,0.0005163221,0.001178418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006382171,"threshold_uncertainty_score":0.0337525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04712684653484023,"score_gpt":0.2610858423320991,"score_spread":0.2139589957972589,"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."}}