{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:32Z","timestamp":1750307012561,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T00:00:00Z","timestamp":1332806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,27]]},"DOI":"10.1145\/2247596.2247624","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"228-238","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards \"intelligent compression\" in streams"],"prefix":"10.1145","author":[{"given":"Sourav","family":"Dutta","sequence":"first","affiliation":[{"name":"IBM Research, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Souvik","family":"Bhattacherjee","sequence":"additional","affiliation":[{"name":"IBM Research, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Narang","sequence":"additional","affiliation":[{"name":"IBM Research, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060291"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-47534-9","volume-title":"Data Streams: Models and Algorithms","author":"Aggarwal C.","year":"2007","unstructured":"C. Aggarwal and P. Yu . Data Streams: Models and Algorithms . Springer , 2007 . C. Aggarwal and P. Yu. Data Streams: Models and Algorithms. Springer, 2007."},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Aggarwal C. C.","year":"2006","unstructured":"C. C. Aggarwal . On biased reservoir sampling in the presence of stream evolution . In VLDB , 2006 . C. C. Aggarwal. On biased reservoir sampling in the presence of stream evolution. In VLDB, 2006."},{"key":"e_1_3_2_1_4_1","first-page":"269","volume-title":"FAST","author":"Ahu B.","year":"2008","unstructured":"B. Ahu , K. Li , and R. H. Patterson . Avoiding the disk bottleneck in the data domain deduplication file system . In FAST , pages 269 -- 282 , 2008 . B. Ahu, K. Li, and R. H. Patterson. Avoiding the disk bottleneck in the data domain deduplication file system. In FAST, pages 269--282, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","author":"Babcock B.","year":"2002","unstructured":"B. Babcock , M. Datar , and R. Motwani . Sampling from moving window over streaming data . In SODA , 2002 . B. Babcock, M. Datar, and R. Motwani. Sampling from moving window over streaming data. In SODA, 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383075"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956759"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506311"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956946"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_1_15_1","first-page":"59","volume-title":"USENIX","author":"Douglis F.","year":"2004","unstructured":"F. Douglis , J. Lavoie , J. M. Tracey , P. Kulkarni , and P. Kulkarni . Redundancy elimination within large collections of files . In USENIX , pages 59 -- 72 , 2004 . F. Douglis, J. Lavoie, J. M. Tracey, P. Kulkarni, and P. Kulkarni. Redundancy elimination within large collections of files. In USENIX, pages 59--72, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_17_1","first-page":"1520","volume-title":"IEEE INFOCOM","author":"Feng W.","year":"2001","unstructured":"W. Feng , D. Kandlur , D. Sahu , and K. Shin . Stochastic fair blue: A queue management algorithm for enforcing fairness . In IEEE INFOCOM , pages 1520 -- 1529 , 2001 . W. Feng, D. Kandlur, D. Sahu, and K. Shin. Stochastic fair blue: A queue management algorithm for enforcing fairness. In IEEE INFOCOM, pages 1520--1529, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_19_1","volume-title":"Database System Implementation","author":"Garcia-Molina H.","year":"1999","unstructured":"H. Garcia-Molina , J. D. Ullman , and W. J. Database System Implementation . Prentice Hall , 1999 . H. Garcia-Molina, J. D. Ullman, and W. J. Database System Implementation. Prentice Hall, 1999."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871596"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375665"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276334"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316217"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019213109274"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89737-8_15"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945918_30"},{"key":"e_1_3_2_1_27_1","volume-title":"FAST","author":"Jain N.","year":"2005","unstructured":"N. Jain , M. Dahlin , and R. Tewari . Taper: Tiered approach for eliminating redundancy in replica synchronization . In FAST , 2005 . N. Jain, M. Dahlin, and R. Tewari. Taper: Tiered approach for eliminating redundancy in replica synchronization. In FAST, 2005."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354587"},{"key":"e_1_3_2_1_29_1","first-page":"305","volume-title":"ICDAR","author":"Lee D.","year":"1999","unstructured":"D. Lee and J. Hull . Duplicate detection in symbolically compressed documents . In ICDAR , pages 305 -- 308 , 1999 . D. Lee and J. Hull. Duplicate detection in symbolically compressed documents. In ICDAR, pages 305--308, 1999."},{"key":"e_1_3_2_1_30_1","volume-title":"Using bloom filters to speed-up name lookup in distributed systems","author":"Little M.","year":"2002","unstructured":"M. Little , N. Speirs , and S. Shrivastava . Using bloom filters to speed-up name lookup in distributed systems . The Computer Journal (Oxford University Press) , 45(6):645--652, 2002 . M. Little, N. Speirs, and S. Shrivastava. Using bloom filters to speed-up name lookup in distributed systems. The Computer Journal (Oxford University Press), 45(6):645--652, 2002."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060753"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_1_33_1","volume-title":"VLDB","author":"Gibbons P.","year":"2001","unstructured":"P. Gibbons . Distinct sampling for highly accurate answers to distinct value queries and event reports . In VLDB , 2001 . P. Gibbons. Distinct sampling for highly accurate answers to distinct value queries and event reports. In VLDB, 2001."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594230"},{"key":"e_1_3_2_1_35_1","first-page":"89","volume-title":"FAST","author":"Quinlan S.","year":"2002","unstructured":"S. Quinlan and S. Dorward . Venti: A new approach to archival storage . In FAST , pages 89 -- 101 , 2002 . S. Quinlan and S. Dorward. Venti: A new approach to archival storage. In FAST, pages 89--101, 2002."},{"key":"e_1_3_2_1_36_1","first-page":"155","volume-title":"USENIX","author":"Reiter M.","year":"1998","unstructured":"M. Reiter , V. Anupam , and A. Mayer . Detecting hit-shaving in click-through payment schemes . In USENIX , pages 155 -- 166 , 1998 . M. Reiter, V. Anupam, and A. Mayer. Detecting hit-shaving in click-through payment schemes. In USENIX, pages 155--166, 1998."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-008-9192-1"},{"key":"e_1_3_2_1_39_1","first-page":"127","volume-title":"USENIX","author":"Tolia N.","year":"2003","unstructured":"N. Tolia , M. Kozuch , M. Satyanarayanan , B. Karp , T. C. Bressoud , and A. Perrig . Opportunistic use of content addressable storage for distributed file systems . In USENIX , pages 127 -- 140 , 2003 . N. Tolia, M. Kozuch, M. Satyanarayanan, B. Karp, T. C. Bressoud, and A. Perrig. Opportunistic use of content addressable storage for distributed file systems. In USENIX, pages 127--140, 2003."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066207"}],"event":{"name":"EDBT '12: 15th International Conference on Extending Database Technology","acronym":"EDBT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2247596.2247624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:03Z","timestamp":1750236543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2247596.2247624"}},"subtitle":["a biased reservoir sampling based Bloom filter approach"],"short-title":[],"issued":{"date-parts":[[2012,3,27]]},"references-count":41,"alternative-id":["10.1145\/2247596.2247624","10.1145\/2247596"],"URL":"https:\/\/doi.org\/10.1145\/2247596.2247624","relation":{},"subject":[],"published":{"date-parts":[[2012,3,27]]},"assertion":[{"value":"2012-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}