{"id":"https://openalex.org/W207766014","doi":"https://doi.org/10.1007/978-3-642-40450-4_6","title":"An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters","display_name":"An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W207766014","doi":"https://doi.org/10.1007/978-3-642-40450-4_6","mag":"207766014"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40450-4_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/ws/files/166871881/C265.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Arge","raw_affiliation_strings":["MADALGO, Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["MADALGO, Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011699636","display_name":"Jakob Truelsen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jakob Truelsen","raw_affiliation_strings":["MADALGO, Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037223958","display_name":"Constantinos Tsirogiannis","orcid":"https://orcid.org/0000-0003-2823-6827"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Constantinos Tsirogiannis","raw_affiliation_strings":["MADALGO, Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02754011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9042454957962036},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6397355794906616},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6046435832977295},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4486350417137146},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.394550621509552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38638827204704285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34232157468795776}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9042454957962036},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6397355794906616},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6046435832977295},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4486350417137146},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.394550621509552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38638827204704285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34232157468795776}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-40450-4_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40450-4_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/c7021102-6f5c-48ce-a5f3-d75b19500108","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/c7021102-6f5c-48ce-a5f3-d75b19500108","pdf_url":"https://pure.au.dk/ws/files/166871881/C265.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L, Brodal, G S, Truelsen, J & Tsirogiannis, C 2013, An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. in Algorithms \u2013 ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 8125 , pp. 61-72, European Symposium on Algorithms, Sophia Antipolis, France, 02/09/2013. https://doi.org/10.1007/978-3-642-40450-4_6","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.367","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/~gerth/papers/esa13raster.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/c7021102-6f5c-48ce-a5f3-d75b19500108","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/c7021102-6f5c-48ce-a5f3-d75b19500108","pdf_url":"https://pure.au.dk/ws/files/166871881/C265.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L, Brodal, G S, Truelsen, J & Tsirogiannis, C 2013, An optimal and practical cache-oblivious algorithm for computing multiresolution rasters. in Algorithms \u2013 ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 8125 , pp. 61-72, European Symposium on Algorithms, Sophia Antipolis, France, 02/09/2013. https://doi.org/10.1007/978-3-642-40450-4_6","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324281","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W207766014.pdf","grobid_xml":"https://content.openalex.org/works/W207766014.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1480319329","https://openalex.org/W1514811612","https://openalex.org/W1973081829","https://openalex.org/W2038142281","https://openalex.org/W2052196304","https://openalex.org/W2103836277","https://openalex.org/W2105058098","https://openalex.org/W2109205661","https://openalex.org/W2168938467","https://openalex.org/W2481176883","https://openalex.org/W4240837464"],"related_works":["https://openalex.org/W2147122795","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2268996566","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W2012518269","https://openalex.org/W2068309140","https://openalex.org/W4239937081"],"abstract_inverted_index":{"In":[0,217],"many":[1,12],"scientific":[2],"applications":[3],"it":[4,90,209],"is":[5,86,126,173],"required":[6],"to":[7,22,38,135],"reconstruct":[8],"a":[9,17,29,48,103],"raster":[10,30,49],"dataset":[11,139],"times,":[13],"each":[14,61],"time":[15],"using":[16],"different":[18],"resolution.":[19],"This":[20],"leads":[21],"the":[23,66,69,82,95,99,116,127,137,141,161,164,168,181,186,193],"following":[24],"problem;":[25],"let":[26],"$\\mathcal{G}$":[27,77,85],"be":[28,229],"of":[31,51,63,68,71,76,98,129,163,167,203],"$\\sqrt{N}$":[32,34],"x":[33,55,73],"cells.":[35],"We":[36,101,190],"want":[37],"compute":[39],"for":[40],"every":[41],"integer":[42],"2":[43],"$\\leq":[44],"\\mu":[45],"\\leq":[46],"\\sqrt{N}$":[47],"$\\mathcal{G}_\\mu$":[50,64],"[":[52,56],"$\\sqrt{N}/\\mu$":[53,57],"]":[54,58],"cells":[59,75],"where":[60,84],"cell":[62],"stores":[65],"average":[67],"values":[70],"\u03bc":[72,74],".":[78],"Here":[79],"we":[80,197,206,220],"consider":[81],"case":[83],"so":[87,231],"large":[88],"that":[89,106,132,208,224,232],"does":[91,177],"not":[92,178],"fit":[93],"in":[94,110,120,236],"main":[96,165,187],"memory":[97,166,188],"computer.":[100,169],"present":[102],"novel":[104],"algorithm":[105,151,172,195],"solves":[107],"this":[108,148,153,171,215,218],"problem":[109],"O(scan(N))":[111],"data":[112,182],"block":[113,130,183],"transfers":[114,131],"from/to":[115],"external":[117,142],"memory,":[118],"and":[119,185,196],"\u03b8(N)":[121],"CPU":[122],"operations;":[123],"here":[124],"scan(N)":[125],"number":[128],"are":[133],"needed":[134],"read":[136],"entire":[138],"from":[140],"memory.":[143],"Unlike":[144],"previous":[145,212],"results":[146],"on":[147,160,180,201,214],"problem,":[149],"our":[150],"achieves":[152],"optimal":[154],"performance":[155,176,200],"without":[156],"making":[157],"any":[158],"assumptions":[159],"size":[162,184],"Moreover,":[170],"cache-oblivious;":[174],"its":[175,199],"depend":[179],"size.":[189],"have":[191],"implemented":[192,230],"new":[194],"evaluate":[198],"datasets":[202],"various":[204],"sizes;":[205],"show":[207],"clearly":[210],"outperforms":[211],"approaches":[213],"problem.":[216],"way,":[219],"provide":[221],"solid":[222],"evidence":[223],"non-trivial":[225],"cache-oblivious":[226],"algorithms":[227],"can":[228],"they":[233],"perform":[234],"efficiently":[235],"practice.":[237]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}