The DOI matches its Crossref record.
Space/time trade-offs in hash coding with allowable errors
Open accessAbstract
In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash-coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency. The new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area is consequently not feasible using conventional methods. In such applications, it is envisaged that overall performance could be improved by using a smaller core resident hash area in conjunction with the new methods and, when necessary, by using some secondary and perhaps time-consuming test to “catch” the small fraction of errors associated with the new methods. An example is discussed which illustrates possible areas of application for the new methods. Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 3
- 10.1145/363744.363776 · doi:10.1145/363744.363776
- 10.1145/362851.362880 · doi:10.1145/362851.362880
- 10.1145/362851.362882 · doi:10.1145/362851.362882
Cited by
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
Drebin: Effective and Explainable Detection of Android Malware in Your Pocket
Arp, D., Spreitzenbarth, M., Hübner, M., Gascon, H., & Rieck, K. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23247 · Cited by 2,331
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
Summary 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
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818784 · Cited by 1,730
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
A Survey of Information-Centric Networking Research
Xylomenos, G., Ververidis, C. N., Siris, V. A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Katsaros, K. V., & Polyzos, G. C. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.070813.00063 · Cited by 1,348
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
The CQL continuous query language: semantic foundations and query execution
Arasu, A., Babu, S., & Widom, J. (2006) · The VLDB Journal · doi:10.1007/s00778-004-0147-z · Cited by 1,170
Privacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
Unsupervised real-time anomaly detection for streaming data
Ahmad, S., Lavin, A., Purdy, S., & Agha, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.070 · Cited by 995
Flipping bits in memory without accessing them: an experimental study of DRAM disturbance errors
Kim, Y., Daly, R., Kim, J., Fallin, C., Lee, J. H., Lee, D., Wilkerson, C., Lai, K., & Mutlu, O. (2014) · ACM SIGARCH Computer Architecture News · doi:10.1145/2678373.2665726 · Cited by 921
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
A survey of security issues in wireless sensor networks
Wang, Y., Attebury, G., & Ramamurthy, B. (2006) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2006.315852 · Cited by 898
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_20 · Cited by 883
STAMP: Stanford Transactional Applications for Multi-Processing
Minh, C. C., Chung, J., Kozyrakis, C., & Olukotun, K. (2008) · 2008 IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2008.4636089 · Cited by 873
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Ad click prediction: a view from the trenches
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., et al. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2488200 · Cited by 867
Survey of network-based defense mechanisms countering the DoS and DDoS problems
Peng, T., Leckie, C., & Ramamohanarao, K. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216373 · Cited by 759
Cuckoo Filter: Practically Better Than Bloom
Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014) · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies · doi:10.1145/2674005.2674994 · Cited by 737
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
A survey of web caching schemes for the Internet
Wang, J. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505701 · Cited by 682
Efficient Computation of Frequent and Top-k Elements in Data Streams
Metwally, A., Agrawal, D., & El Abbadi, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30570-5_27 · Cited by 681
ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter
Jackman, S. D., Vandervalk, B. P., Mohamadi, H., Chu, J., Yeo, S., Hammond, S. A., Jahesh, G., Khan, H., Coombe, L., Warren, R. L., et al. (2017) · Genome Research · doi:10.1101/gr.214346.116 · Cited by 679
Van Renesse, R., Birman, K. P., & Vogels, W. (2003) · ACM Transactions on Computer Systems · doi:10.1145/762483.762485 · Cited by 645
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Smart Cities: A Survey on Data Management, Security, and Enabling Technologies
Gharaibeh, A., Salahuddin, M. A., Hussini, S. J., Khreishah, A., Khalil, I., Guizani, M., & Al-Fuqaha, A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2736886 · Cited by 628
“Bloom Filter [243] is a probabilistic algorithm that is used to determine whether an element is in a set or not.”
MethodAn architecture for a secure service discovery service
Czerwinski, S. E., Zhao, B. Y., Hodes, T. D., Joseph, A. D., & Katz, R. H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313462 · Cited by 610
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
Differential privacy under continual observation
Dwork, C., Naor, M., Pitassi, T., & Rothblum, G. N. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806787 · Cited by 583
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
“technique based on Bloom filters [2] for protecting TCP flows”
MethodToward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement
Fu, Z., Wu, X., Guan, C., Sun, X., & Ren, K. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2596138 · Cited by 547
3D-Stacked Memory Architectures for Multi-core Processors
Loh, G. H. (2008) · ACM SIGARCH Computer Architecture News · doi:10.1145/1394608.1382159 · Cited by 541
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
Estan, C., & Varghese, G. (2003) · ACM Transactions on Computer Systems · doi:10.1145/859716.859719 · Cited by 539
Parallel and Dynamic Searchable Symmetric Encryption
Kamara, S., & Papamanthou, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_22 · Cited by 528
Theory and Practice of Bloom Filters for Distributed Systems
Tarkoma, S., Rothenberg, C. E., & Lagerspetz, E. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.031611.00024 · Cited by 518
VABKS: Verifiable attribute-based keyword search over outsourced encrypted data
Zheng, Q., Xu, S., & Ateniese, G. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6847976 · Cited by 499
A study of practical deduplication
Meyer, D. T., & Bolosky, W. J. (2012) · ACM Transactions on Storage · doi:10.1145/2078861.2078864 · Cited by 476
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Cormode, G., Garofalakis, M., Haas, P. J., & Jermaine, C. (2011) · Foundations and Trends in Databases · doi:10.1561/1900000004 · Cited by 468
Flipping bits in memory without accessing them: An experimental study of DRAM disturbance errors
Kim, Y., Daly, R., Kim, J., Fallin, C., Lee, J. H., Lee, D., Wilkerson, C., Lai, K., & Mutlu, O. (2014) · 2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca.2014.6853210 · Cited by 465
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
Differential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
“InRAPPOR, first, the client’s response v is hashed onto a Bloom filter B [139], [140] of size k using a hash function h .”
MethodRAIDR: Retention-Aware Intelligent DRAM Refresh
Liu, J., Jaiyen, B., Veras, R., & Mutlu, O. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2366231.2337161 · Cited by 444
3D-Stacked Memory Architectures for Multi-core Processors
Loh, G. H. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.15 · Cited by 438
Inferring binary trust relationships in Web-based social networks
Golbeck, J., & Hendler, J. (2006) · ACM Transactions on Internet Technology · doi:10.1145/1183463.1183470 · Cited by 436
Deep packet inspection using parallel bloom filters
Dharmapurikar, S., Krishnamurthy, P., Sproull, T. S., & Lockwood, J. W. (2004) · IEEE Micro · doi:10.1109/mm.2004.1268997 · Cited by 435
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
Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology
Seshadri, V., Lee, D., Mullins, T., Hassan, H., Boroumand, A., Kim, J., Kozuch, M. A., Mutlu, O., Gibbons, P. B., & Mowry, T. C. (2017) · Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3123939.3124544 · Cited by 434
Summary 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
Big data: From beginning to future
Yaqoob, I., Hashem, I. A. T., Gani, A., Mokhtar, S., Ahmed, E., Anuar, N. B., & Vasilakos, A. V. (2016) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2016.07.009 · Cited by 410
Join processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
Efficient query evaluation using a two-level retrieval process
Broder, A. Z., Carmel, D., Herscovici, M., Soffer, A., & Zien, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956944 · Cited by 407
“Such a two level evaluation approach is commonly used in other application areas to enhance performance: databases sometimes use Bloom filters [4] to construct a preliminary join followed by an exact evaluation [17]; speech recognition systems use a fast but approximate acoustic match to decrease the number of extensi…”
MethodEviction of Misbehaving and Faulty Nodes in Vehicular Networks
Raya, M., Papadimitratos, P., Aad, I., Jungels, D., & Hubaux, J.-P. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.071006 · Cited by 406
STREAM: The Stanford Data Stream Management System
Arasu, A., Babcock, B., Babu, S., Cieslewicz, J., Datar, M., Ito, K., Motwani, R., Srivastava, U., & Widom, J. (2016) · Data-Centric Systems and Applications · doi:10.1007/978-3-540-28608-0_16 · Cited by 406
The Emerging Trends of Multi-Label Learning
Liu, W., Wang, H., Shen, X., & Tsang, I. W. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3119334 · Cited by 400
Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud
Wang, B., Yu, S., Lou, W., & Hou, Y. T. (2014) · IEEE INFOCOM 2014 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2014.6848153 · Cited by 391
When private set intersection meets big data: an efficient and scalable protocol
Dong, C., Chen, L., & Wen, Z. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516701 · Cited by 387
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
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
A survey of coordinated attacks and collaborative intrusion detection
Zhou, C. V., Leckie, C., & Karunasekera, S. (2010) · Computers & Security · doi:10.1016/j.cose.2009.06.008 · Cited by 374
Olston, C., & Najork, M. (2010) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000017 · Cited by 370
Architecture Design for Soft Errors
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-369529-1.x5001-0 · Cited by 365
A Survey of Provably Secure Searchable Encryption
Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2015) · ACM Computing Surveys · doi:10.1145/2636328 · Cited by 357
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
Sun, W., Yu, S., Lou, W., Hou, Y. T., & Li, H. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2355202 · Cited by 351
Security in Internet of Things: issues, challenges, taxonomy, and architecture
Adat, V., & Gupta, B. B. (2018) · Telecommunication Systems · doi:10.1007/s11235-017-0345-9 · Cited by 348
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Fast 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
MiniSec: a secure sensor network communication architecture
Luk, M., Mezzour, G., Perrig, A., & Gligor, V. (2007) · Proceedings of the 6th international conference on Information processing in sensor networks - IPSN '07 · doi:10.1145/1236360.1236421 · Cited by 327
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
Extreme Binning: Scalable, parallel deduplication for chunk-based file backup
Bhagwat, D., Eshghi, K., Long, D. D. E., & Lillibridge, M. (2009) · 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems · doi:10.1109/mascot.2009.5366623 · Cited by 325
Simple and Scalable Response Prediction for Display Advertising
Chapelle, O., Manavoglu, E., & Rosales, R. (2015) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2532128 · Cited by 318
A Comprehensive Study of the Past, Present, and Future of Data Deduplication
Xia, W., Jiang, H., Feng, D., Douglis, F., Shilane, P., Hua, Y., Fu, M., Zhang, Y., & Zhou, Y. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2571298 · Cited by 318
Mashtree: a rapid comparison of whole genome sequence files
Katz, L., Griswold, T., Morrison, S., Caravas, J., Zhang, S., Bakker, H., Deng, X., & Carleton, H. (2019) · Journal of Open Source Software · doi:10.21105/joss.01762 · Cited by 316
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
Anagram: A Content Anomaly Detector Resistant to Mimicry Attack
Wang, K., Parekh, J. J., & Stolfo, S. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11856214_12 · Cited by 310
Deduplicating Training Data Makes Language Models Better
Lee, K., Ippolito, D., Nystrom, A., Zhang, C., Eck, D., Callison-Burch, C., & Carlini, N. (2022) · Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2022.acl-long.577 · Cited by 304
PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities
Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2004) · High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on · doi:10.1109/hpdc.2003.1210033 · Cited by 300
Botnet in DDoS Attacks: Trends and Challenges
Hoque, N., Bhattacharyya, D. K., & Kalita, J. K. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2457491 · Cited by 299
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Towards Massive Connectivity Support for Scalable mMTC Communications in 5G Networks
Bockelmann, C., Pratas, N. K., Wunder, G., Saur, S., Navarro, M., Gregoratti, D., Vivier, G., De Carvalho, E., Ji, Y., Stefanovic, C., et al. (2018) · IEEE Access · doi:10.1109/access.2018.2837382 · Cited by 289
“This observation was the motivation for the use of Bloom filters – a data structure based on the OR operation for testing set membership [25] – for the construction of the access signatures.”
MethodA taxonomy of privacy-preserving record linkage techniques
Vatsalan, D., Christen, P., & Verykios, V. S. (2013) · Information Systems · doi:10.1016/j.is.2012.11.005 · Cited by 295
SILT: a memory-efficient, high-performance key-value store
Lim, H., Fan, B., Andersen, D. G., & Kaminsky, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043558 · Cited by 294
A survey of context data distribution for mobile ubiquitous systems
Bellavista, P., Corradi, A., Fanelli, M., & Foschini, L. (2012) · ACM Computing Surveys · doi:10.1145/2333112.2333119 · Cited by 289
Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data
Liu, Y., Schröder, J., & Schmidt, B. (2013) · Bioinformatics · doi:10.1093/bioinformatics/bts690 · Cited by 287
Efficient counting of k-mers in DNA sequences using a bloom filter
Melsted, P., & Pritchard, J. K. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-333 · Cited by 283
Achieving usable and privacy-assured similarity search over outsourced cloud data
Wang, C., Ren, K., Yu, S., & Urs, K. M. R. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195784 · Cited by 280
PhishStorm: Detecting Phishing With Streaming Analytics
Marchal, S., Francois, J., State, R., & Engel, T. (2014) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2014.2377295 · Cited by 271
“As a result we implement all the word set previously defined with an efficient data structure: the Bloom filter [20].”
MethodMachine learning for streaming data: state of the art, challenges, and opportunities
Gomes, H. M., Read, J., Bifet, A., Barddal, J. P., & Gama, J. (2019) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3373464.3373470 · Cited by 267
PLAN: a packet language for active networks
Hicks, M., Kakkar, P., Moore, J. T., Gunter, C. A., & Nettles, S. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289431 · Cited by 266
Accountable internet protocol (aip)
Andersen, D. G., Balakrishnan, H., Feamster, N., Koponen, T., Moon, D., & Shenker, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402997 · Cited by 262
StarCoder: may the source be with you!
Li, R., Allal, L. B., Zi, Y., Muennighoff, N., Kocetkov, D., Mou, C., Marone, M., Akiki, C., Li, J., Chim, J., et al. (2023) · arXiv · doi:10.48550/arxiv.2305.06161 · Cited by 261
Stochastic fair blue: a queue management algorithm for enforcing fairness
Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916648 · Cited by 260
Lighter: fast and memory-efficient sequencing error correction without counting
Song, L., Florea, L., & Langmead, B. (2014) · Genome Biology · doi:10.1186/preaccept-9663167051308943 · Cited by 258
Metadata
- Authors
- Bloom, B. H.
- Venue
- Communications of the ACM
- Published
- 1970-07
- Volume
- 13
- Issue
- 7
- Pages
- 422-426
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2123845384
- Cited by
- 7,492
- References
- 0
- FWCI
- 2.69
- Type
- journal article
- Language
- en
- Open access
- bronze
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.