{"id":"W2925810066","doi":"10.14778/3342263.3342643","title":"Optimizing subgraph queries by combining binary and worst-case optimal joins","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Intersection (aeronautics); Binary number; Partition (number theory); Query plan; Vertex (graph theory); Query optimization; Matching (statistics); Theoretical computer science; Graph; Mathematics; Data mining; Sargable; Combinatorics; Search engine; Information retrieval","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007779043,0.0004739137,0.0005642964,0.0002324863,0.0003232558,0.0004354776,0.001713689,0.0002020136,0.000006743285],"category_scores_gemma":[0.00004562427,0.0003655164,0.000270276,0.0003552043,0.0002816078,0.0004773714,0.005154019,0.0007321947,0.000002661392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005459553,"about_ca_system_score_gemma":0.00005793275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005563403,"about_ca_topic_score_gemma":5.295241e-7,"domain_scores_codex":[0.9976742,0.00003116683,0.0005163832,0.0008535694,0.0004496153,0.0004751149],"domain_scores_gemma":[0.9984549,0.0000930122,0.0006557339,0.0004796635,0.0001804101,0.000136236],"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.000389336,0.001998046,0.01143002,0.0064245,0.002149583,0.0002655094,0.06972934,0.01045641,0.05637832,0.8012309,0.02186251,0.01768549],"study_design_scores_gemma":[0.008116392,0.002711948,0.001589873,0.009220527,0.0009893159,0.004677493,0.01501081,0.3375212,0.3682124,0.2376984,0.007119782,0.007131791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9834711,0.002401655,0.006830541,0.001637563,0.001575357,0.001318845,0.00005176554,0.0002522162,0.002460961],"genre_scores_gemma":[0.9621273,0.0002854585,0.03700558,0.000156366,0.00004461871,0.00009507265,0.000003381682,0.00003187293,0.0002503553],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5635325,"threshold_uncertainty_score":0.9998797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01149211141263018,"score_gpt":0.21651894232647,"score_spread":0.2050268309138398,"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."}}