{"id":"W204411587","doi":"10.1007/978-3-642-40148-0_12","title":"Distributed B-Tree with Weak Consistency","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Consistency (knowledge bases); Tree (set theory); Search engine indexing; B-tree; Cloud computing; Tree structure; R-tree; Data consistency; Distributed computing; Theoretical computer science; Data mining; Algorithm; Binary tree; Information retrieval; Mathematics; Artificial intelligence","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004606405,0.0006107432,0.0005379769,0.0006226047,0.0002749026,0.001328506,0.004834957,0.0001978705,0.00007541069],"category_scores_gemma":[0.00003880175,0.0004739393,0.00009705273,0.0007755839,0.0009247239,0.001463785,0.002188738,0.0006328763,0.0003020195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001824901,"about_ca_system_score_gemma":0.000354643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000341276,"about_ca_topic_score_gemma":0.0000918043,"domain_scores_codex":[0.9958789,0.00002269306,0.0004543071,0.001734382,0.001129069,0.0007806697],"domain_scores_gemma":[0.9969109,0.0002253621,0.0002924671,0.002098501,0.0002579803,0.0002147533],"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.000003428283,0.00003572641,0.00005904956,0.00003650718,0.00002765632,0.0001523692,0.00009657358,0.001917991,0.00001417717,0.1310573,0.000657741,0.8659415],"study_design_scores_gemma":[0.001219907,0.0007345562,0.0006580887,0.001017639,0.00004953169,0.0001920819,7.09769e-7,0.6291683,0.000462969,0.2919011,0.07183316,0.002761981],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008127046,0.0002131986,0.9695238,0.001081946,0.0008533912,0.0004913379,0.00002276396,0.0002515643,0.02755381],"genre_scores_gemma":[0.01602,0.00007050134,0.9767974,0.001749664,0.0005481828,0.00003260199,0.0001036925,0.00006303678,0.004614933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8631795,"threshold_uncertainty_score":0.9997712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01347469837599231,"score_gpt":0.2148360006238306,"score_spread":0.2013613022478383,"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."}}