{"id":"W4300667769","doi":"10.1007/978-3-031-01885-5_3","title":"Scaling Up: When the Input Exceeds the Main Memory","year":2012,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on data management","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Suffix; String (physics); Computer science; Generalized suffix tree; Suffix tree; Auxiliary memory; Random access; Compressed suffix array; Algorithm; Scaling; Theoretical computer science; Parallel computing; Data structure; Mathematics; Programming language; Computer hardware","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.0008882851,0.001968974,0.001511095,0.001269074,0.001114834,0.003550327,0.001948957,0.00171164,0.03799129],"category_scores_gemma":[0.009914193,0.001058437,0.0006763838,0.001785854,0.001076969,0.01088269,0.00273376,0.002797139,0.01190358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007476987,"about_ca_system_score_gemma":0.000787317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009448716,"about_ca_topic_score_gemma":0.001057872,"domain_scores_codex":[0.9988482,0.00009013501,0.00008861125,0.0002830778,0.0004913422,0.0001987013],"domain_scores_gemma":[0.9951445,0.00175695,0.0002004334,0.001565021,0.001040085,0.0002929023],"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":[0.001706596,0.0003154406,0.004524482,0.001131544,0.00006529636,0.002246024,0.001233944,0.01008386,0.2156731,0.02553831,0.0964426,0.6410387],"study_design_scores_gemma":[0.0001704721,0.0009604744,0.009154959,0.001057567,0.0002528603,0.004044828,0.001782572,0.2011632,0.3984038,0.1258141,0.2569084,0.000286782],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.26718,0.0152972,0.3744177,0.008270953,0.005643741,0.0008659441,0.004919965,0.07909416,0.2443104],"genre_scores_gemma":[0.7630432,0.004249178,0.1140423,0.004016354,0.001789647,0.0006461319,0.003527246,0.01257287,0.09611297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03799129,"threshold_uncertainty_score":0.1270935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04826054880005584,"score_gpt":0.250437980547949,"score_spread":0.2021774317478932,"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."}}