{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446893,0.0002504728,0.0003030301,0.0001132353,0.0002882884,0.0001377532,0.0005591533,0.0001400341,0.00005659709],"category_scores_gemma":[0.000112022,0.0001642419,0.00007015002,0.000318517,0.0001437689,0.001056755,0.0003802383,0.0004198076,0.00000780718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002107776,"about_ca_system_score_gemma":0.0001282832,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001929266,"about_ca_topic_score_gemma":0.02039981,"domain_scores_codex":[0.9977778,0.0002646064,0.0004828534,0.0004660627,0.0007093382,0.0002993738],"domain_scores_gemma":[0.9980496,0.0003278965,0.0002862283,0.001027012,0.0002280175,0.00008128077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002166532,0.00007377021,0.001679045,0.00006142814,0.00005802758,0.000003580687,0.005551321,0.000176436,0.01975677,0.1355401,0.000311555,0.8367663],"study_design_scores_gemma":[0.01343948,0.00116628,0.3458083,0.0005921039,0.000499216,0.0004672785,0.02767915,0.2724843,0.05660005,0.2290086,0.04797823,0.004277082],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4307796,0.0001538304,0.5641244,0.0009929941,0.0003826801,0.0003662466,0.00002135774,0.0001072268,0.00307161],"genre_scores_gemma":[0.9680166,0.00002487677,0.03132962,0.0001488631,0.00008432871,0.00004436128,0.00001788037,0.00001766966,0.0003158076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8324893,"threshold_uncertainty_score":0.9974753,"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."}}