Researchers have found an algorithm that achieves the provably best-possible<ref name="SuccinctDictionaries">{{cite webconference |url last=https://www.cs.princeton.edu/~hy2/files/dynamic_succinct_dictionary_lower_bound.pdfLi | first=Tianxiao | last2=Liang | first2=Jingxun | last3=Yu | first3=Huacheng | last4=Zhou | first4=Renfei | title=Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries |author publisher=TianxiaoIEEE Li,| Jingxundate=6 Liang,November Huacheng2023 Yu,| andisbn=979-8-3503-1894-4 Renfei| Zhoudoi=10.1109/FOCS57990.2023.00112 | doi-access=free | url=https://arxiv.org/pdf/2306.02253 | access-date=12 February 2025 | page=1842–1862}}</ref> asymptotic performance in terms of time-space tradeoff.<ref>{{cite arXiv
| last1 = Bender
| first1 = Michael
Line 66:
| eprint = 2111.00602
| class = cs
}}</ref> But it remains purely theoretical: "Despite the new hash table’s unprecedented efficiency, no one is likely to try building it anytime soon. It’s just too complicated to construct."<ref name="OptimalBalance">{{cite web | last=Nadis | first=Steve | title=Scientists Find Optimal Balance of Data Storage and Time | website=Quanta Magazine | date=8 February 2024 | url=https://www.quantamagazine.org/scientists-find-optimal-balance-of-data-storage-and-time-20240208/ |title=ScientistsFind Optimal Balance of Data Storage and Time|access-date=812 February 2024 2025}}</ref> and "in practice, constants really matter. In the real world, a factor of 10 is a game ender.”<ref>WilliamKuszmaul, as quoted in {{cite web |urlname=https:"OptimalBalance"//www.quantamagazine.org/scientists-find-optimal-balance-of-data-storage-and-time-20240208/ |title=Scientists Find Optimal Balance of Data Storage and Time|date=8 February 2024 }}</ref>
