{"id":"https://openalex.org/W2010540480","doi":"https://doi.org/10.5555/314464.314575","title":"Optimal prediction for prefetching in the worst case","display_name":"Optimal prediction for prefetching in the worst case","publication_year":1994,"publication_date":"1994-01-23","ids":{"openalex":"https://openalex.org/W2010540480","doi":"https://doi.org/10.5555/314464.314575","mag":"2010540480"},"language":"en","primary_location":{"id":"mag:2010540480","doi":"https://doi.org/10.5555/314464.314575","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/S0097539794261817","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2010540480"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113847855","display_name":"P. Krishnan","orcid":"https://orcid.org/0009-0006-7017-1202","observed_orcids":["https://orcid.org/0009-0006-7017-1202"]},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Krishnan","raw_affiliation_strings":["Department of Computer Science, Brown University, Providence, RI,"],"raw_orcid":"https://orcid.org/0009-0006-7017-1202","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118","observed_orcids":["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#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-7970-6118","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Duke University Durham, NC#TAB#","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8683,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.63225806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"392","last_page":"401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.012799999676644802,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.002199999988079071,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/prefetching","display_name":"prefetching","score":0.949999988079071},{"id":"https://openalex.org/keywords/worst-case-analysis","display_name":"worst-case analysis","score":0.9789999723434448},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.7860000133514404},{"id":"https://openalex.org/keywords/fault-rate","display_name":"fault rate","score":0.7049999833106995},{"id":"https://openalex.org/keywords/i-o-response-time","display_name":"I/O response time","score":0.7400000095367432},{"id":"https://openalex.org/keywords/cache-replacement","display_name":"cache replacement","score":0.7630000114440918}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8239642381668091},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6907554864883423},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6580864191055298},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6451233625411987},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.528114914894104},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5272490382194519},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5176920890808105},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.47019991278648376},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4310623109340668},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.428719162940979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4022529125213623},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22525978088378906},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2181154191493988},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20184257626533508},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1714382767677307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10904005169868469},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"mag:2010540480","doi":"https://doi.org/10.5555/314464.314575","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/pdf/10.1137/S0097539794261817","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.453","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.cse.tamu.edu/jsv/Papers/KrV98.worst-case-prefetchingOfficial.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.5397","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~jsv/Papers/KrV97.worst-case-prefetching.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.5009","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5009","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.duke.edu/pub/pk/Papers/worst-case-prefetching.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.7771","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.duke.edu/pub/dist/techreport/1993/1993-26.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1668373982","https://openalex.org/W1858345456","https://openalex.org/W1987225815","https://openalex.org/W2024047326","https://openalex.org/W2028002587","https://openalex.org/W2041645394","https://openalex.org/W2052993280","https://openalex.org/W2055437997","https://openalex.org/W2060517203","https://openalex.org/W2069162168","https://openalex.org/W2076610035","https://openalex.org/W2083392624","https://openalex.org/W2088257029","https://openalex.org/W2099111195","https://openalex.org/W2099958604","https://openalex.org/W2102426343","https://openalex.org/W2107354725","https://openalex.org/W2116151754","https://openalex.org/W2120465215","https://openalex.org/W2122962290","https://openalex.org/W2125424217","https://openalex.org/W2142901448","https://openalex.org/W2147139455","https://openalex.org/W2165905239","https://openalex.org/W2295016450","https://openalex.org/W2752853835","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3137466223","https://openalex.org/W2146104665","https://openalex.org/W2114664874","https://openalex.org/W2115766048","https://openalex.org/W1502817493","https://openalex.org/W2109850171","https://openalex.org/W46347509","https://openalex.org/W7099540385","https://openalex.org/W4246443526","https://openalex.org/W2017890317"],"abstract_inverted_index":{"Response":[0],"time":[1,240],"delays":[2],"caused":[3],"by":[4],"I/O":[5],"are":[6,21],"a":[7,39,56,67,104,123,200,214,221],"major":[8],"problem":[9],"in":[10,29,55,206,213,236],"many":[11],"systems":[12],"and":[13,17,121,255],"database":[14],"applications.":[15],"Prefetching":[16,33],"cache":[18],"replacement":[19],"methods":[20],"attracting":[22],"renewed":[23],"attention":[24],"because":[25],"of":[26,41,99,118,142,154,166,183,202,232,252],"their":[27],"success":[28],"avoiding":[30],"costly":[31],"I/Os.":[32],"can":[34,195],"be":[35,49,196],"looked":[36,197],"upon":[37,198],"as":[38,51,53,103,149,199],"type":[40],"online":[42,62,168,211],"sequential":[43],"prediction,":[44],"where":[45],"the":[46,71,81,101,114,139,152,163,180,184,190,203,229,245],"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,169],"cannot":[65],"admit":[66],"competitive":[68,204],"analysis,":[69],"since":[70],"optimal":[72,185,237,246],"offline":[73],"prefetcher":[74,188,235],"incurs":[75],"no":[76,147],"cost":[77],"when":[78],"it":[79,208],"knows":[80],"future":[82],"page":[83,135,155,176,243],"requests.":[84],"Previous":[85],"analytical":[86],"work":[87],"on":[88],"[J.":[90],"Assoc.":[91],"Comput.":[92],"Mach.,":[93],"143":[94],"(1996),":[95],"pp.":[96],"771\u2013793]":[97],"consisted":[98],"modeling":[100],"user":[102],"probabilistic":[105],"Markov":[106],"source.":[107],"In":[108],"this":[109],"paper,":[110],"we":[111],"look":[112],"at":[113],"much":[115],"stronger":[116],"form":[117],"worst-case":[119,215],"analysis":[120,193],"derive":[122],"randomized":[124],"algorithm":[125,132,170,212],"for":[126,133,174,189],"pure":[127],"prefetching.":[128],"We":[129,159,226],"compare":[130],"our":[131,167,234],"every":[134,175],"request":[136,177],"sequence":[137,153,178],"with":[138,220],"important":[140],"class":[141],"finite":[143,186],"state":[144,187],"prefetchers,":[145],"making":[146],"assumptions":[148],"to":[150,179],"how":[151],"requests":[156],"is":[157],"generated.":[158],"prove":[160],"analytically":[161],"that":[162,207],"fault":[164,181],"rate":[165,182],"converges":[171],"almost":[172],"surely":[173],"sequence.":[191],"This":[192],"model":[194],"generalization":[201],"framework,":[205],"compares":[209],"an":[210],"manner":[216],"over":[217],"all":[218],"sequences":[219],"powerful":[222],"yet":[223],"nonclairvoyant":[224],"opponent.":[225],"simultaneously":[227],"achieve":[228],"computational":[230],"goal":[231],"implementing":[233],"constant":[238],"expected":[239],"per":[241],"prefetched":[242],"using":[244],"dynamic":[247],"discrete":[248],"random":[249],"variate":[250],"generator":[251],"Matias,":[253],"Vitter,":[254],"Ni":[256],"[Proc.":[257],"4th":[258],"Annual":[259],"SIAM/ACM":[260]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}