{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T21:09:49Z","timestamp":1789679389300,"version":"4.0.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319181196","type":"print"},{"value":"9783319181202","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_12","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"191-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Gaussian Bloom Filter"],"prefix":"10.1007","author":[{"given":"Martin","family":"Werner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirco","family":"Sch\u00f6nfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"12_CR1","unstructured":"The Apache Cassandra database (2014). http:\/\/cassandra.apache.org\/"},{"key":"12_CR2","unstructured":"Appleby, A.: Murmurhash (2009). http:\/\/code.google.com\/p\/smhasher\/"},{"issue":"7","key":"12_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics 1(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"12_CR5","unstructured":"Byers, J., Considine, J., Mitzenmacher, M.: Fast approximate reconciliation of set differences. Tech. rep., Boston University Computer Science Department (2002)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS) 26(2), 4 (2008)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Jones, P.: US Secure Hash Algorithm 1 (SHA1) (2001)","DOI":"10.17487\/rfc3174"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Feng, W.C., Kandlur, D.D., Saha, D., Shin, K.G.: Stochastic fair blue: a queue management algorithm for enforcing fairness. In: Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2001, vol. 3, pp. 1520\u20131529. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916648"},{"key":"12_CR9","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nfeld, M., Werner, M.: Node wake-up via ovsf-coded bloom filters in wireless sensor networks. In: Ad Hoc Networks, pp. 119\u2013134. Springer (2014)","DOI":"10.1007\/978-3-319-14225-8_8"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1162\/089976699300016467","volume":"11","author":"NN Schraudolph","year":"1999","unstructured":"Schraudolph, N.N.: A fast, compact approximation of the exponential function. Neural Computation 11(4), 853\u2013862 (1999)","journal-title":"Neural Computation"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: 26th IEEE Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201310 (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Whitaker, A., Wetherall, D.: Forwarding without loops in icarus. In: 2002 IEEE Open Architectures and Network Programming Proceedings, pp. 63\u201375. IEEE (2002)","DOI":"10.1109\/OPNARC.2002.1019229"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:10:49Z","timestamp":1747872649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}