{"id":"W3008115664","doi":"10.1007/978-3-030-40783-4_18","title":"Linear Hashing Implementations for Flash Memory","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hash function; Computer science; Flash memory; Hash table; Flash (photography); Linear hashing; Search engine indexing; Parallel computing; Universal hashing; Implementation; Memory management; Double hashing; Dynamic perfect hashing; Computer hardware; Semiconductor memory; Programming language; Information retrieval","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.0006320471,0.0006907972,0.0007209692,0.0008203158,0.0007403712,0.002218941,0.002952603,0.0008628342,0.04896321],"category_scores_gemma":[0.00219288,0.0005119765,0.0004612817,0.001995439,0.0006058684,0.003986562,0.002312634,0.0009792312,0.01034763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00128532,"about_ca_system_score_gemma":0.001066622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001474569,"about_ca_topic_score_gemma":0.002685177,"domain_scores_codex":[0.9992356,0.0001241237,0.000073866,0.000105824,0.0002792597,0.0001813301],"domain_scores_gemma":[0.9986563,0.0002724152,0.00005471563,0.0006839666,0.0002831576,0.00004946252],"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.001204401,0.0002584718,0.0008914471,0.0007925735,0.0001062685,0.0001651763,0.0003088191,0.01620923,0.02171249,0.1407728,0.08048318,0.7370952],"study_design_scores_gemma":[0.0006200259,0.0008135115,0.001084137,0.0004234682,0.0001732846,0.0006939744,0.0006569672,0.3401883,0.09532014,0.4045932,0.1552474,0.0001856997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04865126,0.007445051,0.8642209,0.0007037267,0.0008203232,0.0002966731,0.001680221,0.0262385,0.04994335],"genre_scores_gemma":[0.5310347,0.001962087,0.3853815,0.0006236971,0.0003742446,0.0005013003,0.003383367,0.001661355,0.07507763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04896321,"threshold_uncertainty_score":0.1637982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02799625538510061,"score_gpt":0.2597046319881146,"score_spread":0.231708376603014,"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."}}