{"id":"W2386452338","doi":"10.1007/s00778-017-0463-8","title":"Efficiently making (almost) any concurrency control mechanism serializable","year":2017,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Serialization; Concurrency control; Serializability; Commit; Transactional memory; Distributed transaction; Online transaction processing; Database transaction","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001528012,0.0001602842,0.0002474114,0.00003965478,0.002172553,0.002331147,0.002955112,0.00005890167,0.00004634498],"category_scores_gemma":[0.0001128854,0.0001021788,0.0001223376,0.00008670208,0.00007901518,0.000682639,0.0002232633,0.0003287914,0.0001068647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004522896,"about_ca_system_score_gemma":0.000117655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001969368,"about_ca_topic_score_gemma":0.000003092251,"domain_scores_codex":[0.9983852,0.0001515489,0.0003532597,0.0002244227,0.000422089,0.0004634875],"domain_scores_gemma":[0.9980624,0.00004835814,0.000594742,0.0009960841,0.0001785225,0.0001198478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000862743,0.0002266769,0.001270347,0.00004915278,0.0002442654,0.0005133927,0.002697316,0.001511713,0.01320363,0.9047236,0.02325962,0.05221404],"study_design_scores_gemma":[0.01326155,0.0008858987,0.01227177,0.001537089,0.0001583169,0.007798666,0.0004756636,0.5847949,0.004713133,0.1022169,0.2699511,0.001935069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01781878,0.000633671,0.966586,0.002983546,0.006035461,0.0002157251,0.00002109186,0.00007057824,0.005635147],"genre_scores_gemma":[0.9978463,0.00002311685,0.0008213299,0.0003065338,0.0005816059,0.000005489957,3.732341e-7,0.00000903691,0.0004061819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9800276,"threshold_uncertainty_score":0.9991265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0182709251801704,"score_gpt":0.2767483095853744,"score_spread":0.258477384405204,"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."}}