{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003878982,0.0000792199,0.00007418079,0.00007835812,0.00005528002,0.00006089804,0.001155207,0.00004052969,0.0001408599],"category_scores_gemma":[0.00006748973,0.00006461705,0.00002147617,0.0003204911,0.00005186714,0.0006574229,0.0004858706,0.00008245694,0.0008163166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002223309,"about_ca_system_score_gemma":0.000002697978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001106279,"about_ca_topic_score_gemma":0.00002050242,"domain_scores_codex":[0.9993248,0.000007898049,0.0000870682,0.0002510237,0.0001289377,0.00020027],"domain_scores_gemma":[0.9990246,0.00003965459,0.00002569792,0.0008593185,0.0000185984,0.0000320912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[2.748363e-7,0.00006793067,0.0003213133,0.000002264602,0.0000069322,0.00007843112,0.0001790987,0.0000628881,0.0007869629,0.4384012,0.06893499,0.4911577],"study_design_scores_gemma":[0.0009934563,0.0004065581,0.002724678,0.00002330296,0.000009196813,0.0002988721,0.0002620792,0.2674094,0.04033962,0.1750647,0.5109098,0.001558304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001665879,0.0003507052,0.9649426,0.00197589,0.000142875,0.0000530807,0.000001287991,0.002319496,0.02854815],"genre_scores_gemma":[0.6656832,0.00004371333,0.3305731,0.000350947,0.00001666263,0.000007308843,4.888292e-7,0.000004610512,0.003319988],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6640173,"threshold_uncertainty_score":0.9999617,"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."}}