{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:46:51Z","timestamp":1777682811876,"version":"3.51.4"},"reference-count":14,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JHS"],"published-print":{"date-parts":[[2019,11,20]]},"DOI":"10.3233\/jhs-190624","type":"journal-article","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T11:46:50Z","timestamp":1572608810000},"page":"413-424","source":"Crossref","is-referenced-by-count":4,"title":["SLCF: Single-hash lookup cuckoo filter"],"prefix":"10.1177","volume":"25","author":[{"given":"Mohammad","family":"Najafimehr","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran. E-mails:\u00a0mnm1551@gmail.com,\u00a0m.ahmadi@razi.ac.ir"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmood","family":"Ahmadi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran. E-mails:\u00a0mnm1551@gmail.com,\u00a0m.ahmadi@razi.ac.ir"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"5","key":"10.3233\/JHS-190624_ref1","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1049\/iet-net.2017.0037","article-title":"QCF for deep packet inspection","volume":"7","author":"Al-hisnawi","year":"2018","journal-title":"IET Networks"},{"issue":"2","key":"10.3233\/JHS-190624_ref3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TNET.2006.872576","article-title":"Longest prefix matching using bloom filters","volume":"14","author":"Dharmapurikar","year":"2006","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.3233\/JHS-190624_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056115"},{"key":"10.3233\/JHS-190624_ref5","doi-asserted-by":"crossref","unstructured":"B.\u00a0Fan, D.G.\u00a0Andersen, M.\u00a0Kaminsky and M.D.\u00a0Mitzenmacher, Cuckoo filter: Practically better than bloom, in: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, ACM, 2014, pp.\u00a075\u201388.","DOI":"10.1145\/2674005.2674994"},{"issue":"2","key":"10.3233\/JHS-190624_ref6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/rsa.20208","article-title":"Less hashing, same performance: Building a better bloom filter","volume":"33","author":"Kirsch","year":"2008","journal-title":"Random Structures & Algorithms"},{"key":"10.3233\/JHS-190624_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2016.7562258"},{"key":"10.3233\/JHS-190624_ref8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jnca.2016.02.008","article-title":"Name prefix matching using bloom filter pre-searching for content centric network","volume":"65","author":"Lee","year":"2016","journal-title":"Journal of Network and Computer Applications"},{"key":"10.3233\/JHS-190624_ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.4"},{"issue":"2","key":"10.3233\/JHS-190624_ref10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","article-title":"Cuckoo hashing","volume":"51","author":"Pagh","year":"2004","journal-title":"Journal of Algorithms"},{"key":"10.3233\/JHS-190624_ref11","doi-asserted-by":"crossref","unstructured":"P.\u00a0Pandey, M.A.\u00a0Bender, R.\u00a0Johnson and R.\u00a0Patro, A general-purpose counting filter: Making every bit count, in: Proceedings of the 2017 ACM International Conference on Management of Data, ACM, 2017, pp.\u00a0775\u2013787.","DOI":"10.1145\/3035918.3035963"},{"issue":"2","key":"10.3233\/JHS-190624_ref13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/17445760.2017.1363202","article-title":"Efficient name matching based on a fast two-dimensional filter in named data networking","volume":"34","author":"Shubbar","year":"2019","journal-title":"International Journal of Parallel, Emergent and Distributed Systems"},{"issue":"3","key":"10.3233\/JHS-190624_ref14","first-page":"1","article-title":"A filter-based design of pending interest table in named data networking","volume":"27","author":"Shubbar","year":"2019","journal-title":"Journal of Network and Systems Management"},{"key":"10.3233\/JHS-190624_ref15","unstructured":"Y.\u00a0Sun, Y.\u00a0Hua, S.\u00a0Jiang, Q.\u00a0Li, S.\u00a0Cao and P.\u00a0Zuo, SmartCuckoo: A fast and cost-efficient hashing index scheme for cloud storage systems, in: 2017 {USENIX}, Annual Technical Conference ({USENIX}{ATC} 17), 2017, pp.\u00a0553\u2013565."},{"key":"10.3233\/JHS-190624_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.35"}],"container-title":["Journal of High Speed Networks"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JHS-190624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:44:11Z","timestamp":1777452251000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JHS-190624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":14,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/jhs-190624","relation":{},"ISSN":["1875-8940","0926-6801"],"issn-type":[{"value":"1875-8940","type":"electronic"},{"value":"0926-6801","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11,20]]}}}