{"id":"W2614759802","doi":"10.1109/icde.2017.205","title":"Multiple-Query Optimization of Regular Path Queries","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; SPARQL; Path expression; Path (computing); Graph; Query optimization; Query plan; Graph database; Semantic Web; Theoretical computer science; Web search query; Information retrieval; Query language; RDF; Search engine; Sargable; Programming language","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.0001339328,0.00005100865,0.00007098933,0.0000330182,0.000135527,0.0002442212,0.0009565466,0.00001647535,0.00002037525],"category_scores_gemma":[0.00006171456,0.00004245025,0.00002308938,0.00003572692,0.00004721239,0.001493959,0.0004988305,0.00001907345,0.000008779424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003703318,"about_ca_system_score_gemma":0.00000713724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006118142,"about_ca_topic_score_gemma":0.000006012179,"domain_scores_codex":[0.9995318,0.000009707698,0.00009895767,0.0001514566,0.000121098,0.00008697741],"domain_scores_gemma":[0.9989137,0.00001292356,0.000103799,0.0009103363,0.00003814458,0.0000211032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009003436,0.0001543062,0.01192386,0.00007120053,0.00005412346,0.00002556751,0.0003376653,0.007536517,0.00038952,0.7304564,0.01516779,0.233874],"study_design_scores_gemma":[0.0002794694,0.00003075253,0.007514232,0.00001573989,0.000003544706,6.415317e-7,0.00002355051,0.9823065,0.002518873,0.001220721,0.005968424,0.0001175453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006452248,0.00001044488,0.9855856,0.0005157122,0.0001888818,0.00006195496,0.000002265577,0.00006347831,0.01292646],"genre_scores_gemma":[0.2584564,0.00003607921,0.737736,0.00007138547,0.00003778999,0.000003881237,0.00001037417,0.000004105969,0.003643975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.97477,"threshold_uncertainty_score":0.235503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171536464282727,"score_gpt":0.2352155781179188,"score_spread":0.2180619316896461,"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."}}