{"id":"W4246877953","doi":"10.4018/9781931777476.ch015","title":"On the Computation of Recursion in Relational Databases","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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":"Recursion (computer science); Computer science; Relational database; Directed acyclic graph; Graph database; Computation; Graph; Theoretical computer science; Directed graph; Database; Relational database management system; Algorithm; Programming language","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.0001837286,0.0001939923,0.000230909,0.00006551492,0.00005831335,0.000009347277,0.0002901519,0.00008761122,0.00001382664],"category_scores_gemma":[0.00003741682,0.000142078,0.00006772297,0.0000273988,0.00008736658,0.0001391531,0.0002235411,0.0001764757,0.00005365928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000807605,"about_ca_system_score_gemma":0.0001063383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001311229,"about_ca_topic_score_gemma":0.0001046767,"domain_scores_codex":[0.9987975,0.00003615532,0.0003642355,0.000337344,0.0003352299,0.0001295566],"domain_scores_gemma":[0.9988844,0.0001353659,0.0003192192,0.0005442264,0.0000811947,0.00003559946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001671093,0.000007265124,0.000007539556,0.00001671203,0.00000885728,0.00001052851,0.00005854352,0.00004313547,0.000003091541,0.9950762,0.0009059891,0.003845453],"study_design_scores_gemma":[0.0001893256,0.00009125107,0.000151149,0.0009611469,0.000006298083,0.00001648662,0.000005611726,0.0003978227,0.00006219179,0.9570473,0.04083411,0.0002372701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00007213739,0.0001401469,0.2752944,0.00004995089,0.0002912728,0.0002336763,0.0002660874,0.00003608901,0.7236162],"genre_scores_gemma":[0.7261909,0.00005634975,0.1892663,0.001978037,0.0006033867,0.0001022441,0.000308371,0.0001400936,0.08135429],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7261188,"threshold_uncertainty_score":0.5793773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0538388355376816,"score_gpt":0.2674051544660919,"score_spread":0.2135663189284103,"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."}}