{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:49:00Z","timestamp":1648691340515},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Autom. Comput."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11633-012-0630-8","type":"journal-article","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T03:52:34Z","timestamp":1334029954000},"page":"171-176","source":"Crossref","is-referenced-by-count":3,"title":["L-priorities bloom filter: A new member of the bloom filter family"],"prefix":"10.1007","volume":"9","author":[{"given":"Huang-Shui","family":"Hu","sequence":"first","affiliation":[]},{"given":"Hong-Wei","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Mi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,11]]},"reference":[{"issue":"7","key":"630_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. H. Bloom","year":"1970","unstructured":"B. H. Bloom. Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM, vol. 13, no. 7, pp. 422\u2013426, 1970.","journal-title":"Communications of the ACM"},{"issue":"15","key":"630_CR2","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1016\/j.comcom.2010.04.043","volume":"33","author":"K. Huang","year":"2010","unstructured":"K. Huang, D. F. Zhang, Z. Qin. Accelerating the bit-split string matching algorithm using bloom filters. Computer Communications, vol. 33, no. 15, pp. 1785\u20131794, 2010.","journal-title":"Computer Communications"},{"issue":"5","key":"630_CR3","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/32.52778","volume":"16","author":"J. K. Mullin","year":"1990","unstructured":"J. K. Mullin. Optimal semijoins for distributed database systems. IEEE Transactions on Software Engineering, vol. 16, no. 5, pp. 558\u2013560, 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"630_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2003","unstructured":"A. Broder, M. Mitzenmacher. Network applications of bloom filters: A survey. Internet Mathematics, vol. 1, no. 4, pp. 485\u2013509, 2003.","journal-title":"Internet Mathematics"},{"issue":"3","key":"630_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"F. Li","year":"2000","unstructured":"F. Li, C. Pei, J. Almeida, A. Broder. Summary cache: A scalable wide-area web cache sharing protocol. IEEE\/ACM Transactions on Networking, vol. 8, no. 3, pp. 281\u2013293, 2000.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"630_CR6","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.3724\/SP.J.1146.2010.00712","volume":"33","author":"L. M. Guo","year":"2011","unstructured":"L. M. Guo, S. B. Yang, S. L. Wang, R. Zhang, X. L. Niu. Replication consistency maintenance mechanism based on physical-location and bloom-filter for unstructured P2P network. Journal of Electronics and Information Technology, vol. 33, no. 4, pp. 1012\u20131016, 2011. (in Chinese)","journal-title":"Journal of Electronics and Information Technology"},{"issue":"1","key":"630_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/348.318590","volume":"9","author":"P. Valdurez","year":"1984","unstructured":"P. Valdurez, G. Gardarin. Join and semijoin algorithms for a multiprocessor database machine. ACM Transactions on Database Systems, vol. 9, no. 1, pp. 133\u2013161, 1984.","journal-title":"ACM Transactions on Database Systems"},{"issue":"5","key":"630_CR8","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/TNET.2004.836103","volume":"12","author":"J. W. Byers","year":"2004","unstructured":"J. W. Byers, J. Considine, M. Mitzenmacher, S. Rost. Informed content delivery across adaptive overly networks. IEEE\/ACM Transactions on Networking, vol. 12, no. 5, pp. 768\u2013780, 2004.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"630_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1504\/IJSN.2010.030721","volume":"5","author":"L. Xu","year":"2010","unstructured":"L. Xu, S. S. Chen, X. Y. Huang, Y. Mu. Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks. International Journal of Security and Networks, vol. 5, no. 1, pp. 35\u201344, 2010.","journal-title":"International Journal of Security and Networks"},{"issue":"10","key":"630_CR10","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.comcom.2010.03.009","volume":"33","author":"A. G. A. Priya","year":"2010","unstructured":"A. G. A. Priya, H. Lim. Hierarchical packet classification using a Bloom filter and rule-priority tries. Computer Communications, vol. 33, no. 10, pp. 1215\u20131226, 2010.","journal-title":"Computer Communications"},{"issue":"21","key":"630_CR11","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.ipl.2010.07.024","volume":"110","author":"K. Christensen","year":"2010","unstructured":"K. Christensen, A. Roginsky, M. Jimeno. A new analysis of the false positive rate of a Bloom filter. Information Processing Letters, vol. 110, no. 21, pp. 944\u2013949, 2010.","journal-title":"Information Processing Letters"},{"issue":"6","key":"630_CR12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"P. S. Almeida","year":"2007","unstructured":"P. S. Almeida, C. Baquero, N. Preguica, D. Hutchison. Scalable bloom filters. Information Processing Letters, vol. 101, no. 6, pp. 255\u2013261, 2007.","journal-title":"Information Processing Letters"},{"key":"630_CR13","first-page":"241","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"S. Cohen","year":"2003","unstructured":"S. Cohen, Y. Matias. Spectral Bloom filters. In Proceedings of the ACM SIGMOD International Conference on Management of Data, ACM, San Diego, USA, pp. 241\u2013252, 2003."},{"key":"630_CR14","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher. Compressed Bloom filters. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, USA, pp. 144\u2013150, 2001.","DOI":"10.1145\/383962.384004"},{"issue":"18","key":"630_CR15","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1016\/j.comnet.2010.07.003","volume":"54","author":"D. Benoit","year":"2010","unstructured":"D. Benoit, B. Bruno, F. Timur. Improving retouched bloom filters for trading off selected false positive against false negatives. Computer Network, vol. 54, no. 18, pp. 3373\u20133387, 2010.","journal-title":"Computer Network"},{"issue":"3","key":"630_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s11633-010-0520-x","volume":"7","author":"D. T. Pham","year":"2010","unstructured":"D. T. Pham, E. Koc. Design of a two-dimensional recursive filter using the bees algorithm. International Journal of Automation and Computing, vol. 7, no. 3, pp. 399\u2013402, 2010.","journal-title":"International Journal of Automation and Computing"},{"issue":"1","key":"630_CR17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/s11633-010-0559-8","volume":"8","author":"M. S. Pan","year":"2011","unstructured":"M. S. Pan, J. T. Tang, X. L. Yang. An adaptive median filter algorithm based on B-spline function. International Journal of Automation and Computing, vol. 8, no. 1, pp. 92\u201399, 2011.","journal-title":"International Journal of Automation and Computing"}],"container-title":["International Journal of Automation and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-012-0630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11633-012-0630-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-012-0630-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T03:10:34Z","timestamp":1561605034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11633-012-0630-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s11633-012-0630-8","relation":{},"ISSN":["1476-8186","1751-8520"],"issn-type":[{"value":"1476-8186","type":"print"},{"value":"1751-8520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}