{"id":"https://openalex.org/W2252999964","doi":"https://doi.org/10.1093/comjnl/bxv090","title":"Cache-Sensitive Memory Layout for Dynamic Binary Trees","display_name":"Cache-Sensitive Memory Layout for Dynamic Binary Trees","publication_year":2015,"publication_date":"2015-11-04","ids":{"openalex":"https://openalex.org/W2252999964","doi":"https://doi.org/10.1093/comjnl/bxv090","mag":"2252999964"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxv090","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxv090","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5072344044","display_name":"Riku Saikkonen","orcid":null},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Riku Saikkonen","raw_affiliation_strings":["Department of Computer Science, School of Science, Aalto University,PO Box 15400, FI-00076 Aalto, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, School of Science, Aalto University,PO Box 15400, FI-00076 Aalto, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004458646","display_name":"Eljas Soisalon-Soininen","orcid":"https://orcid.org/0000-0001-6437-2127"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Eljas Soisalon-Soininen","raw_affiliation_strings":["Department of Computer Science, School of Science, Aalto University,PO Box 15400, FI-00076 Aalto, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, School of Science, Aalto University,PO Box 15400, FI-00076 Aalto, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072344044"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.14012872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"59","issue":"5","first_page":"630","last_page":"649"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9976999759674072,"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.9976999759674072,"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.9965999722480774,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955999851226807,"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.805508017539978},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7083587646484375},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5942183136940002},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5913612246513367},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5701927542686462},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5659597516059875},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.49545180797576904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4850105941295624},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4787099361419678},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.45624369382858276},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.444215327501297},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.44060206413269043},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.440591961145401},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.42338865995407104},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.4202101230621338},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.41238778829574585},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.39455264806747437},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.2973954379558563},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.29061269760131836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2791309952735901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12649813294410706}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.805508017539978},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7083587646484375},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5942183136940002},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5913612246513367},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5701927542686462},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5659597516059875},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.49545180797576904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4850105941295624},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4787099361419678},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.45624369382858276},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.444215327501297},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.44060206413269043},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.440591961145401},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.42338865995407104},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.4202101230621338},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.41238778829574585},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.39455264806747437},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.2973954379558563},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.29061269760131836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2791309952735901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12649813294410706},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxv090","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxv090","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:open-archive.highwire.org:comjnl:59/5/630","is_oa":false,"landing_page_url":"http://comjnl.oxfordjournals.org/cgi/content/short/59/5/630","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","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":"TEXT"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W137525769","https://openalex.org/W167982476","https://openalex.org/W1504640095","https://openalex.org/W1510308978","https://openalex.org/W1594881912","https://openalex.org/W1768637848","https://openalex.org/W1801456964","https://openalex.org/W1823000008","https://openalex.org/W1857323784","https://openalex.org/W1900953301","https://openalex.org/W1989622633","https://openalex.org/W1994085050","https://openalex.org/W1996466054","https://openalex.org/W2012714839","https://openalex.org/W2014515453","https://openalex.org/W2017799838","https://openalex.org/W2020018671","https://openalex.org/W2034403022","https://openalex.org/W2038371276","https://openalex.org/W2077180154","https://openalex.org/W2078335579","https://openalex.org/W2083576929","https://openalex.org/W2091829363","https://openalex.org/W2099958087","https://openalex.org/W2105220449","https://openalex.org/W2116730320","https://openalex.org/W2119251905","https://openalex.org/W2123678380","https://openalex.org/W2127241402","https://openalex.org/W2133914707","https://openalex.org/W2137077706","https://openalex.org/W2145148249","https://openalex.org/W2160404300","https://openalex.org/W2168023916","https://openalex.org/W2170101160","https://openalex.org/W2498714246","https://openalex.org/W2621540936","https://openalex.org/W2756860224","https://openalex.org/W2901608006","https://openalex.org/W3023647491","https://openalex.org/W4205806386","https://openalex.org/W6606695403"],"related_works":["https://openalex.org/W1973074590","https://openalex.org/W270522628","https://openalex.org/W4376140277","https://openalex.org/W2130055503","https://openalex.org/W4205700501","https://openalex.org/W115779656","https://openalex.org/W3109340025","https://openalex.org/W2022598760","https://openalex.org/W2083576929","https://openalex.org/W3022865202"],"abstract_inverted_index":{"We":[0,66,115],"use":[1],"cache-sensitive":[2,123],"memory":[3,136],"layouts":[4],"to":[5,29,69],"improve":[6],"search":[7,12,90,107,119],"performance":[8,91],"in":[9,57,61,133],"ordinary":[10],"binary":[11,118],"trees,":[13],"without":[14],"increasing":[15],"the":[16,30,33,36,40,58,62,78,85,89],"time":[17],"complexity":[18],"of":[19,32,39,54,92],"insertion":[20],"or":[21,35],"deletion.":[22],"Our":[23],"approach":[24],"does":[25],"not":[26],"require":[27],"changes":[28],"structure":[31],"nodes":[34,56,132],"rebalancing":[37],"strategy":[38],"tree.":[41],"Cache-sensitivity":[42],"is":[43],"maintained":[44],"with":[45,121],"a":[46,51,112,134],"memory-layout":[47],"invariant":[48,86],"that":[49],"keeps":[50],"given":[52],"number":[53],"neighboring":[55],"tree":[59,79,108,131],"stored":[60],"same":[63],"cache":[64],"block.":[65],"show":[67],"how":[68],"preserve":[70],"it":[71],"using":[72],"worst-case":[73],"constant-time":[74],"operations":[75,109],"executed":[76],"when":[77],"changes.":[80],"In":[81],"our":[82],"extensive":[83],"experiments,":[84],"consistently":[87],"improved":[88],"large":[93],"AVL":[94],"and":[95,125],"red\u2013black":[96],"trees":[97,120],"by":[98],"26\u201332%,":[99],"on":[100],"synthetic":[101],"data":[102],"as":[103,105],"well":[104],"realistic":[106],"extracted":[110],"from":[111],"database":[113],"benchmark.":[114],"also":[116],"compare":[117],"several":[122],"B-trees,":[124],"non-dynamic":[126],"approaches":[127],"for":[128],"laying":[129],"out":[130],"multi-level":[135],"hierarchy.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}