{"id":"W2153974857","doi":"10.14778/3402707.3402754","title":"Efficient rank join with aggregation constraints","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Join (topology); Computer science; Rank (graph theory); Probabilistic logic; Semantics (computer science); Theoretical computer science; Data mining; Artificial intelligence; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002760366,0.0001103928,0.0001074594,0.00006884943,0.00008116889,0.00006913138,0.0009812349,0.00001712151,0.00002369199],"category_scores_gemma":[0.00001665062,0.00006597405,0.00004374979,0.0003063767,0.0001245881,0.0002178802,0.0004070167,0.00006237887,0.00001478305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002627197,"about_ca_system_score_gemma":0.00001470835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000179765,"about_ca_topic_score_gemma":6.369735e-7,"domain_scores_codex":[0.9990256,0.00000387405,0.0001715746,0.0002448775,0.0003616985,0.0001923379],"domain_scores_gemma":[0.9994701,0.000007924704,0.0001921839,0.0001852234,0.0001030137,0.0000415713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007073717,0.0007284979,0.006853329,0.0001978435,0.0001956582,0.000005201081,0.006316897,0.00006390357,0.007089181,0.8023242,0.003845919,0.1723087],"study_design_scores_gemma":[0.006278842,0.001112447,0.03737469,0.001014368,0.0002143734,0.0000978485,0.001740084,0.06704925,0.8552927,0.02332994,0.005187639,0.001307756],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6017441,0.0001628555,0.1134041,0.002881496,0.001282334,0.002991883,0.0000183265,0.0005226342,0.2769923],"genre_scores_gemma":[0.9660069,0.000005481136,0.03357939,0.0000996747,0.00001967785,0.00002500987,4.588119e-7,0.000005642871,0.0002577226],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8482036,"threshold_uncertainty_score":0.2690344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01904745898815237,"score_gpt":0.1970963168557973,"score_spread":0.1780488578676449,"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."}}