{"id":"W2301455101","doi":"","title":"RF-MVTC: an efficient risk-free multiversion concurrency control algorithm: Research Articles","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; Concurrency; Database transaction; Workstation; Distributed computing; Focus (optics); Serializability; Transaction data; Transactional leadership; Distributed transaction; Transaction processing; Algorithm; 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.001180092,0.0002052586,0.0002310535,0.0001288343,0.0009070372,0.0005366998,0.0005381806,0.00009023588,0.000004419773],"category_scores_gemma":[0.0007425745,0.0001898604,0.00003400587,0.0005777206,0.0003846829,0.002166943,0.0002349261,0.0003818063,0.0000231084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005286212,"about_ca_system_score_gemma":0.0001335852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003311414,"about_ca_topic_score_gemma":0.000005439435,"domain_scores_codex":[0.9974468,0.000362751,0.0003907931,0.0007587189,0.0006070421,0.0004339065],"domain_scores_gemma":[0.997765,0.0006488789,0.0002546581,0.0004243131,0.0006130615,0.0002940851],"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.00008649535,0.000765281,0.000680538,0.00004469861,0.00003402686,0.00008482301,0.05319989,0.00437896,0.0008477554,0.04786354,0.0002176836,0.8917963],"study_design_scores_gemma":[0.007326199,0.001186336,0.006615203,0.0002087616,0.00003665178,0.0002179281,0.02189077,0.9444677,0.0009730493,0.008243443,0.008063271,0.000770739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2939174,0.001819248,0.702538,0.0006464357,0.0004180415,0.0003014671,0.00002820362,0.00009545119,0.0002357553],"genre_scores_gemma":[0.9875392,0.0002897794,0.01187102,0.0001585682,0.00007084337,0.00004935297,0.00000740855,0.000006681993,0.00000717559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9400887,"threshold_uncertainty_score":0.7742282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03735774805963148,"score_gpt":0.3623460408416172,"score_spread":0.3249882927819857,"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."}}