{"id":"W2062189134","doi":"10.1109/wi.2004.2","title":"A Fast Tree Pattern Matching Algorithm for XML Query","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Pattern matching; XML; Matching (statistics); Tree (set theory); Query optimization; Tree decomposition; Algorithm; Theoretical computer science; Data mining; Mathematics; Artificial intelligence; Combinatorics","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.0001094178,0.0001097716,0.0001301878,0.00004247803,0.0001154141,0.00005731548,0.0002554945,0.00002737508,0.000005657981],"category_scores_gemma":[0.00000576091,0.00008754537,0.00005904114,0.00009459679,0.00001651764,0.000736274,0.0001432834,0.00004951209,0.00004030631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003283001,"about_ca_system_score_gemma":0.00004069473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004049456,"about_ca_topic_score_gemma":0.0002687085,"domain_scores_codex":[0.9991702,0.000009380712,0.0001697991,0.0002859825,0.0001271701,0.0002373988],"domain_scores_gemma":[0.9994297,0.00003618897,0.00004928298,0.0003831355,0.00003740705,0.00006429682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[6.924575e-7,0.00002444272,0.00001185606,0.00001574135,0.000007550774,0.00001188885,0.0004049806,0.0001584001,0.0002637128,0.150432,0.0002430453,0.8484257],"study_design_scores_gemma":[0.01148761,0.001263114,0.002186476,0.0009228104,0.00003891254,0.0007463119,0.004067937,0.2703054,0.05169156,0.1488773,0.5041861,0.004226453],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004929027,0.00004537148,0.9973645,0.0004623784,0.0003241074,0.0001800415,0.00003065896,0.0002091764,0.0008908993],"genre_scores_gemma":[0.01271285,0.000004732341,0.9857895,0.0005822206,0.0001539471,0.00005339019,0.0000117888,0.00001080396,0.0006807125],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8441992,"threshold_uncertainty_score":0.3569997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292955493106469,"score_gpt":0.2491634562312508,"score_spread":0.2362339013001861,"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."}}