{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596465,0.00156181,0.001544197,0.0008175771,0.0007957364,0.002458572,0.00194608,0.001020904,0.002735033],"category_scores_gemma":[0.00552527,0.0006355086,0.00160293,0.001595981,0.001564346,0.003597496,0.002161975,0.00187706,0.0004317099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002204553,"about_ca_system_score_gemma":0.002776509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008217824,"about_ca_topic_score_gemma":0.009994023,"domain_scores_codex":[0.9962053,0.000866317,0.0001891881,0.0007288205,0.001415471,0.000594979],"domain_scores_gemma":[0.9970862,0.001703308,0.0002422659,0.0004741844,0.0003131272,0.0001810089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003593125,0.0002692761,0.00172318,0.0001781436,0.00009899172,0.0001554274,0.0002167011,0.8705576,0.006669228,0.03302196,0.003574761,0.08317532],"study_design_scores_gemma":[0.00003634483,0.0001096924,0.0001947685,0.000008450147,0.00002459657,0.00004463968,0.00008472594,0.973066,0.002795742,0.02227557,0.001346654,0.00001275783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07978179,0.0006375266,0.9092821,0.0005463997,0.00006422085,0.0002457045,0.0004664778,0.002230835,0.006744858],"genre_scores_gemma":[0.4450021,0.0002994135,0.5498627,0.0001925811,0.0000599535,0.0002407262,0.0009073002,0.0007447496,0.00269038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008217824,"threshold_uncertainty_score":0.01633996,"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."}}