{"id":"https://openalex.org/W3031206277","doi":"https://doi.org/10.1145/3318464.3380583","title":"Order-Preserving Key Compression for In-Memory Search Trees","display_name":"Order-Preserving Key Compression for In-Memory Search Trees","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3031206277","doi":"https://doi.org/10.1145/3318464.3380583","mag":"3031206277"},"language":"en","primary_location":{"id":"doi:10.1145/3318464.3380583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3380583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3380583","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3380583","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015113627","display_name":"Huanchen Zhang","orcid":"https://orcid.org/0009-0000-0786-1004"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huanchen Zhang","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100666863","display_name":"Xiaoxuan Liu","orcid":"https://orcid.org/0000-0002-7503-8359"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoxuan Liu","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085479490","display_name":"David G. Andersen","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Andersen","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052885090","display_name":"Michael Kaminsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Kaminsky","raw_affiliation_strings":["BrdgAI, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"BrdgAI, Pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053422735","display_name":"Kimberly Keeton","orcid":"https://orcid.org/0000-0003-2426-8872"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kimberly Keeton","raw_affiliation_strings":["Hewlett Packard Labs, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Labs, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049165312","display_name":"Andrew Pavlo","orcid":"https://orcid.org/0000-0001-6040-6991"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Pavlo","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5015113627"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.175,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.90091363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1601","last_page":"1615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9987000226974487,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8216094970703125},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5875426530838013},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5650988221168518},{"id":"https://openalex.org/keywords/granularity","display_name":"Granularity","score":0.53504478931427},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5301141738891602},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.5233637094497681},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5045756101608276},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.49959254264831543},{"id":"https://openalex.org/keywords/compression-ratio","display_name":"Compression ratio","score":0.4795232117176056},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.47809693217277527},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.4673462510108948},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.466480553150177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4533218741416931},{"id":"https://openalex.org/keywords/data-compression-ratio","display_name":"Data compression ratio","score":0.442269504070282},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.43241187930107117},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4283485412597656},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.42668455839157104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39477843046188354},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36711227893829346},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2745469808578491},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2084115445613861},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19385340809822083},{"id":"https://openalex.org/keywords/image-compression","display_name":"Image compression","score":0.1922985315322876}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8216094970703125},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5875426530838013},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5650988221168518},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.53504478931427},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5301141738891602},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5233637094497681},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5045756101608276},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.49959254264831543},{"id":"https://openalex.org/C25797200","wikidata":"https://www.wikidata.org/wiki/Q828137","display_name":"Compression ratio","level":3,"score":0.4795232117176056},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.47809693217277527},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.4673462510108948},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.466480553150177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4533218741416931},{"id":"https://openalex.org/C94835093","wikidata":"https://www.wikidata.org/wiki/Q3113333","display_name":"Data compression ratio","level":5,"score":0.442269504070282},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.43241187930107117},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4283485412597656},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.42668455839157104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39477843046188354},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36711227893829346},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2745469808578491},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2084115445613861},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19385340809822083},{"id":"https://openalex.org/C13481523","wikidata":"https://www.wikidata.org/wiki/Q412438","display_name":"Image compression","level":4,"score":0.1922985315322876},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C171146098","wikidata":"https://www.wikidata.org/wiki/Q124192","display_name":"Automotive engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C511840579","wikidata":"https://www.wikidata.org/wiki/Q12757","display_name":"Internal combustion engine","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3318464.3380583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3380583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3380583","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3318464.3380583","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3380583","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3380583","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1316989996","display_name":null,"funder_award_id":"1700521","funder_id":"https://openalex.org/F4320309856","funder_display_name":"National Youth Science Foundation"},{"id":"https://openalex.org/G2816854815","display_name":"SPX: Collaborative Research: Distributed Database Management with Logical Leases and Hardware Transactional Memory","funder_award_id":"1822933","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5849404552","display_name":"CAREER: Self-Driving Database Management Systems","funder_award_id":"1846158","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8300720798","display_name":null,"funder_award_id":"1700521","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309856","display_name":"National Youth Science Foundation","ror":"https://ror.org/054yz2f06"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3031206277.pdf","grobid_xml":"https://content.openalex.org/works/W3031206277.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W114679201","https://openalex.org/W1577196593","https://openalex.org/W1598618182","https://openalex.org/W1963674762","https://openalex.org/W1967601791","https://openalex.org/W1978665131","https://openalex.org/W1985229168","https://openalex.org/W1991223838","https://openalex.org/W2008627910","https://openalex.org/W2018745370","https://openalex.org/W2030062409","https://openalex.org/W2052424404","https://openalex.org/W2054046497","https://openalex.org/W2060108852","https://openalex.org/W2065954102","https://openalex.org/W2076747312","https://openalex.org/W2102729946","https://openalex.org/W2105326258","https://openalex.org/W2108230084","https://openalex.org/W2123686039","https://openalex.org/W2127241402","https://openalex.org/W2129652681","https://openalex.org/W2144361113","https://openalex.org/W2151131744","https://openalex.org/W2155512447","https://openalex.org/W2160404300","https://openalex.org/W2165663045","https://openalex.org/W2295448598","https://openalex.org/W2337480916","https://openalex.org/W2412642011","https://openalex.org/W2429518132","https://openalex.org/W2798418112","https://openalex.org/W2798891709","https://openalex.org/W2799221749","https://openalex.org/W2925562138","https://openalex.org/W2947756274","https://openalex.org/W2950969408","https://openalex.org/W2955799495","https://openalex.org/W3128750954","https://openalex.org/W3138135046"],"related_works":["https://openalex.org/W4200161726","https://openalex.org/W2220381262","https://openalex.org/W2950627147","https://openalex.org/W2566047714","https://openalex.org/W2768628697","https://openalex.org/W2556510984","https://openalex.org/W2487079816","https://openalex.org/W2428232282","https://openalex.org/W1988981363","https://openalex.org/W2362352966"],"abstract_inverted_index":{"We":[0,62,88],"present":[1],"the":[2,39,112],"High-speed":[3],"Order-Preserving":[4],"Encoder":[5],"(HOPE)":[6],"for":[7,133],"in-memory":[8],"search":[9,113],"trees.":[10],"HOPE":[11,90,110],"is":[12,27],"a":[13,34,47,53],"fast":[14],"dictionary-based":[15],"compressor":[16],"that":[17,108],"encodes":[18],"arbitrary":[19],"keys":[20],"while":[21],"preserving":[22],"their":[23],"order.":[24],"HOPE's":[25],"approach":[26],"to":[28,41,56,115,121,129],"identify":[29],"common":[30],"key":[31,136],"patterns":[32],"at":[33],"fine":[35],"granularity":[36],"and":[37,72,85,102,124],"exploit":[38],"entropy":[40],"achieve":[42,116],"high":[43],"compression":[44,67,83],"rates":[45],"with":[46],"small":[48],"dictionary.":[49],"we":[50],"first":[51],"develop":[52],"theoretical":[54],"model":[55,71],"reason":[57],"about":[58],"order-preserving":[59],"dictionary":[60],"designs.":[61],"then":[63],"select":[64],"six":[65],"representative":[66],"schemes":[68,78],"using":[69,109],"this":[70],"implement":[73],"them":[74],"in":[75,96],"HOPE.":[76],"These":[77],"make":[79],"different":[80],"trade-offs":[81],"between":[82],"rate":[84],"encoding":[86],"speed.":[87],"evaluate":[89],"on":[91],"five":[92],"data":[93],"structures":[94],"used":[95],"databases:":[97],"SuRF,":[98],"ART,":[99],"HOT,":[100],"B+tree,":[101],"Prefix":[103],"B+tree.":[104],"Our":[105],"experiments":[106],"show":[107],"allows":[111],"trees":[114],"lower":[117],"query":[118],"latency":[119],"(up":[120,128],"40%":[122],"lower)":[123],"better":[125],"memory":[126],"efficiency":[127],"30%":[130],"smaller)":[131],"simultaneously":[132],"most":[134],"string":[135],"workloads.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}