{"id":"W2096195970","doi":"10.1109/cyberc.2010.17","title":"Unordered Tree Matching and Strict Unordered Tree Matching: The Evaluation of Tree Pattern Queries","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Tree (set theory); Search tree; K-ary tree; Matching (statistics); Search engine indexing; Interval tree; XML; Segment tree; Pattern matching; Fractal tree index; Node (physics); B-tree; Theoretical computer science; Tree structure; Algorithm; Combinatorics; Mathematics; Binary tree; Search algorithm; Artificial intelligence","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.003538811,0.0007086759,0.00119409,0.001338849,0.001002476,0.002441037,0.002609266,0.001575977,0.003946061],"category_scores_gemma":[0.01627631,0.0004210695,0.001044836,0.002693212,0.001347964,0.01069365,0.002371699,0.001289735,0.0005302598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193309,"about_ca_system_score_gemma":0.001822856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003085004,"about_ca_topic_score_gemma":0.003666325,"domain_scores_codex":[0.9930964,0.001861257,0.0007580454,0.0009486177,0.002672343,0.0006633661],"domain_scores_gemma":[0.9913294,0.004953187,0.0006464673,0.001620319,0.001070308,0.0003803587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00180068,0.0006937757,0.006375366,0.001321032,0.0001744337,0.001128451,0.0008491385,0.0808977,0.02502388,0.1692538,0.01244891,0.7000328],"study_design_scores_gemma":[0.0001622975,0.000603056,0.00200187,0.0001140803,0.0001081431,0.001342308,0.0006538124,0.7212795,0.04000561,0.2136844,0.01994254,0.0001023777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06618685,0.0009390891,0.9243268,0.0008896146,0.0001544223,0.0005554738,0.0004728097,0.001263501,0.005211364],"genre_scores_gemma":[0.3006625,0.0005058401,0.6927476,0.0004064049,0.0001295894,0.0002935663,0.001156932,0.0004428263,0.003654678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003946061,"threshold_uncertainty_score":0.01871526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02769671764622459,"score_gpt":0.2851073827450467,"score_spread":0.2574106650988221,"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."}}