{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:51:20Z","timestamp":1783439480377,"version":"3.54.6"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,9,2]],"date-time":"2010-09-02T00:00:00Z","timestamp":1283385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10619-010-7067-2","type":"journal-article","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T18:02:10Z","timestamp":1283364130000},"page":"119-156","source":"Crossref","is-referenced-by-count":49,"title":["Cardinality estimation and dynamic length adaptation for Bloom filters"],"prefix":"10.1007","volume":"28","author":[{"given":"Odysseas","family":"Papapetrou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolf","family":"Siberski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,2]]},"reference":[{"key":"7067_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Manolescu, I., Polyzotis, N., Preda, N., Sun, C.: XML processing in dht networks. In: Proceedings of the 24th International Conference on Data Engineering (ICDE), pp. 606\u2013615 (2008)","DOI":"10.1109\/ICDE.2008.4497469"},{"issue":"1\u20132","key":"7067_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10619-009-7035-x","volume":"25","author":"N. Anciaux","year":"2009","unstructured":"Anciaux, N., Benzine, M., Bouganim, L., Pucheral, P., Shasha, D.: Revelation on demand. Distrib. Parallel Databases 25(1\u20132), 5\u201328 (2009)","journal-title":"Distrib. Parallel Databases"},{"key":"7067_CR3","doi-asserted-by":"crossref","unstructured":"Artan, N.S., Sinkar, K., Patel, J., Chao, H.J.: Aggregated bloom filters for intrusion detection and prevention hardware. In: Proceedings of the Global Communications Conference (GLOBECOM), pp.\u00a0349\u2013354 (2007)","DOI":"10.1109\/GLOCOM.2007.72"},{"key":"7067_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM\u201902), pp. 1\u201310 (2002)","DOI":"10.1007\/3-540-45726-7_1"},{"key":"7067_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Improving collection selection with overlap awareness in P2P search engines. In: Proceedings of the 28th Annual International ACM Conference on Research and Development in Information Retrieval (SIGIR), pp. 67\u201374 (2005)","DOI":"10.1145\/1076034.1076049"},{"issue":"7","key":"7067_CR6","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. ACM Commun. 13(7), 422\u2013426 (1970)","journal-title":"ACM Commun."},{"key":"7067_CR7","unstructured":"Bratbergsengen, K.: Hashing methods and relational algebra operations. In: Proceedings of the Tenth International Conference on Very Large Data Bases (VLDB), pp. 323\u2013333 (1984)"},{"key":"7067_CR8","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Allerton Conference (2002)"},{"issue":"5","key":"7067_CR9","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TNET.2004.836103","volume":"12","author":"J.W. Byers","year":"2004","unstructured":"Byers, J.W., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. IEEE\/ACM Trans. Netw. 12(5), 767\u2013780 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"7067_CR10","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 30\u201339 (2004)"},{"key":"7067_CR11","doi-asserted-by":"crossref","unstructured":"Chervenak, A.L., Deelman, E., Foster, I.T., Guy, L., Hoschek, W., Iamnitchi, A., Kesselman, C., Kunszt, P.Z., Ripeanu, M., Schwartzkopf, R., Stockinger, H., Stockinger, K., Tierney, B.: Giggle: a framework for constructing scalable replica location services. In: Proceedings of the 2002 ACM\/IEEE Conference on Supercomputing, pp. 1\u201317 (2002)","DOI":"10.1109\/SC.2002.10024"},{"key":"7067_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"key":"7067_CR13","doi-asserted-by":"crossref","unstructured":"Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. In: Twelfth IEEE International Symposium on High Performance Distributed Computing (HPDC-12), June 2003","DOI":"10.1109\/HPDC.2003.1210033"},{"issue":"1\/2","key":"7067_CR14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1504\/IJSN.2007.012824","volume":"2","author":"O. Erdogan","year":"2007","unstructured":"Erdogan, O., Cao, P.: Hash-av: fast virus signature scanning by cache-resident filters. Int. J. Security Netw. 2(1\/2), 50\u201359 (2007)","journal-title":"Int. J. Security Netw."},{"issue":"3","key":"7067_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/90.851975","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. IEEE\/ACM Trans. Netw. 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"7067_CR16","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"7067_CR17","doi-asserted-by":"crossref","unstructured":"Guo, D., Wu, J., Chen, H., Luo, X.: Theory and network applications of dynamic bloom filters. In: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2006)","DOI":"10.1109\/INFOCOM.2006.325"},{"key":"7067_CR18","doi-asserted-by":"crossref","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. Trans. Knowl. Data Eng., 22(1) 2010","DOI":"10.1109\/TKDE.2009.57"},{"key":"7067_CR19","doi-asserted-by":"crossref","unstructured":"Hao, F., Kodialam, M.S., Lakshman, T.V.: Incremental bloom filters. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), pp. 1067\u20131075 (2008)","DOI":"10.1109\/INFOCOM.2008.161"},{"key":"7067_CR20","first-page":"232","volume-title":"Proceedings of VLDB International Workshop on Databases, Information Systems and Peer-to-Peer Computing","author":"G. Koloniari","year":"2003","unstructured":"Koloniari, G., Petrakis, Y., Pitoura, E.: Content-based overlay networks of XML peers based on multi-level bloom filters. In: Proceedings of VLDB International Workshop on Databases, Information Systems and Peer-to-Peer Computing, pp. 232\u2013247. Springer, Berlin (2003)"},{"key":"7067_CR21","doi-asserted-by":"crossref","unstructured":"Koloniari, G., Pitoura, E.: Content-based routing of path queries in peer-to-peer systems. In: Proceedings of International Conference on Extending Database Technology (EDBT), pp. 29\u201347 (2004)","DOI":"10.1007\/978-3-540-24741-8_4"},{"key":"7067_CR22","doi-asserted-by":"crossref","unstructured":"Koloniari, G., Pitoura, E.: Distributed structural relaxation of xpath queries. In: Proceedings of the 25th International Conference on Data Engineering (ICDE), pp. 529\u2013540 (2009)","DOI":"10.1109\/ICDE.2009.110"},{"issue":"4","key":"7067_CR23","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/371578.371598","volume":"32","author":"D. Kossmann","year":"2000","unstructured":"Kossmann, D.: The state of the art in distributed query processing. ACM Comput. Surv. 32(4), 422\u2013469 (2000)","journal-title":"ACM Comput. Surv."},{"key":"7067_CR24","doi-asserted-by":"crossref","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: Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 190\u2013201, Cambridge, MA, USA (2000)","DOI":"10.1145\/378993.379239"},{"key":"7067_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, A., Xu, J., Wang, J., Spatscheck, O., Li, L.: Space-code bloom filter for efficient per-flow traffic measurement. In: Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2004)","DOI":"10.1109\/INFCOM.2004.1354587"},{"key":"7067_CR26","unstructured":"Kumar, A., Xu, J.(J.), Zegura, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings of the 24rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2005)"},{"key":"7067_CR27","doi-asserted-by":"crossref","unstructured":"Mackert, L.F., Lohman, G.M.: R* optimizer validation and performance evaluation for distributed queries. In: Proceedings of the Twelfth International Conference on Very Large Data Bases (VLDB), pp. 149\u2013159 (1986)","DOI":"10.1145\/16894.16863"},{"key":"7067_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1060745.1060753","volume-title":"Proceedings of the 14th International Conference on World Wide Web (WWW\u201905)","author":"A. Metwally","year":"2005","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Duplicate detection in click streams. In: Proceedings of the 14th International Conference on World Wide Web (WWW\u201905), pp. 12\u201321. ACM, New York (2005)"},{"key":"7067_CR29","doi-asserted-by":"crossref","unstructured":"Michael, L., Nejdl, W., Papapetrou, O., Siberski, W.: Improving distributed join efficiency with extended bloom filter operations. In: Proceedings of 21st International Conference on Advanced Information Networking and Applications (AINA), pp. 187\u2013194 (2007)","DOI":"10.1109\/AINA.2007.80"},{"key":"7067_CR30","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: KLEE: a framework for distributed top-k query algorithms. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp. 637\u2013648 (2005)"},{"issue":"5","key":"7067_CR31","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"M. Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M.: Compressed bloom filters. IEEE\/ACM Trans. Netw. 10(5), 604\u2013612 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"7067_CR32","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"2000","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)"},{"issue":"5","key":"7067_CR33","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/32.52778","volume":"16","author":"J.K. Mullin","year":"1990","unstructured":"Mullin, J.K.: Optimal semijoins for distributed database systems. IEEE Trans. Softw. Eng. 16(5), 558\u2013560 (1990)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"7067_CR34","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. 1(2) (2005)","DOI":"10.1561\/0400000002"},{"issue":"1","key":"7067_CR35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10619-009-7041-z","volume":"26","author":"T. Neumann","year":"2009","unstructured":"Neumann, T., Bender, M., Michel, S., Schenkel, R., Triantafillou, P., Weikum, G.: Distributed top-k aggregation queries at large. Distrib. Parallel Databases 26(1), 3\u201327 (2009)","journal-title":"Distrib. Parallel Databases"},{"key":"7067_CR36","doi-asserted-by":"crossref","unstructured":"Ramesh, S., Papapetrou, O., Siberski, W.: Optimizing distributed joins with bloom filters. In: Proceedings of International Conference of Distributed Computing and Internet Technology (ICDCIT) (2008)","DOI":"10.1007\/978-3-540-89737-8_15"},{"key":"7067_CR37","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-44892-6_2","volume-title":"Middleware \u201903: Proceedings of the ACM\/IFIP\/USENIX 2003 International Conference on Middleware","author":"P. Reynolds","year":"2003","unstructured":"Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Middleware \u201903: Proceedings of the ACM\/IFIP\/USENIX 2003 International Conference on Middleware, pp. 21\u201340. Springer, New York (2003)"},{"key":"7067_CR38","unstructured":"Rhea, S.C., Kubiatowicz, J.: Probabilistic location and routing. In: INFOCOM (2002)"},{"issue":"6","key":"7067_CR39","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TVLSI.2008.2000244","volume":"16","author":"E. Safi","year":"2008","unstructured":"Safi, E., Moshovos, A., Veneris, A.G.: L-CBF: A low-power, fast counting bloom filter architecture. IEEE Trans. Very Large Scale Integration (VLSI) Syst. 16(6), 628\u2013638 (2008)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Syst."},{"key":"7067_CR40","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: SPIE\/ACM Conference on Multimedia Computing and Networking (MMCN) (2002)","DOI":"10.1117\/12.449977"},{"key":"7067_CR41","doi-asserted-by":"crossref","unstructured":"Snoeren, A.C.: Hash-based ip traceback. In: SIGCOMM, pp. 3\u201314 (2001)","DOI":"10.1145\/383059.383060"},{"key":"7067_CR42","unstructured":"Song, H., Sproull, T.S., Attig, M., Lockwood, J.W.: Snort offloader: A reconfigurable hardware NIDS filter. In: Proceedings of the International Conference on Field Programmable Logic and Applications (FPL), pp. 493\u2013498 (2005)"},{"key":"7067_CR43","doi-asserted-by":"crossref","unstructured":"Wang, W., Jiang, H., Lu, H., Yu, J.X.: Bloom histogram: path selectivity estimation for XML data with updates. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB), pp. 240\u2013251 (2004)","DOI":"10.1016\/B978-012088469-8\/50024-3"},{"key":"7067_CR44","doi-asserted-by":"crossref","unstructured":"Yan, J., Cho, P.L.: Enhancing collaborative spam detection with bloom filters. In: Computer Security Applications Conference, Annual, pp. 414\u2013428 (2006)","DOI":"10.1109\/ACSAC.2006.26"},{"issue":"9","key":"7067_CR45","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1109\/TKDE.2008.48","volume":"20","author":"R. Zhou","year":"2008","unstructured":"Zhou, R., Hwang, K., Cai, M.: Gossiptrust for fast reputation aggregation in peer-to-peer networks. IEEE Trans. Knowl. Data Eng. 20(9), 1282\u20131295 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-010-7067-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-010-7067-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-010-7067-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T11:15:41Z","timestamp":1740482141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-010-7067-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,2]]},"references-count":45,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["7067"],"URL":"https:\/\/doi.org\/10.1007\/s10619-010-7067-2","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,2]]}}}