{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T06:28:46Z","timestamp":1778048926870,"version":"3.51.4"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113370","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:23:28Z","timestamp":1433345008000},"page":"1227-1238","source":"Crossref","is-referenced-by-count":22,"title":["A comparison of adaptive radix trees and hash tables"],"prefix":"10.1109","author":[{"given":"Victor","family":"Alvarez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Dittrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0873"},{"key":"ref11","article-title":"Google sparse and dense hashes","year":"0","journal-title":"Google Inc"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1195-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.054"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.87"},{"key":"ref15","article-title":"ART implementations","author":"leis","year":"0"},{"key":"ref16","article-title":"STX B+-tree implementation","author":"bingmann","year":"0"},{"key":"ref4","article-title":"Judy arrays","author":"baskins","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"ref6","article-title":"The Art of Computer Programming","volume":"3","author":"knuth","year":"1998","journal-title":"Sorting and Searching"},{"key":"ref5","author":"cormen","year":"1990","journal-title":"Introduction to Algorithms"},{"key":"ref8","first-page":"1","volume":"5757","author":"mitzenmacher","year":"2009","journal-title":"Some Open Questions Related to Cuckoo Hashing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"ref9","article-title":"Murmurhash64a","author":"appleby","year":"0"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","location":"Seoul, South Korea","start":{"date-parts":[[2015,4,13]]},"end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113370.pdf?arnumber=7113370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T15:41:00Z","timestamp":1490370060000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7113370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113370","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}