{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:47Z","timestamp":1725475187093},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692690"},{"type":"electronic","value":"9783540692706"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11965893_6","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T07:52:22Z","timestamp":1165477942000},"page":"74-88","source":"Crossref","is-referenced-by-count":1,"title":["Compact Samples for Data Dissemination"],"prefix":"10.1007","author":[{"given":"Tova","family":"Milo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assaf","family":"Sagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Verbin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., El Abbadi, A., Steinke, R.C.: Epidemic algorithms in replicated databases. In: PODS 1997 (1997)","DOI":"10.1145\/263661.263680"},{"key":"6_CR2","unstructured":"Bittorrent, http:\/\/bittorrent.com"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Byers, J.W., Considine, J., Mitzenmacher, M., Rost, S.: Informed content delivery across adaptive overlay networks. In: SIGCOMM 2002 (2002)","DOI":"10.1145\/633025.633031"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Kermarrec, A.M., Rowstron, A.: SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE JSAC\u00a020(8) (October 2002)","DOI":"10.1109\/JSAC.2002.803069"},{"key":"6_CR5","unstructured":"Cohen, B.: Incentives build robustness in BitTorrent. In: Proc. of the Workshop on the Economics of P2P Systems, Berkeley, CA (2003)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM\u00a023(4), 864\u2013894 (1994)","journal-title":"SIAM"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dahlin, M.: Interpreting stale load information. In: The 19th IEEE Int. Conf. on Distributed Computing Systems (ICDCS) (May 1999)","DOI":"10.1109\/ICDCS.1999.776530"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Eugster, P., Handurukande, S., Guerraoui, R., Kermarrec, A., Kuznetsov, P.: Lightweight probabilistic broadcast. In: Proc. of The Int. Conf. on Dependable Systems and Networks (DSN 2001) (July 2001)","DOI":"10.1109\/DSN.2001.941428"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Eugster, P.T., Guerraoui, R.: Probabilistic multicast. In: Proc. of the Int. Conf. on Dependable Systems and Networks (DSN 2002) (June 2002)","DOI":"10.1109\/DSN.2002.1028915"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Fabret, F., Jacobsen, H.-A., Llirbat, F., Pereira, J., Ross, K., Shasha, D.: Filtering algorithms and implementation for very fast publish\/subscribe systems. In: Proc. of ACM SIGMOD 2001 (2001)","DOI":"10.1145\/375663.375677"},{"key":"6_CR11","unstructured":"Freedman, M.J., Freudenthal, E., Mazi\u00e9res, D.: Democratizing content publication with Coral. In: Proc. 1st USENIX\/ACM Symp. on Networked Systems Design and Implementation (NSDI 2004) (2004)"},{"key":"6_CR12","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM 2004 (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: 5th Int. Middleware Conference, Toronto (October 2004)","DOI":"10.1007\/978-3-540-30229-2_5"},{"key":"6_CR15","unstructured":"Kostic, D., Braud, R., Killian, C., Vandekieft, E., Anderson, J.W., Snoeren, A.C., Vahdat, A.: Maintaining high bandwidth under dynamic network conditions. In: USENIX (2005)"},{"key":"6_CR16","unstructured":"Kostic, D., Rodriguez, A., Albrecht, J., Bhirud, A., Vahdat, A.: Using random subsets to build scalable network services. In: Proc. of USITS 2003 (2003)"},{"key":"6_CR17","unstructured":"Milo, T., Sagi, A., Verbin, E.: Compact samples for data dissemination (full version). Tech. Report, http:\/\/www.cs.tau.ac.il\/milo\/work\/Samples.pdf"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Minsky, Y., Trachtenberg, A., Zippel, R.: Set reconciliation with nearly optimal communication complexity. In: Int. Symp. on Information Theory (June 2001)","DOI":"10.1109\/ISIT.2001.936095"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Petrovic, M., Liu, H., Jacobsen, H.: CMS-ToPSS: efficient dissemination of RSS documents. In: VLDB 2005 (2005)","DOI":"10.1145\/1060745.1060824"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1011494323443","volume":"4","author":"S. Ranganathan","year":"2001","unstructured":"Ranganathan, S., George, A.D., Todd, R.W., Chidester, M.C.: Gossip-style failure detection for scalable heterogeneous clusters. Cluster Computing\u00a04(3), 197\u2013209 (2001)","journal-title":"Cluster Computing"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Zhong, M., Shen, K., Seiferas, J.: Non-uniform random membership management in peer-to-peer networks. In: INFOCOM 2005 (2005)","DOI":"10.1109\/INFCOM.2005.1498342"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2013 ICDT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11965893_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T22:13:24Z","timestamp":1683670404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11965893_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692690","9783540692706"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11965893_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}