{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:30Z","timestamp":1779174930666,"version":"3.51.4"},"reference-count":98,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00778-019-00561-0","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:02:45Z","timestamp":1565103765000},"page":"731-754","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Morton filters: fast, compressed sparse cuckoo filters"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5838-7127","authenticated-orcid":false,"given":"Alex D.","family":"Breslow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nuwan S.","family":"Jayasena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"issue":"6","key":"561_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"PS Almeida","year":"2007","unstructured":"Almeida, P.S., Baquero, C., Pregui\u00e7a, N.M., Hutchison, D.: Scalable Bloom filters. Inf. Process. Lett. 101(6), 255\u2013261 (2007)","journal-title":"Inf. Process. Lett."},{"key":"561_CR2","unstructured":"Antoshenkov, G.: Byte-aligned bitmap compression. In DCC, pp. 476 (1995)"},{"key":"561_CR3","unstructured":"Appleby, A.: MurmurHash. https:\/\/sites.google.com\/site\/murmurhash (2008). Accessed 2 May 2018"},{"issue":"1","key":"561_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput. 29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"561_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for a virtual-storage computer. IBM Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"issue":"11","key":"561_CR6","first-page":"1627","volume":"5","author":"MA Bender","year":"2012","unstructured":"Bender, M.A., Farach-Colton, M., Johnson, R., Kraner, R., Kuszmaul, B.C., Medjedovic, D., Montes, P., Shetty, P., Spillane, R.P., Zadok, E.: Don\u2019t thrash: how to cache your hash on flash. PVLDB 5(11), 1627\u20131637 (2012)","journal-title":"PVLDB"},{"issue":"7","key":"561_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. CACM 13(7), 422\u2013426 (1970)","journal-title":"CACM"},{"key":"561_CR8","unstructured":"Boncz, P.A., Manegold, S., Kersten, M.L.: Database architecture optimized for the new bottleneck: memory access. In VLDB, pp. 54\u201365 (1999)"},{"key":"561_CR9","unstructured":"Boncz, P.A., Zukowski, M., Nes, N.: MonetDB\/X100: hyper-pipelining query execution. In CIDR, pp. 225\u2013237 (2005)"},{"key":"561_CR10","first-page":"684","volume":"6","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting Bloom filters. ESA 6, 684\u2013695 (2006)","journal-title":"ESA"},{"key":"561_CR11","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigraphy, R., Singh, S., Varghese, G.: Bloom filters via d-left hashing and dynamic bit reassignment extended abstract. In Allerton, pp. 877\u2013883 (2006)","DOI":"10.1145\/1159913.1159950"},{"key":"561_CR12","unstructured":"Bratbergsengen, K.: Hashing methods and relational algebra operations. In VLDB, pp. 323\u2013333 (1984)"},{"issue":"9","key":"561_CR13","first-page":"1041","volume":"11","author":"A Breslow","year":"2018","unstructured":"Breslow, A., Jayasena, N.: Morton filters: faster, space-efficient cuckoo filters via biasing, compression, and decoupled logical sparsity. PVLDB 11(9), 1041\u20131055 (2018)","journal-title":"PVLDB"},{"key":"561_CR14","unstructured":"Breslow, A.D., Zhang, D.P., Greathouse, J.L., Jayasena, N., Tullsen, D.M.: Horton tables: fast hash tables for in-memory data-intensive computing. In USENIX ATC, pp. 281\u2013294 (2016)"},{"issue":"4","key":"561_CR15","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"AZ Broder","year":"2003","unstructured":"Broder, A.Z., Mitzenmacher, M.: Network applications of Bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2003)","journal-title":"Internet Math."},{"key":"561_CR16","doi-asserted-by":"crossref","unstructured":"Carter, L., Floyd, R., Gill, J., Markowsky, G., Wegman, M.: Exact and approximate membership testers. In STOC, pp. 59\u201365, New York, NY (1978)","DOI":"10.1145\/800133.804332"},{"issue":"5","key":"561_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1002\/spe.2325","volume":"46","author":"S Chambi","year":"2016","unstructured":"Chambi, S., Lemire, D., Kaser, O., Godin, R.: Better bitmap performance with Roaring bitmaps. Softw. Pract. Exp. 46(5), 709\u2013719 (2016)","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"561_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: BigTable: a distributed storage system for structured data. TOCS 26(2), 4 (2008)","journal-title":"TOCS"},{"key":"561_CR19","doi-asserted-by":"crossref","unstructured":"Chen, H., Liao, L., Jin, H., Wu, J.: The dynamic cuckoo filter. In ICNP, pp. 1\u201310 (2017)","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"561_CR20","doi-asserted-by":"crossref","unstructured":"Clark, M.: A new x86 core architecture for the next generation of computing. In Hot Chips, pp. 1\u201319 (2016)","DOI":"10.1109\/HOTCHIPS.2016.7936224"},{"key":"561_CR21","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom filters. In SIGMOD, pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"issue":"16","key":"561_CR22","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ipl.2010.05.018","volume":"110","author":"A Colantonio","year":"2010","unstructured":"Colantonio, A., Pietro, R.D.: Concise: compressed \u2019n\u2019 composable integer set. Inf. Process. Lett. 110(16), 644\u2013650 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"561_CR23","doi-asserted-by":"publisher","first-page":"10283","DOI":"10.1109\/TVT.2017.2718101","volume":"66","author":"J Cui","year":"2017","unstructured":"Cui, J., Zhang, J., Zhong, H., Xu, Y.: SPACF: a secure privacy-preserving authentication scheme for VANET with cuckoo filter. IEEE Trans. Veh. Technol. 66(11), 10283\u201310295 (2017)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"561_CR24","unstructured":"Dean, J., Ghemawat, S.: LevelDB: a fast persistent key-value store. https:\/\/opensource.googleblog.com\/2011\/07\/leveldb-fast-persistent-key-value-store.html , July 27, 2011. Accessed 25 Jan 2017"},{"key":"561_CR25","doi-asserted-by":"crossref","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using Stable Bloom filters. In SIGMOD, pp. 25\u201336 (2006)","DOI":"10.1145\/1142473.1142477"},{"key":"561_CR26","unstructured":"Dong, S., Callaghan, M., Galanis, L., Borthakur, D., Savor, T., Strum, M.: Optimizing space amplification in RocksDB. In CIDR (2017)"},{"key":"561_CR27","unstructured":"Dr. Seuss. Horton Hatches the Egg. Random House (1940)"},{"issue":"4","key":"561_CR28","first-page":"2295","volume":"25","author":"G Einziger","year":"2017","unstructured":"Einziger, G., Friedman, R.: TinySet - an access efficient self adjusting Bloom filter construction. TON 25(4), 2295\u20132307 (2017)","journal-title":"TON"},{"key":"561_CR29","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Mitzenmacher, M., Torres, M.R.: 2-3 cuckoo filters for faster triangle listing and set intersection. In PODS, pp. 247\u2013260 (2017)","DOI":"10.1145\/3034786.3056115"},{"key":"561_CR30","unstructured":"Erlingsson, U., Manasse, M., McSherry, F.: A cool and practical alternative to traditional hash tables. In WDAS (2006)"},{"key":"561_CR31","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M.: MemC3: compact and concurrent memcache with dumber caching and smarter hashing. In NSDI, pp. 371\u2013384 (2013)"},{"key":"561_CR32","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M.: Cuckoo filter. https:\/\/github.com\/efficient\/cuckoofilter , (2017). Accessed 19 Nov 2017"},{"key":"561_CR33","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than Bloom. In CoNEXT, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"3","key":"561_CR34","first-page":"281","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary Cache: a scalable wide-area web cache sharing protocol. TON 8(3), 281\u2013293 (2000)","journal-title":"TON"},{"key":"561_CR35","doi-asserted-by":"crossref","unstructured":"Fisher, R.J., Dietz, H.G.: Compiling for SIMD within a register. In LCPC, pp. 290\u2013304 (1998)","DOI":"10.1007\/3-540-48319-5_19"},{"issue":"9","key":"561_CR36","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"C-21","author":"Michael J. Flynn","year":"1972","unstructured":"Flynn, M.J.: Some computer organizations and their effectiveness. TOC 21(9):948\u2013960 (1972)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"561_CR37","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with 0(1) worst case access time. J. ACM 31(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"561_CR38","volume-title":"The Definitive Guide: Random Access to Your Planet-size Data","author":"L\u00a0George HBase","year":"2011","unstructured":"HBase, L\u00a0George: The Definitive Guide: Random Access to Your Planet-size Data. O\u2019Reilly Media, Inc., New York (2011)"},{"key":"561_CR39","unstructured":"Gonz\u00e1lez, R., Grabowski, S., M\u00e4kinen, V., Navarro, G.: Practical implementation of rank and select queries. In WEA, pp. 27\u201338 (2005)"},{"key":"561_CR40","doi-asserted-by":"crossref","unstructured":"Goodman, J.R.: Using cache memory to reduce processor-memory traffic. In ISCA, pp. 124\u2013131 (1983)","DOI":"10.1145\/1067651.801647"},{"key":"561_CR41","doi-asserted-by":"crossref","unstructured":"Greathouse, J.L., Daga, M.: Efficient sparse matrix-vector multiplication on GPUs using the CSR storage format. In SC, pp. 769\u2013780 (2014)","DOI":"10.1109\/SC.2014.68"},{"key":"561_CR42","doi-asserted-by":"crossref","unstructured":"Grissa, M., Yavuz, A.A., Hamdaoui, B.: Cuckoo filter-based location-privacy preservation in database-driven cognitive radio networks. In WSCNIS, pp. 1\u20137 (2015)","DOI":"10.1109\/WSCNIS.2015.7368280"},{"issue":"1","key":"561_CR43","first-page":"120","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic Bloom filters. TKDE 22(1), 120\u2013133 (2010)","journal-title":"TKDE"},{"key":"561_CR44","doi-asserted-by":"crossref","unstructured":"Guzun, G., Canahuate, G., Chiu, D., Sawin, J.: A tunable compression framework for bitmap indices. In ICDE, pp. 484\u2013495 (2014)","DOI":"10.1109\/ICDE.2014.6816675"},{"key":"561_CR45","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"561_CR46","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In USENIX Security (2019)"},{"key":"561_CR47","doi-asserted-by":"crossref","unstructured":"Kandemir, M., Zhao, H., Tang, X., Karakoy, M.: Memory row reuse distance and its role in optimizing application performance. In SIGMETRICS, pp. 137\u2013149 (2015)","DOI":"10.1145\/2796314.2745867"},{"issue":"8","key":"561_CR48","first-page":"786","volume":"100","author":"PM Kogge","year":"1973","unstructured":"Kogge, P.M., Stone, H.S.: A parallel algorithm for the efficient solution of a general class of recurrence equations. TOC 100(8), 786\u2013793 (1973)","journal-title":"TOC"},{"key":"561_CR49","doi-asserted-by":"crossref","unstructured":"Kornacker, M., Behm, A., Bittorf, V., Bobrovytsky, T., Ching, C., Choi, A., Erickson, J., Grund, M., Hecht, D., Jacobs, M., Joshi, I., Kuff, L., Kumar, D., Leblang, A., Li, N., Pandis, I., Robinson, H., Rorke, D., Rus, S., Russell, J., Tsirogiannis, D., Wanderman-Milne, S., Yoder, M.: Impala: a modern, open-source SQL engine for Hadoop. In CIDR, (2015)","DOI":"10.1007\/978-3-658-11589-0_8"},{"issue":"11","key":"561_CR50","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/356989.357007","volume":"35","author":"John Kubiatowicz","year":"2000","unstructured":"Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S.E., Eaton, P.R., Geels, D., Gummadi, R., Rhea, S.C., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.Y.: . OceanStore: an architecture for global-scale persistent storage. In ASPLOS, pp. 190\u2013201 (2000)","journal-title":"ACM SIGPLAN Notices"},{"key":"561_CR51","doi-asserted-by":"crossref","unstructured":"Kwon, M., Shankar, V., Reviriego, P.: Position-aware cuckoo filters. In ANCS, pp. 151\u2013153 (2018)","DOI":"10.1145\/3230718.3232103"},{"issue":"2","key":"561_CR52","first-page":"35","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. OSR 44(2), 35\u201340 (2010)","journal-title":"OSR"},{"key":"561_CR53","first-page":"502","volume":"12","author":"H lang","year":"2019","unstructured":"lang, H., Neumann, T., Kemper, A., Boncz, P.: Performance-optimal filtering: Bloom overtakes cuckoo at high throughput. PVLDB 12, 502\u2013515 (2019)","journal-title":"PVLDB"},{"key":"561_CR54","unstructured":"Lemire, D.: A fast alternative to the modulo reduction. https:\/\/lemire.me\/blog\/2016\/06\/27\/a-fast-alternative-to-the-modulo-reduction\/ , June 27, (2016). Accessed 07 Jan 2017"},{"key":"561_CR55","doi-asserted-by":"crossref","unstructured":"Li, X., Andersen, D.G., Kaminsky, M., Freedman, M.J.: Algorithmic improvements for fast concurrent cuckoo hashing. In EuroSys, vol 27, pp. 1\u201327:14 (2014)","DOI":"10.1145\/2592798.2592820"},{"key":"561_CR56","unstructured":"Lomont, C.: Introduction to Intel advanced vector extensions. Intel White Paper, pp. 1\u201321 (2011)"},{"issue":"1","key":"561_CR57","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/321992.322000","volume":"24","author":"DB Loveman","year":"1977","unstructured":"Loveman, D.B.: Program improvement by source-to-source transformation. J. ACM 24(1), 121\u2013145 (1977)","journal-title":"J. ACM"},{"key":"561_CR58","doi-asserted-by":"crossref","unstructured":"Luo, L., Guo, D., Rottenstreich, O., Ma, R.T., Luo, X., Ren, B.: The consistent cuckoo filter. In Infocom, (2019)","DOI":"10.1109\/INFOCOM.2019.8737454"},{"key":"561_CR59","doi-asserted-by":"crossref","unstructured":"Mackert, L.F., Lohman, G.M.: R* optimizer validation and performance evaluation for distributed queries. In VLDB, pp. 149\u2013159 (1986)","DOI":"10.1145\/16894.16863"},{"key":"561_CR60","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1186\/1471-2105-12-333","volume":"12","author":"P Melsted","year":"2011","unstructured":"Melsted, P., Pritchard, J.K.: Efficient counting of k-mers in DNA sequences using a Bloom filter. BMC Bioinformatics 12, 333 (2011)","journal-title":"BMC Bioinformatics"},{"key":"561_CR61","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed Bloom filters. In PODC, pp. 144\u2013150 (2001)","DOI":"10.1145\/383962.384004"},{"issue":"10","key":"561_CR62","first-page":"1094","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. TPDPS 12(10), 1094\u20131104 (2001)","journal-title":"TPDPS"},{"key":"561_CR63","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pontarelli, S., Reviriego, P.: Adaptive cuckoo filters. In ALENEX, pp 36\u201347","DOI":"10.1137\/1.9781611975055.4"},{"key":"561_CR64","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, Cambridge (2017)"},{"issue":"1","key":"561_CR65","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1093\/comjnl\/bxx046","volume":"61","author":"W Mula","year":"2018","unstructured":"Mula, W., Kurz, N., Lemire, D.: Faster population counts using AVX2 instructions. Comput. J. 61(1), 111\u2013120 (2018)","journal-title":"Comput. J."},{"key":"561_CR66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures: A Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures: A Practical Approach. Cambridge University Press, Cambridge (2016)"},{"key":"561_CR67","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In Meeting on Algorithm Engineering & Expermiments, pp 60\u201370, (2007)","DOI":"10.1137\/1.9781611972870.6"},{"issue":"4","key":"561_CR68","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"PE O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P.E., Cheng, E., Gawlick, D., O\u2019Neil, E.J.: The Log-Structured Merge-tree (LSM-tree). Acta Inform. 33(4), 351\u2013385 (1996)","journal-title":"Acta Inform."},{"issue":"12","key":"561_CR69","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"DA Padua","year":"1986","unstructured":"Padua, D.A., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. CACM 29(12), 1184\u20131201 (1986)","journal-title":"CACM"},{"issue":"2","key":"561_CR70","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"561_CR71","doi-asserted-by":"crossref","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: A general-purpose counting filter: making every bit count. In SIGMOD, pp. 775\u2013787 (2017)","DOI":"10.1145\/3035918.3035963"},{"key":"561_CR72","doi-asserted-by":"crossref","unstructured":"Pandey, P., Johnson, R.: A general-purpose counting filter: counting quotient filter. https:\/\/github.com\/splatlab\/cqf , (2017). Accessed 11 Sep 2017","DOI":"10.1145\/3035918.3035963"},{"key":"561_CR73","doi-asserted-by":"crossref","unstructured":"Polychroniou, O., Raghavan, A., Ross, K.A.: Rethinking SIMD vectorization for in-memory databases. In SIGMOD, pp. 1493\u20131508 (2015)","DOI":"10.1145\/2723372.2747645"},{"key":"561_CR74","doi-asserted-by":"crossref","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient Bloom filters. JEA, 14 (2009)","DOI":"10.1145\/1498698.1594230"},{"key":"561_CR75","unstructured":"Raman, R. Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In SODA, pp. 233\u2013242 (2002)"},{"issue":"4","key":"561_CR76","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/40.865866","volume":"20","author":"SK Raman","year":"2000","unstructured":"Raman, S.K., Pentkovski, V., Keshava, J.: Implementing streaming SIMD extensions on the Pentium III Processor. IEEE Micro 20(4), 47\u201357 (2000)","journal-title":"IEEE Micro"},{"issue":"13","key":"561_CR77","first-page":"2037","volume":"10","author":"K Ren","year":"2017","unstructured":"Ren, K., Zheng, Q., Arulraj, J., Gibson, G.: SlimDB: a space-efficient key-value storage engine for semi-sorted data. PVLDB 10(13), 2037\u20132048 (2017)","journal-title":"PVLDB"},{"key":"561_CR78","doi-asserted-by":"crossref","unstructured":"Ross, K.A.: Efficient hash probes on modern processors. In Chirkova, R., Dogac, A., \u00d6zsu, M.T., Sellis, T.K. (eds), ICDE, pp.1297\u20131301 (2007)","DOI":"10.1109\/ICDE.2007.368997"},{"issue":"4","key":"561_CR79","first-page":"1092","volume":"22","author":"O Rottenstreich","year":"2014","unstructured":"Rottenstreich, O., Kanizo, Y., Keslassy, I.: The variable-increment counting Bloom filter. TON 22(4), 1092\u20131105 (2014)","journal-title":"TON"},{"key":"561_CR80","doi-asserted-by":"crossref","unstructured":"Sears, R., Ramakrishnan, R.: bLSM: a general purpose Log Structured Merge tree. In SIGMOD, pp. 217\u2013228 (2012)","DOI":"10.1145\/2213836.2213862"},{"key":"561_CR81","doi-asserted-by":"crossref","unstructured":"Seznec, A.: A new case for the TAGE branch predictor. In MICRO, pp. 117\u2013127 (2011)","DOI":"10.1145\/2155620.2155635"},{"key":"561_CR82","unstructured":"Sigaev, T., Korotkov, A., Bartunov, O.: PostgreSQL 10 documentation: F.5. bloom. https:\/\/www.postgresql.org\/docs\/10\/static\/bloom.html (2017). Accessed 25 Jan 2018"},{"key":"561_CR83","doi-asserted-by":"crossref","unstructured":"Singh, T., Rangarajan, S., John, D., Henrion, C., Southard, S., McIntyre, H., Novak, A., Kosonocky, S., Jotwani, R., Schaefer, A., Chang, E., Bell, J., Zen, M.\u00a0Co.: a next-generation high-performance x86 core. ISSCC, pp. 52\u201353 (2017)","DOI":"10.1109\/ISSCC.2017.7870256"},{"key":"561_CR84","unstructured":"Smith, J.E.: A study of branch prediction strategies. In ISCA, pp. 135\u2013148 (1981)"},{"issue":"1","key":"561_CR85","first-page":"125","volume":"2","author":"M Stonebraker","year":"1990","unstructured":"Stonebraker, M., Rowe, L.A., Hirohama, M.: The implementation of POSTGRES. TKDE 2(1), 125\u2013142 (1990)","journal-title":"TKDE"},{"key":"561_CR86","unstructured":"Sun, Y., Hua, Y., Jiang, S., Li, Q., Cao, S., Zuo, P.: SmartCuckoo: a fast and cost-efficient hashing index scheme for cloud storage systems. In USENIX ATC, pp. 553\u2013565 (2017)"},{"issue":"11","key":"561_CR87","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/359168.359175","volume":"22","author":"RE Tarjan","year":"1979","unstructured":"Tarjan, R.E., Yao, A.C.: Storing a sparse table. CACM 22(11), 606\u2013611 (1979)","journal-title":"CACM"},{"issue":"11","key":"561_CR88","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"WF Tinney","year":"1967","unstructured":"Tinney, W.F., Walker, J.W.: Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55(11), 1801\u20131809 (1967)","journal-title":"Proc. IEEE"},{"key":"561_CR89","doi-asserted-by":"crossref","unstructured":"Treibig, J., Hager, G., Wellein, G.: LIKWID: a lightweight performance-oriented tool suite for x86 multicore environments. In ICPPW, pp. 207\u2013216 (2010)","DOI":"10.1109\/ICPPW.2010.38"},{"key":"561_CR90","doi-asserted-by":"crossref","unstructured":"Tullsen, D.M., Eggers, S.J., Emer, J.S., Levy, H.M., Lo, J.L., Stamm, R.L. : Exploiting choice: instruction fetch and issue on an implementable simultaneous multithreading processor. In ISCA, pp. 191\u2013202 (1996)","DOI":"10.1145\/232974.232993"},{"key":"561_CR91","doi-asserted-by":"crossref","unstructured":"Tullsen, D.M., Eggers, S.J., Levy, H.M.: Simultaneous multithreading: maximizing on-chip parallelism. In ISCA, pp. 392\u2013403 (1995)","DOI":"10.1145\/225830.224449"},{"key":"561_CR92","unstructured":"V\u00f6cking, B. How asymmetry helps load balancing. In FOCS, pp. 131\u2013141 (1999)"},{"key":"561_CR93","doi-asserted-by":"crossref","unstructured":"Wang, J., Lin, C., Papakonstantinou, Y., Swanson, S.: An experimental study of bitmap compression vs. inverted list compression. In SIGMOD, pp. 993\u20131008 (2017)","DOI":"10.1145\/3035918.3064007"},{"key":"561_CR94","doi-asserted-by":"crossref","unstructured":"Wolfe, M. More iteration space tiling. In SC, pp. 655\u2013664 (1989)","DOI":"10.1145\/76263.76337"},{"issue":"1","key":"561_CR95","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132863.1132864","volume":"31","author":"K Wu","year":"2006","unstructured":"Wu, K., Otoo, E.J., Shoshani, A.: Optimizing bitmap indices with efficient compression. TODS 31(1), 1\u201338 (2006)","journal-title":"TODS"},{"issue":"1","key":"561_CR96","first-page":"134","volume":"22","author":"M Yoon","year":"2010","unstructured":"Yoon, M.: Aging Bloom filter with two active buffers for dynamic sets. TKDE 22(1), 134\u2013138 (2010)","journal-title":"TKDE"},{"key":"561_CR97","doi-asserted-by":"crossref","unstructured":"Zhang, H., Lim, H., Leis, V., Andersen, D.G., Kaminsky, M., Keeton, K., Pavlo, A.: SuRF: practical range query filtering with fast succinct tries. In SIGMOD (2018)","DOI":"10.1145\/3183713.3196931"},{"issue":"11","key":"561_CR98","first-page":"1226","volume":"8","author":"K Zhang","year":"2015","unstructured":"Zhang, K., Wang, K., Yuan, Y., Guo, L., Lee, R., Zhang, X.: Mega-KV: a case for GPUs to maximize the throughput of in-memory key-value stores. PVLDB 8(11), 1226\u20131237 (2015)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00561-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00561-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00561-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T04:36:53Z","timestamp":1610771813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00561-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":98,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00561-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,6]]},"assertion":[{"value":"1 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}