{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:26:49Z","timestamp":1753439209617,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"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":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871596","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"1259-1268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Real-time memory efficient data redundancy removal algorithm"],"prefix":"10.1145","author":[{"given":"Vikas K.","family":"Garg","sequence":"first","affiliation":[{"name":"IBM Research, India, Bangalore, India"}]},{"given":"Ankur","family":"Narang","sequence":"additional","affiliation":[{"name":"IBM Research, India, New Delhi, India"}]},{"given":"Souvik","family":"Bhattacherjee","sequence":"additional","affiliation":[{"name":"IBM Research, India, New Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383075"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1268997"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89737-8_15"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945918_30"},{"key":"e_1_3_2_1_11_1","volume-title":"Queueing Systems, Volume I: Theory","author":"Kleinrock L.","year":"1975","unstructured":"L. Kleinrock . Queueing Systems, Volume I: Theory . Wiley Interscience , New York, NY, USA , 1975 . L. Kleinrock. Queueing Systems, Volume I: Theory. Wiley Interscience, New York, NY, USA, 1975."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354587"},{"key":"e_1_3_2_1_13_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_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594230"},{"key":"e_1_3_2_1_16_1","volume-title":"Introduction to Probability Models","author":"Ross S. M.","year":"2009","unstructured":"S. M. Ross . Introduction to Probability Models . Academic Press , tenth edition, 2009 . S. M. Ross. Introduction to Probability Models. Academic Press, tenth edition, 2009."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Toronto ON Canada","acronym":"CIKM '10"},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:47Z","timestamp":1750246787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":17,"alternative-id":["10.1145\/1871437.1871596","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871596","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}