{"id":"https://openalex.org/W2136129432","doi":"https://doi.org/10.1007/s00453-001-0123-6","title":"Caching for Web Searching","display_name":"Caching for Web Searching","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2136129432","doi":"https://doi.org/10.1007/s00453-001-0123-6","mag":"2136129432"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0123-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0123-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5036642435","display_name":"Bala Kalyanasundaram","orcid":null},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Kalyanasundaram","raw_affiliation_strings":["GEORGETOWN UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"GEORGETOWN UNIVERSITY","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008465806","display_name":"John Noga","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"J. Noga","raw_affiliation_strings":[", Graz University of Technology#TAB#"],"affiliations":[{"raw_affiliation_string":", Graz University of Technology#TAB#","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034212430","display_name":"K. R. Pruhs","orcid":null},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. R. Pruhs","raw_affiliation_strings":["University of Pittsburgh</br>"],"affiliations":[{"raw_affiliation_string":"University of Pittsburgh</br>","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. J. Woeginger","raw_affiliation_strings":["University of Pittsburgh"],"affiliations":[{"raw_affiliation_string":"University of Pittsburgh","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036642435"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22052719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"3","first_page":"353","last_page":"370"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9962999820709229,"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/tree-traversal","display_name":"Tree traversal","score":0.9399219751358032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.78461754322052},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7340645790100098},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6511774659156799},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.576981246471405},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5207531452178955},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5129263401031494},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43647098541259766},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.431990385055542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3648982346057892},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.36387908458709717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30275675654411316},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.278563529253006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1868724226951599},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15013721585273743},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08828526735305786}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9399219751358032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78461754322052},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7340645790100098},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6511774659156799},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.576981246471405},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5207531452178955},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5129263401031494},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43647098541259766},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.431990385055542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3648982346057892},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.36387908458709717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30275675654411316},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.278563529253006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1868724226951599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15013721585273743},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08828526735305786},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00453-001-0123-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0123-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/008b13d2-b8e3-445d-8aa9-09bf40f12f15","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/008b13d2-b8e3-445d-8aa9-09bf40f12f15","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kalyanasundaram, B, Noga, J, Pruhs, K R & Woeginger, G J 2002, 'Caching for web searching', Algorithmica, vol. 33, no. 3, pp. 353-370. https://doi.org/10.1007/s00453-001-0123-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/f1a1fe86-6981-4714-9f51-628ec00e7b3f","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/f1a1fe86-6981-4714-9f51-628ec00e7b3f","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kalyanasundaram, B, Noga, J, Pruhs, K & Woeginger, G 2002, 'Caching for web searching', Algorithmica, vol. 33, no. 3, pp. 353-370. https://doi.org/10.1007/s00453-001-0123-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.8105","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bert.cs.pitt.edu/~kirk/papers/treecaching.ps","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:623757","is_oa":false,"landing_page_url":"http://repository.tue.nl/623757","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:667021","is_oa":false,"landing_page_url":"http://repository.tue.nl/667021","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/008b13d2-b8e3-445d-8aa9-09bf40f12f15","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/008b13d2-b8e3-445d-8aa9-09bf40f12f15","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 33(3), 353 - 370. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W67726002","https://openalex.org/W1586420398","https://openalex.org/W1918432491","https://openalex.org/W1982896842","https://openalex.org/W2041645394","https://openalex.org/W2043344147","https://openalex.org/W2052476895","https://openalex.org/W2065818036","https://openalex.org/W2080258861","https://openalex.org/W2081534862","https://openalex.org/W2089192108","https://openalex.org/W2118168041","https://openalex.org/W3197565351"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082","https://openalex.org/W2136735429"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}