{"id":"W1759713541","doi":"10.1007/3-540-45017-3_5","title":"Query Processing and Optimization for Regular Path Expressions","year":2003,"lang":"en","type":"book-chapter","venue":"Notes on numerical fluid mechanics and multidisciplinary design","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Path expression; Path (computing); Joins; Computer science; Expression (computer science); Fast path; Longest path problem; Shortest path problem; Algorithm; XML; Theoretical computer science; Computer network; Programming language; World Wide Web; Graph","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.00399798,0.00129387,0.002596422,0.001830153,0.001227852,0.004642126,0.003084,0.001236484,0.009065959],"category_scores_gemma":[0.01490865,0.001088975,0.001999193,0.004551067,0.002193107,0.007566656,0.00265674,0.002810637,0.002791313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002077192,"about_ca_system_score_gemma":0.002200616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006361193,"about_ca_topic_score_gemma":0.005863512,"domain_scores_codex":[0.993656,0.001421185,0.0007060251,0.0009614458,0.002707604,0.0005478259],"domain_scores_gemma":[0.993923,0.00374433,0.0002490618,0.001219517,0.0007478503,0.0001162047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008402711,0.0002292453,0.0009839066,0.0007280732,0.0001468053,0.0001571425,0.00056601,0.1462172,0.006964947,0.3591102,0.03895469,0.4451016],"study_design_scores_gemma":[0.00007479372,0.00007406843,0.0001906223,0.00003888738,0.00005626237,0.0001105067,0.0001200739,0.6822619,0.005184364,0.2996258,0.01222936,0.00003333006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006840101,0.0008607183,0.9848672,0.0003659884,0.00005805735,0.0001257646,0.0004351792,0.002972246,0.003474711],"genre_scores_gemma":[0.1002761,0.0009942541,0.886466,0.0002448773,0.0001735639,0.0003272782,0.002485625,0.001213146,0.007819219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009065959,"threshold_uncertainty_score":0.03032863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03601621549640222,"score_gpt":0.267240355919982,"score_spread":0.2312241404235797,"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."}}