{"id":"W2098130516","doi":"10.1109/sfcs.2000.892128","title":"Cache-oblivious B-trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block size; Data structure; Auxiliary memory; Binary logarithm; B-tree; Computer science; Parallel computing; Tree (set theory); Combinatorics; Upper and lower bounds; Block (permutation group theory); Memory hierarchy; Cache; Cache-oblivious algorithm; Amortized analysis; CPU cache; Mathematics; Key (lock); Cache algorithms; 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.0006371481,0.0003827591,0.0006730439,0.0008464757,0.0009511291,0.001116675,0.002861139,0.000768054,0.004089812],"category_scores_gemma":[0.003906539,0.0004047725,0.0003836925,0.00288225,0.0007964794,0.003440111,0.001747577,0.0009417026,0.001669515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009854725,"about_ca_system_score_gemma":0.001450484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002454863,"about_ca_topic_score_gemma":0.003818288,"domain_scores_codex":[0.9991817,0.0001561062,0.00007489106,0.0001449453,0.0002988694,0.0001435023],"domain_scores_gemma":[0.9972702,0.000623895,0.0002923635,0.001100301,0.0005636752,0.0001496848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001857301,0.0005194189,0.005538577,0.0007866336,0.0001812456,0.0003095118,0.000562566,0.1946409,0.04180998,0.2059423,0.05919277,0.4886589],"study_design_scores_gemma":[0.0003538324,0.0009903738,0.001815298,0.0001230558,0.0001758225,0.0007254144,0.0002117051,0.643644,0.05274585,0.2026552,0.09645636,0.0001030899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.198713,0.004214924,0.7617259,0.001268617,0.0002068215,0.0002959619,0.00267986,0.007735371,0.02315964],"genre_scores_gemma":[0.5025125,0.001162425,0.4770633,0.0006246732,0.0001191357,0.0003613623,0.003715605,0.0005728993,0.01386804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004089812,"threshold_uncertainty_score":0.01368177,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02711836908716011,"score_gpt":0.2341770090695675,"score_spread":0.2070586399824074,"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."}}