{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002403653,0.00008168528,0.0001339321,0.0001740665,0.0001911122,0.00003696389,0.0003128192,0.00002435624,8.291487e-7],"category_scores_gemma":[0.00003707638,0.0000730094,0.00004202165,0.00028199,0.00006622304,0.0003916904,0.0001007012,0.0001197165,0.000001466211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003952561,"about_ca_system_score_gemma":0.00008853501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004603187,"about_ca_topic_score_gemma":2.903077e-7,"domain_scores_codex":[0.9991305,0.00001960238,0.0004138689,0.0001427993,0.0001996436,0.00009352324],"domain_scores_gemma":[0.9974083,0.0001826488,0.0004396588,0.0001021713,0.001827101,0.00004015738],"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":[0.00001112469,0.00008531703,0.0004420933,0.00000693604,0.0001035019,0.00001086065,0.0005523208,0.00009443333,0.002201022,0.3798352,0.001515922,0.6151412],"study_design_scores_gemma":[0.007082872,0.0008643009,0.01780658,0.0007603543,0.00002885923,0.01041008,0.001040342,0.2661021,0.03145083,0.03942088,0.6236781,0.001354676],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00743243,0.0001342728,0.9911035,0.0006440665,0.0004036116,0.0001312377,0.00002803922,0.0000251856,0.0000975981],"genre_scores_gemma":[0.2348489,0.00004216284,0.7641271,0.0002929436,0.0006023785,0.00001658736,0.00001781149,0.000005703058,0.00004639668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6221622,"threshold_uncertainty_score":0.2977237,"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."}}