{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003085565,0.001116571,0.00112398,0.001456044,0.0007433302,0.001945849,0.001483044,0.000747141,0.001681974],"category_scores_gemma":[0.006672455,0.0005627598,0.001069676,0.002468894,0.001485524,0.003744451,0.002102111,0.001229686,0.0003135055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001756379,"about_ca_system_score_gemma":0.001950248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004872337,"about_ca_topic_score_gemma":0.00897921,"domain_scores_codex":[0.9959891,0.001085465,0.0002369245,0.0005998036,0.001631264,0.0004574387],"domain_scores_gemma":[0.9970925,0.001610617,0.0002761375,0.0005954487,0.0002906747,0.0001346648],"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.0003977832,0.0003077616,0.004111081,0.0001704087,0.0001113341,0.0001353972,0.0002143519,0.7894086,0.009425192,0.03748442,0.004202717,0.154031],"study_design_scores_gemma":[0.00003492396,0.0001196377,0.000399968,0.00001028575,0.00003700939,0.00006235905,0.00008395418,0.9513783,0.005939264,0.04003942,0.001879194,0.0000157058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07612525,0.0004853479,0.9151751,0.0005021378,0.00003329859,0.0001871142,0.0003384918,0.002039282,0.005113865],"genre_scores_gemma":[0.4360695,0.0002487486,0.5605502,0.0001559634,0.00004560248,0.0001569091,0.0007839247,0.0006559375,0.0013333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004872337,"threshold_uncertainty_score":0.01631826,"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."}}