{"id":"https://openalex.org/W1993116490","doi":"https://doi.org/10.1145/1227161.1370600","title":"Terracost","display_name":"Terracost","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W1993116490","doi":"https://doi.org/10.1145/1227161.1370600","mag":"1993116490"},"language":"en","primary_location":{"id":"doi:10.1145/1227161.1370600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1227161.1370600","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5030632836","display_name":"Thomas Hazel","orcid":null},"institutions":[{"id":"https://openalex.org/I135474949","display_name":"Bowdoin College","ror":"https://ror.org/03gh96r95","country_code":"US","type":"education","lineage":["https://openalex.org/I135474949"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas Hazel","raw_affiliation_strings":["Bowdoin College, Brunswick, ME","Bowdoin College, Brunswick, Me"],"affiliations":[{"raw_affiliation_string":"Bowdoin College, Brunswick, ME","institution_ids":["https://openalex.org/I135474949"]},{"raw_affiliation_string":"Bowdoin College, Brunswick, Me","institution_ids":["https://openalex.org/I135474949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103550036","display_name":"Laura Toma","orcid":null},"institutions":[{"id":"https://openalex.org/I135474949","display_name":"Bowdoin College","ror":"https://ror.org/03gh96r95","country_code":"US","type":"education","lineage":["https://openalex.org/I135474949"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laura Toma","raw_affiliation_strings":["Bowdoin College, Brunswick, ME","Bowdoin College, Brunswick, Me"],"affiliations":[{"raw_affiliation_string":"Bowdoin College, Brunswick, ME","institution_ids":["https://openalex.org/I135474949"]},{"raw_affiliation_string":"Bowdoin College, Brunswick, Me","institution_ids":["https://openalex.org/I135474949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015424474","display_name":"Jan Vahrenhold","orcid":"https://orcid.org/0000-0001-8708-4814"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Vahrenhold","raw_affiliation_strings":["University of Dortmund, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"University of Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008854697","display_name":"Rajiv Wickremesinghe","orcid":null},"institutions":[{"id":"https://openalex.org/I1342911587","display_name":"Oracle (United States)","ror":"https://ror.org/006c77m33","country_code":"US","type":"company","lineage":["https://openalex.org/I1342911587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Wickremesinghe","raw_affiliation_strings":["Oracle USA, Redwood Shores, CA","Oracle USA, Redwood Shores, CA#TAB#"],"affiliations":[{"raw_affiliation_string":"Oracle USA, Redwood Shores, CA","institution_ids":["https://openalex.org/I1342911587"]},{"raw_affiliation_string":"Oracle USA, Redwood Shores, CA#TAB#","institution_ids":["https://openalex.org/I1342911587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030632836"],"corresponding_institution_ids":["https://openalex.org/I135474949"],"apc_list":null,"apc_paid":null,"fwci":2.9721,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90995626,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7622056007385254},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6365580558776855},{"id":"https://openalex.org/keywords/grid-file","display_name":"Grid file","score":0.5960756540298462},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5692475438117981},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5569995045661926},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5235340595245361},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5210849046707153},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.48772796988487244},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.4862138330936432},{"id":"https://openalex.org/keywords/grid-computing","display_name":"Grid computing","score":0.48201289772987366},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4784129559993744},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.44609689712524414},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3977426290512085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25103795528411865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19371888041496277},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1022861897945404},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08960533142089844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7622056007385254},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6365580558776855},{"id":"https://openalex.org/C197148329","wikidata":"https://www.wikidata.org/wiki/Q1546257","display_name":"Grid file","level":4,"score":0.5960756540298462},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5692475438117981},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5569995045661926},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5235340595245361},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5210849046707153},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.48772796988487244},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.4862138330936432},{"id":"https://openalex.org/C70429105","wikidata":"https://www.wikidata.org/wiki/Q249999","display_name":"Grid computing","level":3,"score":0.48201289772987366},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4784129559993744},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.44609689712524414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3977426290512085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25103795528411865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19371888041496277},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1022861897945404},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08960533142089844},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":1,"locations":[{"id":"doi:10.1145/1227161.1370600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1227161.1370600","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W86567484","https://openalex.org/W100509257","https://openalex.org/W119129328","https://openalex.org/W175307687","https://openalex.org/W1480135873","https://openalex.org/W1545429529","https://openalex.org/W1550136763","https://openalex.org/W1556590257","https://openalex.org/W1556717449","https://openalex.org/W1559814459","https://openalex.org/W1574675314","https://openalex.org/W1578737154","https://openalex.org/W1583793915","https://openalex.org/W1598859508","https://openalex.org/W1866249310","https://openalex.org/W1969573308","https://openalex.org/W1982231222","https://openalex.org/W1996805805","https://openalex.org/W2002560134","https://openalex.org/W2007572995","https://openalex.org/W2013480322","https://openalex.org/W2014889099","https://openalex.org/W2020158648","https://openalex.org/W2037688351","https://openalex.org/W2038142281","https://openalex.org/W2046441184","https://openalex.org/W2048824634","https://openalex.org/W2051283794","https://openalex.org/W2057839002","https://openalex.org/W2058846022","https://openalex.org/W2063354603","https://openalex.org/W2065105907","https://openalex.org/W2078443814","https://openalex.org/W2083019227","https://openalex.org/W2083801185","https://openalex.org/W2088116875","https://openalex.org/W2095875205","https://openalex.org/W2096594665","https://openalex.org/W2097224604","https://openalex.org/W2100410715","https://openalex.org/W2106171305","https://openalex.org/W2113276858","https://openalex.org/W2117946984","https://openalex.org/W2127620007","https://openalex.org/W2132111316","https://openalex.org/W2136354771","https://openalex.org/W2138648789","https://openalex.org/W2140591634","https://openalex.org/W2141883265","https://openalex.org/W2145595402","https://openalex.org/W2151400766","https://openalex.org/W2166542580","https://openalex.org/W2169528473","https://openalex.org/W2183491405","https://openalex.org/W2261186745","https://openalex.org/W2762935521","https://openalex.org/W6603528779","https://openalex.org/W6635501409","https://openalex.org/W6681796923"],"related_works":["https://openalex.org/W2133845290","https://openalex.org/W2141073424","https://openalex.org/W3108499833","https://openalex.org/W1570043218","https://openalex.org/W83197933","https://openalex.org/W1776717476","https://openalex.org/W1504340701","https://openalex.org/W2162684709","https://openalex.org/W2467821300","https://openalex.org/W1480518985"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,38,42,75,78,125,134,142,144,156,193,196,199,206,216],"problem":[4],"of":[5,40,53,127,131,136,150,155,195,201,210],"computing":[6,95],"least-cost-path":[7,60,96,213],"surfaces":[8],"for":[9,25,63],"massive":[10],"grid":[11,15,24,61,67],"terrains.":[12],"Consider":[13],"a":[14,22,34,51,59,66,91,173,211],"terrain":[16],"T":[17,26,46,57,64],"and":[18,50,113,138,146,181],"let":[19],"C":[20,32,49],"be":[21,84],"cost":[23,39],"such":[27,68],"that":[28,36,69,82,161,185,187],"every":[29,70],"point":[30,44,71],"in":[31,45,72,80,133,172,215],"stores":[33],"value":[35],"represents":[37,74],"traversing":[41],"corresponding":[43],".":[47],"Given":[48],"set":[52],"sources":[54],"S":[55,81],"\u2208":[56],",":[58],"\u0394":[62,73],"is":[65,101,124,160,205],"distance":[76],"to":[77,94,166],"source":[79],"can":[83],"reached":[85],"with":[86,192],"minimal":[87],"cost.":[88],"We":[89,140,168],"present":[90,141],"scalable":[92],"approach":[93],"grids.":[97],"Our":[98],"algorithm,":[99],"terracost,":[100],"derived":[102],"from":[103],"our":[104,177,202],"previous":[105],"work":[106],"on":[107,111,183],"I/O-efficient":[108],"shortest":[109],"paths":[110],"grids":[112],"uses":[114],"O":[115],"(sort(":[116],"n":[117,122,129],"))":[118],"I/Os,":[119],"where":[120],"sort(":[121],")":[123],"complexity":[126],"sorting":[128],"items":[130],"data":[132],"I/O-model":[135],"Aggarwal":[137],"Vitter.":[139],"design,":[143],"analysis,":[145],"an":[147],"experimental":[148,208],"study":[149],"terracost.":[151],"An":[152],"added":[153],"benefit":[154],"algorithm":[157,214],"underlying":[158],"terracost":[159,171],"it":[162,188],"naturally":[163],"lends":[164],"itself":[165],"parallelization.":[167],"have":[169],"implemented":[170],"distributed":[174],"environment":[175],"using":[176],"cluster":[178],"management":[179],"tool":[180],"report":[182],"experiments":[184],"show":[186],"obtains":[189],"speedup":[190],"near-linear":[191],"size":[194],"cluster.":[197],"To":[198],"best":[200],"knowledge,":[203],"this":[204],"first":[207],"evaluation":[209],"multiple-source":[212],"external":[217],"memory":[218],"setting.":[219]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}