{"id":"W3116457585","doi":"10.14778/3184470.3184473","title":"Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dataflow; Computer science; Computation; Memory footprint; Joins; Massively parallel; Graph; Parallel computing; Theoretical computer science; Distributed computing; Algorithm","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.005171113,0.001067744,0.001618126,0.0009742317,0.001255654,0.002769422,0.003058501,0.00138872,0.001591856],"category_scores_gemma":[0.0213129,0.0006748031,0.0008730162,0.001336514,0.002922413,0.005713324,0.002883933,0.001259487,0.0003052631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002627685,"about_ca_system_score_gemma":0.002678831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003751612,"about_ca_topic_score_gemma":0.0044871,"domain_scores_codex":[0.9945194,0.00146294,0.000326015,0.001485547,0.00137901,0.0008270432],"domain_scores_gemma":[0.9841303,0.009797818,0.001165257,0.003268433,0.001074188,0.0005639633],"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.001329644,0.0002738374,0.00489978,0.0001403365,0.000114581,0.0001818328,0.0003167517,0.8722506,0.01727868,0.02375092,0.002478688,0.07698438],"study_design_scores_gemma":[0.0000326567,0.00005097751,0.000162164,0.000003465221,0.00001261187,0.00002336297,0.00004155096,0.9792029,0.004240832,0.01601687,0.0002064398,0.000006135807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2922277,0.0004790895,0.6986961,0.00107019,0.00008152809,0.0001807922,0.0002302233,0.00357495,0.003459425],"genre_scores_gemma":[0.8840423,0.000066141,0.1147208,0.0001132869,0.00004586818,0.00009535775,0.0001881284,0.0001899793,0.000538242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005171113,"threshold_uncertainty_score":0.02734774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03065908720145722,"score_gpt":0.2718627820000141,"score_spread":0.2412036947985569,"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."}}