[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-341726-105":59,"doc-detail-341726-en":131},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":124,"head_meta":126,"extra_data":128,"updated_unix":130},105,"en","hist-tree-those-who-ignore-it-are-doomed-to-learn","Hist-Tree: Those Who Ignore It Are Doomed to Learn","","Learned indexes offer a new view of indexing and have recently improved over traditional structures, but common explanations focus on pattern adaptation. This work argues the main gains come from implicit assumptions—such as data sortedness and static min/max range—that are not fully exploited by existing comparisons. The paper introduces histogram tree (Hist-Tree) to leverage sortedness and range, plus a compact read-only layout, showing lookup-latency improvements versus multiple leading learned indexes.",{"@graph":69,"@context":123},[70,84,106],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/hist-tree-those-who-ignore-it-are-doomed-to-learn/341726/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/hist-tree-those-who-ignore-it-are-doomed-to-learn/341726.png","ImageObject",300,407,{"name":92,"@type":93},"Ophelia","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-15","2026-09-22",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",11,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"What is the central claim about why learned indexes outperform traditional ones?","Question",{"text":113,"@type":114},"The paper argues the improvements mainly come from leveraging implicit assumptions such as sortedness and static min/max range, rather than from an intrinsic ability to learn and adapt to data patterns.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"What is Hist-Tree and what properties does it exploit?",{"text":118,"@type":114},"Hist-Tree is a new index structure that leverages two basic data properties: sortedness and the range of values.",{"name":120,"@type":111,"acceptedAnswer":121},"How does the read-only assumption affect the proposed design and results?",{"text":122,"@type":114},"Because many state-of-the-art learned indexes assume a read-only workload, the paper presents an optimized compact Hist-Tree layout for this setting, and experiments show reduced lookup latency compared with several top learned indexes.","https://schema.org",{"og:url":83,"og:type":125,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":127,"canonical":83},"index,follow",{"doc_id":129,"site_id":62},341726,1790983295,{"code":4,"msg":5,"data":132},{"doc_id":129,"user_id":133,"nickname":92,"user_avatar":134,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":105,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":29,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":19,"preview_urls":146},7971461741311,"https://ap-avatar.wpscdn.com/avatar/74000253aff267980c6?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779345379180704826","Hist-Tree: Those Who Ignore It Are Doomed to Learn  \nAndrew Crotty  \nBrown University  \n[crottyan@cs.brown.edu](crottyan@cs.brown.edu)  \nABSTRACT  \nLearned indexes have provided a new perspective on the well-studied problem of indexing. Despite early skepticism, recent results have shown signi􀀌cant improvements over traditional data structures. While some have attributed these improvements to an ability to adapt to patterns in the data, we believe that the main advantage of learned indexes comes instead from implicit assumptions (e.g., data sortedness) that are not fully leveraged by the comparison points.  \nIn this paper, we show that, simply by incorporating these same basic assumptions, we can design a traditional data structure capable of outperforming learned alternatives. To make our case, we propose a new index called a histogram tree (Hist-Tree), which takes advantage of the sortedness and range of the data. We also present an optimized compact layout based on the read-only assumption made by many learned indexes. Our experiments demonstrate that, in terms of lookup latency, Hist-Tree can beat three stateof-the-art learned indexes, including RMI, PGM-index, and RadixSpline, by as much as 1.8{2.7􀀂 .  \n1. INTRODUCTION  \nLearned indexes are based on the simple premise that all indexes can be viewed as models. This new way of looking atthe well-studied problem of indexing has created signi􀀌cant buzz and sparked an entire line of follow-up work [8, 4, 7, 16, 11, 5], as well as investigations into other learned system components [12] . While early critiques [17, 2] attempted to demonstrate that learned indexes could not outperform carefully tuned versions of traditional data structures, recent results [15] de􀀌nitively show that learned approaches can beat many well-known indexes (e.g., B-trees, ART [14]) .  \nHowever, we believe that all of these studies unknowingly placed traditional indexes at an unfair disadvantage. Speci􀀌 -cally, learned indexes make several implicit assumptions that are not leveraged by any of the comparison points. For example, many learned indexes assume sorted data, whereas o􀀋-the-shelf B-trees make no such assumption; that is, since B-trees can also handle unsorted data, they will incur unnecessary overhead (e.g., redundant pointers) when the data is actually sorted.  \nOther assumptions commonly made by learned indexes include the minimum and maximum data values (i.e., the  \nThis article is published under a Creative Commons Attribution License ([http://creativecommons.org/licenses/by/3.0/](http://creativecommons.org/licenses/by/3.0/)), which permits distribution and reproduction in any medium as well allowing derivative works, provided that you attribute the original work to the author(s) and CIDR 2021 . 11th Annual Conference on Innovative Data Systems Research (CIDR `21) January 10-13, 2021, Chaminade, USA.  \nrange) and that the data will never be updated (i.e., a readonly workload), both of which provide signi􀀌cant advantages over traditional data structures that do not make these assumptions. In fact, we posit that the reported improvements over traditional indexes come almost entirely from leveraging these implicit assumptions rather than any unique ability to learn and adapt to patterns in the data.  \nThe goal of this paper is to show that a traditional data structure can actually outperform a learned index simply by taking advantage of these same basic assumptions. To make our case, we developed a new index called a histogram tree (Hist-Tree) that leverages two very simple properties of the data: (1) sortedness and (2) the range. Additionally, since many state-of-the-art learned indexes (e.g. , RMI [13], RadixSpline [11]) assume a read-only workload, we also present a compact Hist-Tree layout optimized for this property. Our experiments show that Hist-Tree can achieve lookup latency reductions of up to 1.8{2.7􀀂 over three state-of-the-art learned indexes, including RMI, PGMindex, and RadixSpl","cbCaimKKKGpCUDyd","https://ap.wps.com/l/cbCaimKKKGpCUDyd","pdf",420209,"English","# Abstract\n# 1. Introduction\n# 2. Background\n## 2.1 Learned Index Definition","[{\"question\":\"What is the central claim about why learned indexes outperform traditional ones?\",\"answer\":\"The paper argues the improvements mainly come from leveraging implicit assumptions such as sortedness and static min/max range, rather than from an intrinsic ability to learn and adapt to data patterns.\"},{\"question\":\"What is Hist-Tree and what properties does it exploit?\",\"answer\":\"Hist-Tree is a new index structure that leverages two basic data properties: sortedness and the range of values.\"},{\"question\":\"How does the read-only assumption affect the proposed design and results?\",\"answer\":\"Because many state-of-the-art learned indexes assume a read-only workload, the paper presents an optimized compact Hist-Tree layout for this setting, and experiments show reduced lookup latency compared with several top learned indexes.\"}]","Hist-Tree: Those Who Ignore It Are Doomed to Learn | PDF",1790043400,15,[147,151,155,159],{"page_no":8,"url":148,"width":149,"height":150},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/2477bf47be3e24ef61a321792e5df641.webp",983,1272,{"page_no":14,"url":152,"width":153,"height":154},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/88db4f15dfe1b983b2f403e4c6bc139e.webp",982,1270,{"page_no":81,"url":156,"width":157,"height":158},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/59cd543019c95f4fbf52b82ed78bae18.webp",981,1269,{"page_no":19,"url":160,"width":161,"height":162},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-16/344f3986ce52f31e24a2caa5d401ed7a.webp",980,1268]