{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965537,0.0001639627,0.0002082321,0.000313573,0.0001057176,0.0001026271,0.001580552,0.00003899548,0.000001881325],"category_scores_gemma":[0.00002430929,0.0001196908,0.00009965255,0.00104754,0.00007033838,0.0003583117,0.0008434863,0.0001569637,0.000003664644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006573315,"about_ca_system_score_gemma":0.00001766249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005868349,"about_ca_topic_score_gemma":0.000002254618,"domain_scores_codex":[0.9986173,0.00002153205,0.0003604197,0.0004001899,0.0003042665,0.0002962837],"domain_scores_gemma":[0.9993316,0.00003883923,0.0001708098,0.0003248738,0.00009084031,0.0000430297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001410562,0.0001286369,0.0007256093,0.0002426274,0.00005593995,0.000003599368,0.0003595398,0.0004371203,0.0005267468,0.9937401,0.002189226,0.001576699],"study_design_scores_gemma":[0.005645423,0.0002565696,0.01212565,0.006317487,0.0002066134,0.00004752277,0.006916009,0.02199205,0.05436923,0.8768902,0.01388564,0.001347639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4053853,0.01105051,0.245364,0.02096257,0.01566577,0.01323514,0.0000876646,0.001041573,0.2872075],"genre_scores_gemma":[0.9824629,0.0003383291,0.01471362,0.0003832549,0.00003460333,0.0002816165,0.000001680683,0.000009984426,0.00177397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5770777,"threshold_uncertainty_score":0.4880849,"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."}}