{"id":"W2142180115","doi":"10.1504/ijica.2008.019686","title":"A bottom-up algorithm for query decomposition","year":2008,"lang":"en","type":"article","venue":"International Journal of Innovative Computing and Applications","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; XPath; Schema (genetic algorithms); Path expression; Path (computing); XML; Algorithm; Query language; Tree (set theory); Materialized view; Query optimization; Decomposition; Set (abstract data type); Theoretical computer science; Data mining; Information retrieval; View; Programming language; XML database; Mathematics","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.001422406,0.002104257,0.001440477,0.002462728,0.001522262,0.002608324,0.002268767,0.001515594,0.01465604],"category_scores_gemma":[0.003758987,0.0009002885,0.001933559,0.002632155,0.0009157778,0.00307448,0.003560756,0.002712926,0.007579533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001148319,"about_ca_system_score_gemma":0.002551655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004434948,"about_ca_topic_score_gemma":0.004947359,"domain_scores_codex":[0.9971678,0.0004006886,0.0002925627,0.0007695721,0.0009914889,0.0003778822],"domain_scores_gemma":[0.9980825,0.0004664075,0.00007062239,0.0005764369,0.0007274202,0.00007651774],"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.0003644737,0.0002576277,0.0007761703,0.0003770646,0.0001014953,0.0001816756,0.0003383498,0.01640994,0.02900087,0.01821366,0.03083052,0.9031482],"study_design_scores_gemma":[0.0002432661,0.0002693949,0.0008627552,0.0001146902,0.0002234248,0.0009487438,0.0004725383,0.7893246,0.05558067,0.06593281,0.08589439,0.0001326616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001760011,0.0001687529,0.9905177,0.0001176109,0.00004999098,0.0002521757,0.0001635349,0.005513704,0.001456561],"genre_scores_gemma":[0.02175981,0.0001123745,0.9738564,0.0001405687,0.00002727508,0.0002182927,0.0008692621,0.0006068854,0.002409035],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01465604,"threshold_uncertainty_score":0.04902935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02080659436761335,"score_gpt":0.3354928541037452,"score_spread":0.3146862597361318,"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."}}