{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:42:42Z","timestamp":1725550962411},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121784"},{"type":"electronic","value":"9783642121791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12179-1_33","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T19:23:41Z","timestamp":1270063421000},"page":"395-404","source":"Crossref","is-referenced-by-count":1,"title":["Time-Decaying Bloom Filters for Efficient Middle-Tier Data Management"],"prefix":"10.1007","author":[{"given":"Kai","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1013835801726","volume":"4","author":"B.F. Cooper","year":"2001","unstructured":"Cooper, B.F., Sample, N., Franklin, M.J., Olshansky, J., Shadmon, M.: Middle-tier extensible data management. World Wide Web\u00a04, 209\u2013230 (2001)","journal-title":"World Wide Web"},{"doi-asserted-by":"crossref","unstructured":"Luo, Q., Krishnamurthy, S., Mohan, C., Pirahesh, H., Woo, H., Lindsay, B.G., Naughton, J.F.: Middle-tier database caching for e-busines. In: Proceedings ACM SIGMOD Conference on Management of Data (SIGMOD 2002), Madison, Wisconsin, pp. 600\u2013611 (2002)","key":"33_CR2","DOI":"10.1145\/564691.564763"},{"doi-asserted-by":"crossref","unstructured":"Team, T.: Mid-tier caching: The timesten approac. In: Proceedings ACM SIGMOD Conference on Management of Data (SIGMOD 2002), Madison, Wisconsin, pp. 588\u2013593 (2002)","key":"33_CR3","DOI":"10.1145\/564691.564761"},{"doi-asserted-by":"crossref","unstructured":"Stonebraker, M.: Managing persistent objects in a multi-level store. In: Proceedings ACM SIGMOD Conference on Management of Data (SIGMOD 1991), Denver, CO, pp. 2\u201311 (1991)","key":"33_CR4","DOI":"10.1145\/115790.115791"},{"key":"33_CR5","doi-asserted-by":"publisher","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. Commun. ACM\u00a013, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F. Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 684\u2013695. Springer, Heidelberg (2006)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/872757.872787","volume-title":"SIGMOD 2003","author":"S. Cohen","year":"2003","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: SIGMOD 2003, pp. 241\u2013252. ACM Press, New York (2003)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1142473.1142477","volume-title":"SIGMOD 2006","author":"F. Deng","year":"2006","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable bloom filters. In: SIGMOD 2006, pp. 25\u201336. ACM Press, New York (2006)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw.\u00a08, 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"33_CR10","first-page":"137","volume":"4","author":"K. Cheng","year":"2005","unstructured":"Cheng, K., Xiang, L.: Efficient web profiling by time-decaying bloom filters. DBSJ Letters\u00a04, 137\u2013140 (2005)","journal-title":"DBSJ Letters"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/773153.773175","volume-title":"PODS 2003: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"E. Cohen","year":"2003","unstructured":"Cohen, E., Strauss, M.: Maintaining time-decaying stream aggregates. In: PODS 2003: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 223\u2013233. ACM Press, New York (2003)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/359619.359627","volume":"21","author":"R. Morris","year":"1978","unstructured":"Morris, R.: Counting large numbers of events in small registers. Commun. ACM\u00a021, 840\u2013842 (1978)","journal-title":"Commun. ACM"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K.Y. Whang","year":"1990","unstructured":"Whang, K.Y., Vander-Zanden, B.T., Taylor, H.M.: A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst.\u00a015, 208\u2013229 (1990)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12179-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:04:25Z","timestamp":1619784265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12179-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121784","9783642121791"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12179-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}