{"id":"https://openalex.org/W2117169958","doi":"https://doi.org/10.14778/2732269.2732277","title":"Write-limited sorts and joins for persistent memory","display_name":"Write-limited sorts and joins for persistent memory","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2117169958","doi":"https://doi.org/10.14778/2732269.2732277","mag":"2117169958"},"language":"en","primary_location":{"id":"doi:10.14778/2732269.2732277","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732269.2732277","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/5e01d89c-6d0d-49be-b1c6-8aad98896591","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001088660","display_name":"Stratis D. Viglas","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Stratis D. Viglas","raw_affiliation_strings":["University of Edinburgh, UK","University of Edinburgh (UK)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh (UK)","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001088660"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":10.074,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.98333052,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"7","issue":"5","first_page":"413","last_page":"424"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9984999895095825,"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.884040355682373},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6390948295593262},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5516812801361084},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4477871060371399},{"id":"https://openalex.org/keywords/memory-map","display_name":"Memory map","score":0.42701074481010437},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.4251040816307068},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4197171926498413},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.4159984886646271},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.4104287922382355},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.3467307388782501},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.33512812852859497},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2844463288784027},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27433180809020996},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.2280609905719757},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.22533071041107178},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09646496176719666}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.884040355682373},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6390948295593262},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5516812801361084},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4477871060371399},{"id":"https://openalex.org/C74426580","wikidata":"https://www.wikidata.org/wiki/Q719484","display_name":"Memory map","level":3,"score":0.42701074481010437},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4251040816307068},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4197171926498413},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.4159984886646271},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.4104287922382355},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.3467307388782501},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.33512812852859497},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2844463288784027},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27433180809020996},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.2280609905719757},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.22533071041107178},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09646496176719666},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.14778/2732269.2732277","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732269.2732277","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/5e01d89c-6d0d-49be-b1c6-8aad98896591","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/5e01d89c-6d0d-49be-b1c6-8aad98896591","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Viglas, S 2014, 'Write-limited sorts and joins for persistent memory', Proceedings of the VLDB Endowment (PVLDB), vol. 7, no. 5, pp. 413-424. https://doi.org/10.14778/2732269.2732277","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.407.6544","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.6544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.vldb.org/pvldb/vol7/p413-viglas.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/5e01d89c-6d0d-49be-b1c6-8aad98896591","is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=2732277","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/5e01d89c-6d0d-49be-b1c6-8aad98896591","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/5e01d89c-6d0d-49be-b1c6-8aad98896591","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Viglas, S 2014, 'Write-limited sorts and joins for persistent memory', Proceedings of the VLDB Endowment (PVLDB), vol. 7, no. 5, pp. 413-424. https://doi.org/10.14778/2732269.2732277","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1513366578","https://openalex.org/W1569570229","https://openalex.org/W1828821595","https://openalex.org/W1966427814","https://openalex.org/W1985514943","https://openalex.org/W2006425633","https://openalex.org/W2015477844","https://openalex.org/W2022239314","https://openalex.org/W2035712985","https://openalex.org/W2038619757","https://openalex.org/W2058178853","https://openalex.org/W2063259549","https://openalex.org/W2082317049","https://openalex.org/W2113637091","https://openalex.org/W2114828666","https://openalex.org/W2130301020","https://openalex.org/W2141048674","https://openalex.org/W2150662965","https://openalex.org/W2154249029","https://openalex.org/W2156282657","https://openalex.org/W2157808045","https://openalex.org/W2161047342","https://openalex.org/W2168968494","https://openalex.org/W2229005743","https://openalex.org/W6633958470","https://openalex.org/W6646664084"],"related_works":["https://openalex.org/W55822027","https://openalex.org/W1585393476","https://openalex.org/W2150652612","https://openalex.org/W2363471132","https://openalex.org/W2318923906","https://openalex.org/W2160460528","https://openalex.org/W2096506606","https://openalex.org/W2145484885","https://openalex.org/W2171734863","https://openalex.org/W2096700709"],"abstract_inverted_index":{"To":[0],"mitigate":[1],"the":[2,5,9,60,86,94,104,112,122,127,130,135,139,143,155,177,190],"impact":[3],"of":[4,12,28,47,63,88,97,106,129,142,161,183,194],"widening":[6],"gap":[7],"between":[8],"memory":[10,17,29,35,65,153,207],"needs":[11],"CPUs":[13],"and":[14,99,167,185,192],"what":[15],"standard":[16],"technology":[18,30],"can":[19],"deliver,":[20],"system":[21,123],"architects":[22],"have":[23,165],"introduced":[24],"a":[25,117,200],"new":[26,73],"class":[27],"termed":[31],"persistent":[32,64,152,206],"memory.":[33],"Persistent":[34],"is":[36],"byte-addressable,":[37],"but":[38],"exhibits":[39],"asymmetric":[40],"I/O:":[41],"writes":[42],"are":[43],"typically":[44],"one":[45],"order":[46],"magnitude":[48],"more":[49],"expensive":[50],"than":[51],"reads.":[52],"Byte":[53],"addressability":[54],"combined":[55],"with":[56],"I/O":[57,113],"asymmetry":[58],"render":[59],"performance":[61],"profile":[62,141],"unique.":[66],"Thus,":[67],"it":[68,78],"becomes":[69],"imperative":[70],"to":[71,75,124,137,150],"find":[72],"ways":[74],"seamlessly":[76],"incorporate":[77,151],"into":[79,154,208],"database":[80,156],"systems.":[81],"We":[82,91,102,115,145,164,188],"do":[83],"so":[84],"in":[85,159],"context":[87],"query":[89,209],"processing.":[90,101,210],"focus":[92],"on":[93,180],"fundamental":[95],"operations":[96],"sort":[98],"join":[100],"introduce":[103],"notion":[105],"write-limited":[107],"algorithms":[108,178],"that":[109,120,176],"effectively":[110],"minimize":[111],"cost.":[114],"give":[116],"high-level":[118],"API":[119],"enables":[121],"dynamically":[125],"optimize":[126],"workflow":[128],"algorithms;":[131],"or,":[132],"alternatively,":[133],"allows":[134],"developer":[136],"tune":[138],"write":[140],"algorithms.":[144],"present":[146],"four":[147],"different":[148],"techniques":[149],"processing":[157],"stack":[158],"light":[160],"this":[162],"API.":[163],"implemented":[166],"extensively":[168],"evaluated":[169],"all":[170],"our":[171],"proposals.":[172],"Our":[173],"results":[174],"show":[175],"deliver":[179],"their":[181],"promise":[182],"I/O-minimality":[184],"tunable":[186],"performance.":[187],"showcase":[189],"merits":[191],"deficiencies":[193],"each":[195],"implementation":[196],"technique,":[197],"thus":[198],"taking":[199],"solid":[201],"first":[202],"step":[203],"towards":[204],"incorporating":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}