{"id":"W3166524313","doi":"10.1145/3446980","title":"Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Joins; Query plan; Query optimization; Spatial query; Vertex (graph theory); Computation; Theoretical computer science; Graph; Sargable; Algorithm; Database; Web search query; 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.0004732419,0.0002602813,0.000370788,0.0002523635,0.0006795399,0.0004642126,0.0004497603,0.00008633082,0.00003807849],"category_scores_gemma":[0.00004116816,0.0002724144,0.0001200168,0.0007171771,0.0001235585,0.001039213,0.00006351592,0.0002886171,0.000024964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210181,"about_ca_system_score_gemma":0.00008976243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000240856,"about_ca_topic_score_gemma":0.00003325362,"domain_scores_codex":[0.9979767,0.000316329,0.000380164,0.0006708245,0.0002630822,0.0003929675],"domain_scores_gemma":[0.9978201,0.0002771641,0.0001061714,0.001468987,0.0001176569,0.0002099128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005752323,0.005947342,0.0002917442,0.002166299,0.004043487,0.06125147,0.02337314,0.2723568,0.3333147,0.1556837,0.0005319668,0.1404641],"study_design_scores_gemma":[0.003964395,0.0005440626,0.00004352154,0.002016632,0.000514105,0.04488315,0.006862178,0.8578889,0.07536444,0.0008695278,0.004284169,0.002764938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1083148,0.0007696188,0.8892211,0.0001462504,0.0006534746,0.0002280399,0.0003627335,0.0002247377,0.00007923393],"genre_scores_gemma":[0.7129565,0.00009525957,0.2863628,0.00009397152,0.00007702625,0.00003515057,0.00004128905,0.00003188268,0.0003060794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6046417,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03081097010833498,"score_gpt":0.24837275789465,"score_spread":0.2175617877863151,"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."}}