{"id":"https://openalex.org/W2037348602","doi":"https://doi.org/10.1145/2367574.2367579","title":"Using TPIE for processing massive data sets in C++","display_name":"Using TPIE for processing massive data sets in C++","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2037348602","doi":"https://doi.org/10.1145/2367574.2367579","mag":"2037348602"},"language":"en","primary_location":{"id":"doi:10.1145/2367574.2367579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2367574.2367579","pdf_url":null,"source":{"id":"https://openalex.org/S27924493","display_name":"SIGSPATIAL Special","issn_l":"1946-7729","issn":["1946-7729"],"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":"SIGSPATIAL Special","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/A5070466932","display_name":"Thomas M\u00f8lhave","orcid":null},"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":true,"raw_author_name":"Thomas M\u00f8lhave","raw_affiliation_strings":["Duke University, Durham, NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070466932"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.13868573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"2","first_page":"24","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9987999796867371,"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.8524552583694458},{"id":"https://openalex.org/keywords/terabyte","display_name":"Terabyte","score":0.843537449836731},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7343907952308655},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.7208739519119263},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.698026180267334},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6914446353912354},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6843377947807312},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5813578367233276},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5811672806739807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49947452545166016},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.49371442198753357},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47776544094085693},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.45768845081329346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3741951286792755},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.24641114473342896},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.23103612661361694},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18678274750709534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8524552583694458},{"id":"https://openalex.org/C199683683","wikidata":"https://www.wikidata.org/wiki/Q8799","display_name":"Terabyte","level":2,"score":0.843537449836731},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7343907952308655},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7208739519119263},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.698026180267334},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6914446353912354},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6843377947807312},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5813578367233276},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5811672806739807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49947452545166016},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.49371442198753357},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47776544094085693},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.45768845081329346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3741951286792755},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.24641114473342896},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.23103612661361694},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18678274750709534},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2367574.2367579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2367574.2367579","pdf_url":null,"source":{"id":"https://openalex.org/S27924493","display_name":"SIGSPATIAL Special","issn_l":"1946-7729","issn":["1946-7729"],"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":"SIGSPATIAL Special","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W76749178","https://openalex.org/W1547409798","https://openalex.org/W1963962287","https://openalex.org/W1970603510","https://openalex.org/W2038142281","https://openalex.org/W2072336782","https://openalex.org/W2098780214","https://openalex.org/W2173213060","https://openalex.org/W3148153833"],"related_works":["https://openalex.org/W1970691969","https://openalex.org/W2617217604","https://openalex.org/W2090747326","https://openalex.org/W2138048993","https://openalex.org/W4230093808","https://openalex.org/W1978757752","https://openalex.org/W2184537587","https://openalex.org/W4242990453","https://openalex.org/W2037348602","https://openalex.org/W2088116875"],"abstract_inverted_index":{"The":[0,17,152,175],"adaptation":[1],"of":[2,34,43,68,98,101,168,189,210,220,229,232,314,323,339],"I/O-efficient":[3,69,233,340],"algorithms":[4,45,70,308,341],"in":[5,71,75,77,148],"commercial":[6],"and":[7,36,46,73,86,131,155,178,184,207,224,227,236,299,330,342],"research":[8],"applications":[9],"can":[10],"be":[11,194],"facilitated":[12],"by":[13],"well-designed":[14],"software":[15,55,343],"libraries.":[16,344],"Templated":[18],"Portable":[19],"I/O":[20],"Environment":[21],"(TPIE)":[22],"[2]":[23],"for":[24,134,266,306,334],"C++":[25,109],"is":[26,123,214,242,319],"one":[27],"such":[28],"library":[29,262],"based":[30],"on":[31,249,285,309],"the":[32,50,66,90,96,102,104,108,141,149,156,166,169,218,239,250,258,286,292,296,321,331],"I/O-model":[33],"Agarwal":[35],"Vitter":[37],"[3].":[38],"TPIE":[39,74,160],"contains":[40],"a":[41,230,247,254,264,335],"number":[42,231],"powerful":[44],"data":[47,61,91,171,234,275],"structures,":[48],"enabling":[49],"user":[51],"to":[52,58,95,173,187,193,197,217,246,273,328],"quickly":[53],"develop":[54],"that":[56,119,270,318],"scales":[57],"very":[59,195,304],"large":[60,274,312],"sets.":[62,276],"Figure":[63],"1":[64],"illustrates":[65],"power":[67],"general":[72],"particular,":[76],"this":[78,324],"case":[79],"using":[80,121],"an":[81,215],"external":[82],"memory":[83,100],"sorting":[84,105,153],"algorithm":[85,106,154],"priority":[87,157],"queue.":[88],"As":[89],"size":[92,167],"grows":[93,172],"close":[94,196],"6GiB":[97],"main":[99,142],"computer,":[103],"from":[107,159],"Standard":[110,199],"Template":[111,200],"Library":[112,201,219],"(STL),":[113],"std::sort,":[114],"slows":[115],"down":[116],"dramatically.":[117],"Beyond":[118],"point":[120],"std::sort":[122],"infeasible":[124],"as":[125,165],"running":[126],"times":[127],"extend":[128],"into":[129,291],"days":[130],"weeks":[132],"even":[133,164],"date":[135],"sizes":[136],"only":[137],"slightly":[138,255],"larger":[139],"than":[140],"memory.":[143],"STL's":[144],"std::priority":[145],"queue":[146,158],"behaves":[147],"same":[150],"way.":[151],"are":[161,303],"well":[162],"behaved,":[163],"input":[170],"terabytes.":[174],"STXXL":[176,191],"[8]":[177],"LEDA-SM":[179,213,240],"[5]":[180],"libraries":[181],"have":[182],"goals":[183],"features":[185],"similar":[186],"those":[188],"TPIE.":[190],"aims":[192],"C++'s":[198],"(STL)":[202],"but":[203,317],"also":[204,271],"offers":[205],"pipe-lining":[206],"some":[208],"usage":[209],"multiple":[211],"cores.":[212],"extension":[216],"Efficient":[221],"Data":[222],"Types":[223],"Algorithms":[225],"(LEDA)":[226],"consists":[228],"structures":[235],"algorithms.":[237],"Unfortunately,":[238],"project":[241,287],"not":[243],"active":[244],"according":[245],"statement":[248],"project's":[251],"website.":[252,288],"On":[253],"different":[256],"level":[257],"cluster-friendly":[259],"FG":[260],"[4]":[261],"provides":[263],"framework":[265],"pipe-line":[267],"structured":[268],"programs":[269],"scale":[272],"A":[277],"significantly":[278],"reworked":[279],"version":[280],"2.0":[281],"has":[282],"been":[283],"announced":[284],"Moving":[289],"further":[290],"distributed":[293],"computing":[294,315],"paradigm,":[295],"MapReduce":[297],"[7]":[298],"Hadoop":[300],"[1]":[301],"frameworks":[302],"popular":[305],"implementing":[307],"clusters":[310],"with":[311],"numbers":[313],"nodes,":[316],"outside":[320],"scope":[322],"article.":[325],"We":[326],"refer":[327],"[10]":[329],"references":[332],"therein":[333],"more":[336],"extensive":[337],"survey":[338]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}