{"id":"W2134167127","doi":"10.1002/cpe.756","title":"RF‐MVTC: an efficient risk‐free multiversion concurrency control algorithm","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Optimistic concurrency control; Concurrency control; Database transaction; Concurrency; Focus (optics); Distributed computing; Workstation; Serializability; Transaction processing; Transaction data; Algorithm; Distributed transaction; Distributed concurrency control; Database; Operating system","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.0004390187,0.0002452444,0.0002589154,0.00007821566,0.0006036941,0.0004005151,0.0004571282,0.00009150695,0.000004225006],"category_scores_gemma":[0.0003366444,0.0002307335,0.00004101659,0.0003307257,0.0002260046,0.00221036,0.0001596901,0.0002518424,0.00001581046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004156936,"about_ca_system_score_gemma":0.0001067924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002355534,"about_ca_topic_score_gemma":0.000003023205,"domain_scores_codex":[0.9980111,0.0001676593,0.0003923312,0.0007278832,0.0003754193,0.0003256578],"domain_scores_gemma":[0.9983532,0.0003225123,0.0003666354,0.000371405,0.000321282,0.000264999],"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.00006153846,0.0006170451,0.0004823038,0.00004207315,0.00004072802,0.00007962418,0.03535257,0.006691658,0.0003656294,0.0356855,0.000149257,0.9204321],"study_design_scores_gemma":[0.007943664,0.0008951144,0.004511253,0.0001727059,0.00005999828,0.0003247939,0.008668326,0.9614691,0.000438056,0.003206275,0.01139858,0.0009121032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1287579,0.002013317,0.8672697,0.0004521614,0.0007406884,0.0002872495,0.00004791556,0.0001290887,0.0003020159],"genre_scores_gemma":[0.982069,0.0002894483,0.01719606,0.0003123355,0.00006980202,0.0000363522,0.00001304354,0.000006719525,0.000007283939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547775,"threshold_uncertainty_score":0.9409037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01156203844610375,"score_gpt":0.2916600820033734,"score_spread":0.2800980435572696,"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."}}