{"id":"https://openalex.org/W3174340339","doi":"https://doi.org/10.1145/3448016.3461470","title":"Memory-Efficient Search Trees for Database Management Systems","display_name":"Memory-Efficient Search Trees for Database Management Systems","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3174340339","doi":"https://doi.org/10.1145/3448016.3461470","mag":"3174340339"},"language":"en","primary_location":{"id":"doi:10.1145/3448016.3461470","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3461470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-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/A5048293406","display_name":"Huanchen Zhang","orcid":"https://orcid.org/0009-0001-4821-1558"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Huanchen Zhang","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048293406"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09643802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9977999925613403,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9977999925613403,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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.9969000220298767,"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.8698889017105103},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5213780999183655},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.5061203837394714},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.47046148777008057},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4542073607444763},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4427962601184845},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.40480703115463257},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.26777544617652893},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.204603910446167},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.15543583035469055}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8698889017105103},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5213780999183655},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.5061203837394714},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.47046148777008057},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4542073607444763},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4427962601184845},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.40480703115463257},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26777544617652893},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.204603910446167},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.15543583035469055},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3448016.3461470","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3461470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2099185950","https://openalex.org/W1506438023","https://openalex.org/W2161462353","https://openalex.org/W1784146144","https://openalex.org/W2381685168","https://openalex.org/W1602521801","https://openalex.org/W1595151633","https://openalex.org/W1768207225","https://openalex.org/W55474096","https://openalex.org/W4245302940"],"abstract_inverted_index":{"The":[0],"growing":[1],"cost":[2,238],"gap":[3],"between":[4],"DRAM":[5],"and":[6,44,50,85,188,236,241,304],"storage":[7,26],"together":[8],"with":[9,21,234],"increasing":[10],"database":[11,15],"sizes":[12],"means":[13],"that":[14,196,267,278],"management":[16],"systems":[17],"(DBMSs)":[18],"now":[19],"operate":[20,105],"a":[22,58,204,224,263,295],"lower":[23],"memory":[24,64,159,183,201],"to":[25,46,66,104,113,135,141,153,168,194,207,226],"size":[27],"ratio":[28],"than":[29],"before.":[30],"On":[31],"the":[32,62,67,100,108,125,143,200,208,219,229,250,258],"other":[33],"hand,":[34],"modern":[35],"DBMSs":[36],"rely":[37,76],"on":[38,77,107,172,287],"in-memory":[39,96,150],"search":[40,54,73,97,126,151,177,205,279,302],"trees":[41,74,98,127,152,187,280,303],"(e.g.,":[42],"indexes":[43],"filters)":[45],"achieve":[47],"high":[48],"throughput":[49],"low":[51],"latency.":[52],"These":[53,87],"trees,":[55],"however,":[56,89],"consume":[57],"large":[59],"portion":[60],"of":[61,120,124,145,158,182,203,245],"total":[63],"available":[65],"DBMS.":[68],"Existing":[69],"compression":[70,80,171],"techniques":[71,167],"for":[72,95,298],"often":[75],"general-purpose":[78],"block":[79],"algorithms":[81],"such":[82],"as":[83,223],"Snappy":[84],"LZ4.":[86],"algorithms,":[88],"impose":[90],"too":[91],"much":[92],"computational":[93],"overhead":[94],"because":[99,131],"DBMS":[101],"is":[102,128],"unable":[103],"directly":[106,285],"index":[109,221],"data":[110,161,192,232],"without":[111,211],"having":[112],"decompress":[114],"it":[115],"first.":[116],"Simply":[117],"getting":[118],"rid":[119],"all":[121],"or":[122],"part":[123],"also":[129],"suboptimal":[130],"they":[132],"are":[133],"crucial":[134],"query":[136,214],"performance.":[137,215],"This":[138],"dissertation":[139],"seeks":[140],"address":[142],"challenge":[144],"building":[146],"compact":[147],"yet":[148],"fast":[149,173,264],"allow":[154],"more":[155],"efficient":[156],"use":[157],"in":[160,185,239,301,305],"processing":[162],"systems.":[163],"We":[164,179,261],"first":[165],"present":[166],"obtain":[169],"maximum":[170],"static":[174,231],"(i.e.,":[175],"read-optimized)":[176],"trees.":[178],"identified":[180],"sources":[181],"waste":[184],"existing":[186],"designed":[189],"new":[190],"succinct":[191],"structures":[193,233],"show":[195],"we":[197,217,248],"can":[198,268,281],"push":[199],"consumption":[202],"tree":[206],"theoretical":[209],"limit":[210],"compromising":[212],"its":[213],"Next,":[216],"introduce":[218],"hybrid":[220],"architecture":[222],"way":[225],"efficiently":[227],"modifying":[228],"aforementioned":[230],"bounded":[235],"amortized":[237],"performance":[240],"space.":[242],"Finally,":[243],"instead":[244],"structural":[246],"compression,":[247],"approach":[249],"problem":[251],"from":[252],"an":[253],"orthogonal":[254],"direction":[255],"by":[256],"compressing":[257],"actual":[259],"keys.":[260,289],"built":[262],"string":[265],"compressor":[266],"encode":[269],"arbitrary":[270],"input":[271],"keys":[272],"while":[273],"preserving":[274],"their":[275],"order":[276],"so":[277],"serve":[282],"range":[283],"queries":[284],"based":[286],"compressed":[288],"Together,":[290],"these":[291],"three":[292],"pieces":[293],"form":[294],"practical":[296],"recipe":[297],"achieving":[299],"memory-efficiency":[300],"DBMSs.":[306]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}