{"id":"https://openalex.org/W3137466223","doi":"https://doi.org/10.1137/s0097539794261817","title":"Optimal Prediction for Prefetching in the Worst Case","display_name":"Optimal Prediction for Prefetching in the Worst Case","publication_year":1998,"publication_date":"1998-12-01","ids":{"openalex":"https://openalex.org/W3137466223","doi":"https://doi.org/10.1137/s0097539794261817","mag":"3137466223"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794261817","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794261817","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1808/18964","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113847855","display_name":"P. Krishnan","orcid":"https://orcid.org/0009-0006-7017-1202"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. Krishnan","raw_affiliation_strings":["101 Crawfords Corner Road, Holmdel, NJ 07733-3030"],"affiliations":[{"raw_affiliation_string":"101 Crawfords Corner Road, Holmdel, NJ 07733-3030","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Dept. of Computer Science, Duke University, Durham, NC 27708-0129"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Duke University, Durham, NC 27708-0129","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113847855"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5331,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.86759834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"27","issue":"6","first_page":"1617","last_page":"1636"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7836987376213074},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7120724320411682},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6929214596748352},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6296914219856262},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4819088280200958},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.46801719069480896},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.45464688539505005},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4536440372467041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43853792548179626},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42871588468551636},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28091275691986084},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.21007627248764038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14248499274253845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13578814268112183}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7836987376213074},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7120724320411682},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6929214596748352},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6296914219856262},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4819088280200958},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.46801719069480896},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.45464688539505005},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4536440372467041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43853792548179626},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42871588468551636},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28091275691986084},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.21007627248764038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14248499274253845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13578814268112183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539794261817","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794261817","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/18964","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/18964","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/7173","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/7173","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:kuscholarworks.ku.edu:1808/18964","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/18964","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1982813377","https://openalex.org/W1987225815","https://openalex.org/W2028002587","https://openalex.org/W2030599258","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2073713788","https://openalex.org/W2075488055","https://openalex.org/W2076610035","https://openalex.org/W2083392624","https://openalex.org/W2088257029","https://openalex.org/W2099111195","https://openalex.org/W2102426343","https://openalex.org/W2116151754","https://openalex.org/W2122962290","https://openalex.org/W2165905239","https://openalex.org/W3137466223","https://openalex.org/W3197565351"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"Response":[0],"time":[1,244],"delays":[2],"caused":[3],"by":[4],"I/O":[5],"are":[6,21],"a":[7,39,56,67,108,127,204,218,225],"major":[8],"problem":[9],"in":[10,29,55,210,217,240],"many":[11],"systems":[12],"and":[13,17,125,261],"database":[14],"applications.":[15],"Prefetching":[16,33],"cache":[18],"replacement":[19],"methods":[20],"attracting":[22],"renewed":[23],"attention":[24],"because":[25],"of":[26,41,103,122,146,158,170,187,206,236,256],"their":[27],"success":[28],"avoiding":[30],"costly":[31],"I/Os.":[32],"can":[34,199],"be":[35,49,200],"looked":[36,201],"upon":[37,202],"as":[38,51,53,107,153,203],"type":[40],"online":[42,62,172,215],"sequential":[43],"prediction,":[44],"where":[45],"the":[46,71,81,105,118,143,156,167,184,188,194,207,233,249],"predictions":[47],"must":[48],"accurate":[50],"well":[52],"made":[54],"computationally":[57],"efficient":[58],"way.":[59],"Unlike":[60],"other":[61],"problems,":[63],"prefetching":[64,89,173],"cannot":[65],"admit":[66],"competitive":[68,208],"analysis,":[69],"since":[70],"optimal":[72,189,241,250],"offline":[73],"prefetcher":[74,192,239],"incurs":[75],"no":[76,151],"cost":[77],"when":[78],"it":[79,212],"knows":[80],"future":[82],"page":[83,139,159,180,247],"requests.":[84],"Previous":[85],"analytical":[86],"work":[87],"on":[88,268],"[.":[90,257],"Vitter":[91],"Krishnan":[92],"1991.]":[93],"[J.":[94],"Assoc.":[95],"Comput.":[96],"Mach.,":[97],"143":[98],"(1996),":[99],"pp.":[100],"771--793]":[101],"consisted":[102],"modeling":[104],"user":[106],"probabilistic":[109],"Markov":[110],"source.":[111],"In":[112],"this":[113],"paper,":[114],"we":[115],"look":[116],"at":[117],"much":[119],"stronger":[120],"form":[121],"worst-case":[123,219],"analysis":[124,197],"derive":[126],"randomized":[128],"algorithm":[129,136,174,216],"for":[130,137,178,193],"pure":[131],"prefetching.":[132],"We":[133,163,230],"compare":[134],"our":[135,171,238],"every":[138,179],"request":[140,181],"sequence":[141,157,182],"with":[142,224],"important":[144],"class":[145],"finite":[147,190],"state":[148,191],"prefetchers,":[149],"making":[150],"assumptions":[152],"to":[154,183],"how":[155],"requests":[160],"is":[161],"generated.":[162],"prove":[164],"analytically":[165],"that":[166,211],"fault":[168,185],"rate":[169,186],"converges":[175],"almost":[176],"surely":[177],"sequence.":[195],"This":[196],"model":[198],"generalization":[205],"framework,":[209],"compares":[213],"an":[214],"manner":[220],"over":[221],"all":[222],"sequences":[223],"powerful":[226],"yet":[227],"nonclairvoyant":[228],"opponent.":[229],"simultaneously":[231],"achieve":[232],"computational":[234],"goal":[235],"implementing":[237],"constant":[242],"expected":[243],"per":[245],"prefetched":[246],"using":[248],"dynamic":[251],"discrete":[252],"random":[253],"variate":[254],"generator":[255],"Matias":[258],"Matias,":[259],"Vitter,":[260],"Ni":[262],"[Proc.":[263],"4th":[264],"Annual":[265],"SIAM/ACM":[266],"Symposium":[267],"Discrete":[269],"Algorithms,":[270],"Austin,":[271],"TX,":[272],"January":[273],"1993].":[274]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}