Cuckoo Filter: Practically Better Than Bloom
The DOI matches its Crossref record; 28 of the 30 references it cites were found in a registry or an index.
Abstract
In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false positive answers with very good space efficiency. However, they do not permit deletion of items from the set, and previous attempts to extend "standard" Bloom filters to support deletion all degrade either space or performance.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Self-citationSummary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Pagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
The Power of Two Random Choices: A Survey of Techniques and Results
Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001) · Combinatorial Optimization · doi:10.1007/978-1-4615-0013-1_9 · Cited by 431
Self-citationSummary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285287 · Cited by 422
An Improved Construction for Counting Bloom Filters
Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., & Varghese, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841036_61 · Cited by 383
Self-citationFast hash table lookup using extended bloom filter: an aid to network processing
Song, H., Dharmapurikar, S., Turner, J., & Lockwood, J. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080114 · Cited by 328
The Bloomier filter: an efficient data structure for static support lookup tables
Chazelle, B., Kilian, J., Rubinfeld, R., & Tal, A. (2004) · doi:10.5555/982792.982797 · Cited by 327
Research works printed but not linked: 3
- 10.5555/2133036.2133129 · doi:10.5555/2133036.2133129
- 10.1002/rsa.v33:2 · doi:10.1002/rsa.v33:2
- 10.5555/1768570.1768582 · doi:10.5555/1768570.1768582
Cited by
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
Elastic sketch: adaptive and fast network-wide measurements
Yang, T., Jiang, J., Liu, P., Huang, Q., Gong, J., Zhou, Y., Miao, R., Li, X., & Uhlig, S. (2018) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3230543.3230544 · Cited by 725
A Survey of COVID-19 Contact Tracing Apps
Ahmed, N., Michelin, R. A., Xue, W., Ruj, S., Malaney, R., Kanhere, S. S., Seneviratne, A., Hu, W., Janicke, H., & Jha, S. K. (2020) · IEEE Access · doi:10.1109/access.2020.3010226 · Cited by 582
SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs
Miao, R., Zeng, H., Kim, C., Lee, J., & Yu, M. (2017) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3098822.3098824 · Cited by 525
SPACF: A Secure Privacy-Preserving Authentication Scheme for VANET With Cuckoo Filter
Cui, J., Zhang, J., Zhong, H., & Xu, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2718101 · Cited by 248
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
Luo, L., Guo, D., Ma, R. T. B., Rottenstreich, O., & Luo, X. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2889329 · Cited by 238
An Efficient Message-Authentication Scheme Based on Edge Computing for Vehicular Ad Hoc Networks
Cui, J., Wei, L., Zhang, J., Xu, Y., & Zhong, H. (2019) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2018.2827460 · Cited by 233
A General-Purpose Counting Filter: Making Every Bit Count
Pandey, P., Bender, M. A., Johnson, R., & Patro, R. (2017) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3035918.3035963 · Cited by 203
SONG: Approximate Nearest Neighbor Search on GPU
Zhao, W., Tan, S., & Li, P. (2020) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00094 · Cited by 197
LSM-based storage techniques: a survey
Luo, C., & Carey, M. J. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00555-y · Cited by 190
SDN-Enabled Multi-Attribute-Based Secure Communication for Smart Grid in IIoT Environment
Chaudhary, R., Aujla, G. S., Garg, S., Kumar, N., & Rodrigues, J. J. P. C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2789442 · Cited by 186
Edge Computing in VANETs-An Efficient and Privacy-Preserving Cooperative Downloading Scheme
Cui, J., Wei, L., Zhong, H., Zhang, J., Xu, Y., & Liu, L. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2986617 · Cited by 179
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
Graf, T. M., & Lemire, D. (2020) · ACM Journal of Experimental Algorithmics · doi:10.1145/3376122 · Cited by 179
Mobile Private Contact Discovery at Scale
Kales, D., Rechberger, C., Schneider, T. H., Senker, M., & Weinert, C. (2019) · TUbilio (Technical University of Darmstadt) · Cited by 176
Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication
Cong, K., Moreno, R. C., da Gama, M. B., Dai, W., Iliashenko, I., Laine, K., & Rosenberg, M. L. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484760 · Cited by 170
A Survey on Concept Drift in Process Mining
Sato, D. M. V., de Freitas, S. C., Barddal, J. P., & Scalabrin, E. E. (2021) · ACM Computing Surveys · doi:10.1145/3472752 · Cited by 161
Rapid species-level metagenome profiling and containment estimation with sylph
Shaw, J., & Yu, Y. W. (2024) · Nature Biotechnology · doi:10.1038/s41587-024-02412-y · Cited by 146
SlimDB: a space-efficient key-value storage engine for semi-sorted data
Ren, K., Zheng, Q., Arulraj, J. J. P., & Gibson, G. A. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3151106.3151108 · Cited by 141
Demystifying COVID-19 Digital Contact Tracing: A Survey on Frameworks and Mobile Apps
Martin, T., Καρόπουλος, Γ., Hernández-Ramos, J. L., Kambourakis, G., & Fovino, I. N. (2020) · Wireless Communications and Mobile Computing · doi:10.1155/2020/8851429 · Cited by 135
CRLite: A Scalable System for Pushing All TLS Revocations to All Browsers
Larisch, J., Choffnes, D., Levin, D., Maggs, B. M., Mislove, A. E., & Wilson, C. (2017) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2017.17 · Cited by 133
Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores
Luo, S., Chatterjee, S., Ketsetsidis, R., Dayan, N., Qin, W., & Idreos, S. (2020) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3318464.3389731 · Cited by 127
A Model for Learned Bloom Filters, and Optimizing by SandwichingPreprint
Mitzenmacher, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.00902 · Cited by 127
Self-citationWei, L., Cui, J., Zhong, H., Bolodurina, I. P., & Liu, L. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3135016 · Cited by 119
FINEdex: a fine-grained learned index scheme for scalable and concurrent memory systems
Li, P., Hua, Y., Jia, J., & Zuo, P. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3489496.3489512 · Cited by 119
Graphene: efficient interactive set reconciliation applied to blockchain propagation
Ozisik, A. P., Andresen, G., Levine, B. N., Tapp, D., Bissias, G. D., & Katkuri, S. (2019) · ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342082 · Cited by 109
Zhang, S., Wang, L., & Xiong, H. (2019) · International Journal of Information Security · doi:10.1007/s10207-019-00465-8 · Cited by 109
Private set intersection: A systematic literature review
Morales, D., Agudo, I., & López, J. (2023) · Computer Science Review · doi:10.1016/j.cosrev.2023.100567 · Cited by 105
Islam, A., Al Amin, A., & Shin, S. Y. (2022) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2022.3151873 · Cited by 103
Finding persistent items in data streams
Dai, H., Shahzad, M., Liu, A. X., & Zhong, Y. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3025111.3025112 · Cited by 103
Breslow, A. D., & Jayasena, N. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3213880.3213884 · Cited by 101
Wei, L., Cui, J., Zhong, H., Xu, Y., & Liu, L. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3056712 · Cited by 98
Modern Privacy-Preserving Record Linkage Techniques: An Overview
Gkoulalas-Divanis, A., Vatsalan, D., Karapiperis, D., & Kantarcıoğlu, M. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3114026 · Cited by 98
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
Dayan, N., Athanassoulis, M., & Idreos, S. (2018) · ACM Transactions on Database Systems · doi:10.1145/3276980 · Cited by 97
Akter, R., Golam, M., Doan, V., Lee, J., & Kim, D. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3176310 · Cited by 96
Security and Privacy Issues in Autonomous Vehicles: A Layer-Based Survey
Hataba, M., Sherif, A., Mahmoud, M. M. E. A., Abdallah, M. M., & Alasmary, W. (2022) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2022.3169500 · Cited by 95
SBAC: A secure blockchain-based access control framework for information-centric networking
Lyu, Q., Qi, Y., Zhang, X., Liu, H., Wang, Q., & Zheng, N. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2019.102444 · Cited by 90
A shifting bloom filter framework for set queries
Yang, T., Liu, A. X., Shahzad, M., Zhong, Y., Fu, Q., Li, Z., Xie, G., & Li, X. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2876473.2876476 · Cited by 84
COVID-19 Contact Tracing: Challenges and Future Directions
Chowdhury, M. J. M., Ferdous, M. S., Biswas, K., Chowdhury, N. M., & Muthukkumarasamy, V. (2020) · IEEE Access · doi:10.1109/access.2020.3036718 · Cited by 82
Chucky: A Succinct Cuckoo Filter for LSM-Tree
Dayan, N., & Twitto, M. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3457273 · Cited by 78
Privacy-preserving deep packet inspection in outsourced middleboxes
Yuan, X., Wang, X., Lin, J., & Wang, C. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524526 · Cited by 78
Vacuum filters: more space-efficient and faster replacement for bloom and cuckoo filters
Wang, M., Zhou, M., Shi, S., & Qian, C. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3364324.3364333 · Cited by 78
Data Structures to Represent a Set of k -long DNA Sequences
Chikhi, R., Holub, J., & Medvedev, P. (2021) · ACM Computing Surveys · doi:10.1145/3445967 · Cited by 76
Jidar: A Jigsaw-like Data Reduction Approach Without Trust Assumptions for Bitcoin System
Dai, X., Xiao, J., Yang, W., Wang, C., & Jin, H. (2019) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2019.00132 · Cited by 75
TRUCON: Blockchain-Based Trusted Data Sharing With Congestion Control in Internet of Vehicles
Yuan, M., Xu, Y., Zhang, C., Tan, Y., Wang, Y., Ren, J., & Zhang, Y. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3226500 · Cited by 75
Toward Privacy-Preserving Valet Parking in Autonomous Driving Era
Ni, J., Lin, X., & Shen, X. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2894720 · Cited by 74
Bloom Filters, Adaptivity, and the Dictionary Problem
Bender, M. A., Farach-Colton, M., Goswami, M., Johnson, R., McCauley, S., & Singh, S. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00026 · Cited by 73
Performance-optimal filtering: Bloom overtakes Cuckoo at high throughput
Lang, H., Neumann, T., Kemper, A., & Boncz, P. A. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3303753.3303757 · Cited by 73
A neural data structure for novelty detection
Dasgupta, S., Sheehan, T. C., Stevens, C. F., & Navlakha, S. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1814448115 · Cited by 71
Faster Unbalanced Private Set Intersection
Resende, A. C. D., & Aranha, D. F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-662-58387-6_11 · Cited by 71
Chen, H., Liao, L., Jin, H., & Wu, J. (2017) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2017.8117563 · Cited by 70
Selective GPU caches to eliminate CPU-GPU HW cache coherence
Agarwal, N., Nellans, D. W., Ebrahimi, E., Wenisch, T. F., Danskin, J., & Keckler, S. W. (2016) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2016.7446089 · Cited by 69
Lin, A. (2019) · WikiJournal of Science · doi:10.15347/wjs/2019.005 · Cited by 69
Nerantzi, C. (2018) · Edinburgh Napier Research Repository (Edinburgh Napier University) · doi:10.17869/enu.1025583 · Cited by 69
A Lightweight Policy Preserving EHR Sharing Scheme in the Cloud
Ying, Z., Wei, L., Li, Q., Liu, X., & Cui, J. (2018) · IEEE Access · doi:10.1109/access.2018.2871170 · Cited by 68
PTHash: Revisiting FCH Minimal Perfect Hashing
Pibiri, G. E., & Trani, R. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462849 · Cited by 67
Wang, H., Liang, J., Ding, Y., Tang, S., & Wang, Y. (2022) · Computer Standards & Interfaces · doi:10.1016/j.csi.2022.103696 · Cited by 67
Real time analytics: algorithms and systems
Kejariwal, A., Kulkarni, S., & Ramasamy, K. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2824032.2824132 · Cited by 64
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design
Pandey, P., Conway, A., Durie, J., Bender, M. A., Farach-Colton, M., & Johnson, R. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3452841 · Cited by 63
Ribbon filter: practically smaller than Bloom and XorPreprint
Dillinger, P. C., & Walzer, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.02515 · Cited by 63
Horton tables: fast hash tables for in-memory data-intensive computing
Breslow, A. D., Zhang, D. P., Greathouse, J. L., Jayasena, N., & Tullsen, D. M. (2016) · Cited by 61
Rowe, W. P. M. (2019) · Genome biology · doi:10.1186/s13059-019-1809-x · Cited by 60
Stable learned bloom filters for data streams
Liu, Q., Zheng, L., Shen, Y., & Chen, L. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407830 · Cited by 59
deepBF: Malicious URL detection using learned Bloom Filter and evolutionary deep learning
Patgiri, R., Biswas, A., & Nayak, S. (2023) · Computer Communications · doi:10.1016/j.comcom.2022.12.027 · Cited by 59
Improving MinHash via the containment index with applications to metagenomic analysis
Koslicki, D., & Zabeti, H. (2019) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.02.018 · Cited by 59
Location Privacy in Cognitive Radio Networks: A Survey
Grissa, M., Hamdaoui, B., & Yavuz, A. A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2693965 · Cited by 58
REMIX: Efficient Range Query for LSM-treesPreprint
Zhong, W., Chen, C., Wu, X., & Jiang, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.12734 · Cited by 58
Constructing SAT Filters with a Quantum Annealer
Douglass, A., King, A. D., & Raymond, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_9 · Cited by 57
Probabilistic Data Structures in Adversarial Environments
Clayton, D., Patton, C., & Shrimpton, T. (2019) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3319535.3354235 · Cited by 57
Persistent Bloom Filter: Membership Testing for the Entire History
Peng, Y., Guo, J., Li, F., Qian, W., & Zhou, A. (2018) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3183713.3183737 · Cited by 56
Binary Fuse Filters: Fast and Smaller Than Xor Filters
Graf, T. M., & Lemire, D. (2022) · ACM Journal of Experimental Algorithmics · doi:10.1145/3510449 · Cited by 52
Bloom Filters in Adversarial Environments
Naor, M., & Yogev, E. (2019) · ACM Transactions on Algorithms · doi:10.1145/3306193 · Cited by 52
Proof of Unlearning: Definitions and Instantiation
Weng, J., Yao, S., Du, Y., Huang, J., Weng, J., & Wang, C. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3358993 · Cited by 51
Cooperative Location Privacy in Vehicular Networks: Why Simple Mix Zones are Not Enough
Khodaei, M., & Papadimitratos, P. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3043640 · Cited by 50
On the optimal time/space tradeoff for hash tables
Bender, M. A., Farach-Colton, M., Kuszmaul, J., Kuszmaul, W., & Liu, M. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519969 · Cited by 50
Meta-Learning Neural Bloom FiltersPreprint
Rae, J. W., Bartunov, S., & Lillicrap, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.04304 · Cited by 50
M5: Mastering Page Migration and Memory Management for CXL-based Tiered Memory Systems
Sun, Y., Kim, J., Yu, Z., Zhang, J., Chai, S., Kim, M. J., Nam, H., Park, J., Na, E., Yuan, Y., et al. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3676641.3711999 · Cited by 48
Mitzenmacher, M., Pontarelli, S., & Reviriego, P. (2020) · ACM Journal of Experimental Algorithmics · doi:10.1145/3339504 · Cited by 47
Self-citationEfficient Privacy-Preserving Access Control Scheme in Electronic Health Records System
Ming, Y., & Zhang, T. (2018) · Sensors · doi:10.3390/s18103520 · Cited by 46
ElfStore: A Resilient Data Storage Service for Federated Edge and Fog Resources
Monga, S. K., Ramachandra, S. K., & Simmhan, Y. L. (2019) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2019.00062 · Cited by 45
SmartCuckoo: a fast and cost-efficient hashing index scheme for cloud storage systems
Sun, Y., Hua, Y., Jiang, S., Li, Q., Cao, S., & Zuo, P. (2017) · USENIX Annual Technical Conference · Cited by 44
A Shifting Framework for Set Queries
Yang, T., Liu, A. X., Shahzad, M., Yang, D., Fu, Q., Xie, G., & Li, X. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2017.2730227 · Cited by 44
Efficient L-Diversity Algorithm for Preserving Privacy of Dynamically Published Datasets
Temuujin, O., Ahn, J., & Im, D.-H. (2019) · IEEE Access · doi:10.1109/access.2019.2936301 · Cited by 44
Cuckoo Filters and Bloom Filters: Comparison and Application to Packet Classification
Reviriego, P., Martínez, J., Larrabeiti, D., & Pontarelli, S. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3024680 · Cited by 44
Cuckoo Counter: Adaptive Structure of Counters for Accurate Frequency and Top-k Estimation
Shi, Q., Xu, Y., Qi, J., Li, W., Yang, T., Xu, Y., & Wang, Y. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2022.3232098 · Cited by 44
Deep Packet Inspection Using Quotient Filter
Alhisnawi, M., & Ahmadi, M. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2601898 · Cited by 44
Luo, L., Guo, D., Rottenstreich, O., Ma, R. T. B., Luo, X., & Ren, B. (2019) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2019.8737454 · Cited by 43
K-Mer Counting Using Bloom Filters with an FPGA-Attached HMC
McVicar, N., Lin, C., & Hauck, S. (2017) · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM) · doi:10.1109/fccm.2017.23 · Cited by 42
Covert channel analysis and data hiding in tcp/ip.
Llamas, D. (2004) · Research Output (Edinburgh Napier University) · Cited by 42
Proteus: A Self-Designing Range Filter
Knorr, E., Lemaire, B., Lim, A., Luo, S., Zhang, H., Idreos, S., & Mitzenmacher, M. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3526167 · Cited by 41
Self-citationUtility-driven graph summarization
Kumar, K. A., & Efstathopoulos, P. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3297753.3297755 · Cited by 41
A Trust Model Using Edge Nodes and a Cuckoo Filter for Securing VANET under the NLoS Condition
Soleymani, S. A., Goudarzi, S., Anisi, M. H., Kama, N., Ismail, S. A., Azmi, A., Zareei, M., & Abdullah, A. H. (2020) · Symmetry · doi:10.3390/sym12040609 · Cited by 40
An Overview of Cryptographic Accumulators
Özçelik, İ., Medury, S., Broaddus, J., & Skjellum, A. (2021) · International Conference on Information Systems Security and Privacy (ICISSP) · doi:10.5220/0010337806610669 · Cited by 40
VeriDedup: A Verifiable Cloud Data Deduplication Scheme With Integrity and Duplication Proof
Yu, X., Bai, H., Yan, Z., & Zhang, R. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3141521 · Cited by 40
Angelou, N., Benaissa, A., Cebere, B. C., Clark, W., Hall, A. J., Hoeh, M. A., Liu, D., Papadopoulos, P., Roehm, R., Sandmann, R., et al. (2020) · Edinburgh Napier Research Repository (Edinburgh Napier University) · doi:10.48550/arxiv.2011.09350 · Cited by 40
Cuckoo Filter: Simplification and Analysis
Eppstein, D. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.swat.2016.8 · Cited by 40
Retrieval and Perfect Hashing Using Fingerprinting
Müller, I., Sanders, P., Schulze, R., & Zhou, W. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07959-2_12 · Cited by 39
Optimizing Registration Based Encryption
Cong, K., Eldefrawy, K., & Smart, N. P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92641-0_7 · Cited by 39
InfiniFilter: Expanding Filters to Infinity and Beyond
Dayan, N., Bercea, I. O., Reviriego, P., & Pagh, R. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589285 · Cited by 39
Improving Address Translation in Multi-GPUs via Sharing and Spilling aware TLB Design
Li, B., Yin, J., Zhang, Y., & Tang, X. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480083 · Cited by 38
Dissecting, Designing, and Optimizing LSM-based Data Stores
Sarkar, S., & Athanassoulis, M. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3522563 · Cited by 38
Metadata
- Authors
- Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D.
- Affiliations
- Carnegie Mellon University (US)
- Intel (United States) (US)
- Harvard University (US)
- Venue
- Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies
- Publisher
- ACM
- Published
- 2014-12-02
- Pages
- 75-88
- OpenAlex
- W1967373117
- Cited by
- 737
- References
- 30
- Citations by year
- 2026: 55 · 2025: 78 · 2024: 90 · 2023: 85 · 2022: 79 · 2021: 83 · 2020: 79 · 2019: 81 · 2018: 49 · 2017: 35 · 2016: 14 · 2015: 8 · 2014: 1
- FWCI
- 11.39
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) (publishedVersion)
- Funders
- Division of Computer and Network Systems (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Division of Computing and Communication Foundations (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Division of Information and Intelligent Systems (CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- cuckoo filter, Bloom filter, false positives, space efficiency, data structures
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.