{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002577861,0.0007091532,0.0009663113,0.0009964112,0.0006749926,0.001263756,0.003086684,0.001295091,0.003586713],"category_scores_gemma":[0.007648019,0.0004365258,0.0006601241,0.000819125,0.001085586,0.001761297,0.002422616,0.001450025,0.0007368005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072051,"about_ca_system_score_gemma":0.002495255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006101005,"about_ca_topic_score_gemma":0.003576883,"domain_scores_codex":[0.9981971,0.0004033571,0.0001367993,0.0003403475,0.0007176956,0.0002046508],"domain_scores_gemma":[0.9967377,0.001333038,0.0002960417,0.0008140563,0.000659446,0.0001596637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005482157,0.0001398436,0.001093085,0.00009281992,0.00005983921,0.0001323673,0.0001776399,0.5933908,0.007813005,0.0439714,0.003417823,0.3491633],"study_design_scores_gemma":[0.0000551689,0.00002947776,0.00003433384,0.000004313257,0.000005489025,0.00002540885,0.000007346431,0.9897049,0.001591495,0.007751261,0.0007831057,0.000007693649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081553,0.00007864264,0.9863086,0.000112325,0.00003539756,0.0000702676,0.00002864078,0.001472785,0.001077742],"genre_scores_gemma":[0.2970352,0.00004720149,0.7002592,0.0001098828,0.00003617263,0.000193082,0.0001434415,0.0002053778,0.001970485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006101005,"threshold_uncertainty_score":0.01363319,"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."}}