{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002917829,0.000756026,0.000998608,0.001139804,0.000671235,0.001280908,0.002965712,0.001347165,0.003862098],"category_scores_gemma":[0.008710092,0.0004248113,0.0006169213,0.001090533,0.001117103,0.002071253,0.001983251,0.001646543,0.0008274473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069754,"about_ca_system_score_gemma":0.002357739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00569047,"about_ca_topic_score_gemma":0.003695244,"domain_scores_codex":[0.9981047,0.0004206553,0.0001564399,0.0003777455,0.0007870378,0.0001533735],"domain_scores_gemma":[0.9963942,0.0015335,0.0003525483,0.0008767896,0.000677366,0.0001655604],"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.0005672899,0.0001707059,0.001773382,0.0001746298,0.00008311286,0.0001091799,0.000216699,0.3837042,0.009945182,0.04300274,0.003621087,0.5566317],"study_design_scores_gemma":[0.00006575014,0.00004761006,0.00007056766,0.0000118547,0.00001114155,0.00006301597,0.00001038236,0.9824936,0.003401832,0.01174688,0.002063732,0.00001368562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0064516,0.000181028,0.9911879,0.0001250908,0.00003847148,0.00006451701,0.00002383588,0.001149254,0.0007782508],"genre_scores_gemma":[0.1675583,0.0001152105,0.8299311,0.0001167554,0.00004816128,0.0001444775,0.0001300477,0.0002131511,0.001742911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00569047,"threshold_uncertainty_score":0.01543111,"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."}}