{"id":"W4414078184","doi":"10.14778/3749646.3749706","title":"Robust Recursive Query Parallelism in Graph Database Management Systems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Graph; Variety (cybernetics); Node (physics); Query optimization; Graph database; Parallelism (grammar); Directed acyclic graph; Materialized view","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.003024827,0.000888816,0.0009470288,0.0008402522,0.001020232,0.002106989,0.002900212,0.0009856339,0.001141256],"category_scores_gemma":[0.008354736,0.0006196109,0.0005976301,0.00167203,0.001305049,0.003871286,0.002222569,0.001229937,0.0004045039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783337,"about_ca_system_score_gemma":0.002515005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007743712,"about_ca_topic_score_gemma":0.009581782,"domain_scores_codex":[0.9967492,0.0009958649,0.0002301292,0.0007840532,0.0008305738,0.0004102477],"domain_scores_gemma":[0.996409,0.001333902,0.0003266002,0.00127652,0.0004658258,0.000188106],"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.0007793001,0.0004691369,0.005980574,0.0002733877,0.000130396,0.0002464436,0.0005689008,0.7995254,0.03287367,0.02185501,0.00803037,0.1292675],"study_design_scores_gemma":[0.00005791148,0.0001176695,0.0008444988,0.000006943286,0.00002160806,0.0000590387,0.0001201032,0.9751037,0.007334762,0.01472579,0.001587877,0.00002018428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5050397,0.001455881,0.472182,0.001122149,0.00009980549,0.0003240812,0.00041639,0.01350087,0.005859124],"genre_scores_gemma":[0.8541811,0.0001788311,0.1437016,0.0002311375,0.00002883351,0.0001047305,0.0003740787,0.0003221674,0.0008774039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007743712,"threshold_uncertainty_score":0.01599705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01333158499389208,"score_gpt":0.2147624728128114,"score_spread":0.2014308878189193,"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."}}