{"id":"W2082076097","doi":"10.1504/ijitcc.2011.042125","title":"Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Tree (set theory); Descendant; Matching (statistics); Ancestor; K-ary tree; Theoretical computer science; Search tree; Set (abstract data type); Tree traversal; Tree structure; Algorithm; Mathematics; Binary tree; Combinatorics; Search algorithm","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.004457454,0.0007736639,0.00142157,0.002417842,0.0006779556,0.002995444,0.002709039,0.00146482,0.003904278],"category_scores_gemma":[0.02215935,0.0003773356,0.0007556698,0.004398049,0.001155828,0.01103424,0.002032863,0.0008993937,0.0007572994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355784,"about_ca_system_score_gemma":0.001570415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777373,"about_ca_topic_score_gemma":0.002086402,"domain_scores_codex":[0.9918329,0.002969559,0.0006184688,0.001022622,0.003022073,0.0005343246],"domain_scores_gemma":[0.9902053,0.006442485,0.0006526037,0.001401518,0.001031864,0.0002660069],"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.001900583,0.0004174147,0.006863754,0.0008632494,0.0001525552,0.0005255659,0.0005638768,0.0859401,0.01285619,0.1352465,0.006287405,0.7483827],"study_design_scores_gemma":[0.00009543484,0.0004270344,0.001419482,0.00005731469,0.00006772269,0.0006588,0.0002938818,0.8431475,0.02050114,0.125011,0.008278423,0.00004227963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07631083,0.001952683,0.9143063,0.0004607777,0.0001066828,0.0002321979,0.0003968572,0.001651401,0.004582236],"genre_scores_gemma":[0.374827,0.0007558173,0.6197481,0.0001654629,0.0001105971,0.0001637968,0.0009983813,0.0004847085,0.002746109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004457454,"threshold_uncertainty_score":0.02357358,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03728276694932228,"score_gpt":0.2923406455522601,"score_spread":0.2550578786029378,"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."}}