{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:29:29Z","timestamp":1767374969777},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169540"},{"type":"electronic","value":"9783642169557"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16955-7_10","type":"book-chapter","created":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T07:40:48Z","timestamp":1290757248000},"page":"191-211","source":"Crossref","is-referenced-by-count":34,"title":["The Gossple Anonymous Social Network"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bertier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Frey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Leroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Web 2.0, www.citeulike.org , www.delicious.com , www.flickr.com , www.last.fm"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Yildirim, H., Krishnamoorthy, M.S.: A random walk method for alleviating the sparsity problem in collaborative filtering. In: RecSys, pp. 131\u2013138 (2008)","DOI":"10.1145\/1454008.1454031"},{"key":"10_CR3","unstructured":"Cattuto, C., Benz, D., Hotho, A., Stumme, G.: Semantic analysis of tag similarity measures in collaborative tagging systems. In: OLP3, pp. 39\u201343 (2008)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Zanardi, V., Capra, L.: Social ranking: uncovering relevant content using tag-based recommender systems. In: RecSys, pp. 51\u201358 (2008)","DOI":"10.1145\/1454008.1454018"},{"issue":"2","key":"10_CR5","first-page":"51","volume":"30","author":"M. Bender","year":"2007","unstructured":"Bender, M., Crecelius, T., Kacimi, M., Miche, S., Xavier Parreira, J., Weikum, G.: Peer-to-peer information search: Semantic, social, or spiritual? TCDE\u00a030(2), 51\u201360 (2007)","journal-title":"TCDE"},{"key":"10_CR6","unstructured":"McGill, M., Salton, G.: Introduction to modern information retrieval (1986)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. TOCS\u00a025(3) (2007)","DOI":"10.1145\/1275517.1275520"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: byzantine resilient random membership sampling. In: PODC, pp. 145\u2013154 (2008)","DOI":"10.1145\/1400751.1400772"},{"issue":"7","key":"10_CR9","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. CACM\u00a013(7), 422\u2013426 (1970)","journal-title":"CACM"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: SP, pp. 44\u201359 (1997)","DOI":"10.1109\/SECPRI.1997.601314"},{"issue":"3","key":"10_CR11","first-page":"576","volume":"16","author":"H. Yu","year":"2008","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.D.: Sybilguard: defending against sybil attacks via social networks. TON\u00a016(3), 576\u2013589 (2008)","journal-title":"TON"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Handurukande, S.B., Kermarrec, A.M., Le Fessant, F., Massoulie, L., Patarin, S.: Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems. In: EuroSys, pp. 359\u2013371 (2006)","DOI":"10.1145\/1217935.1217970"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Europar, pp. 1143\u20131152 (2005)","DOI":"10.1007\/11549468_125"},{"issue":"1-7","key":"10_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Preda, M., Cobena, G.: Adaptive on-line page importance computation. In: WWW, pp. 280\u2013290 (2003)","DOI":"10.1145\/775152.775192"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D. Fogaras","year":"2005","unstructured":"Fogaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics\u00a02(3), 333\u2013358 (2005)","journal-title":"Internet Mathematics"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Benedikt, M., Lakshmanan, L., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. In: VLDB, pp. 710\u2013721 (2008)","DOI":"10.14778\/1453856.1453934"},{"key":"10_CR18","unstructured":"Mislove, A., Gummadi, K.P., Druschel, P.: Exploiting social networks for internet search. In: HotNets (2006)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: IMC, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Ahn, Y.Y., Han, S., Kwak, H., Moon, S., Jeong, H.: Analysis of topological characteristics of huge online social networking services. In: WWW, pp. 835\u2013844 (2007)","DOI":"10.1145\/1242572.1242685"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Khambatti, M., Ryu, K.D., Dasgupta, P.: Structuring peer-to-peer networks using interest-based communities. In: DBISP2P, pp. 48\u201363 (2003)","DOI":"10.1007\/978-3-540-24629-9_5"},{"key":"10_CR22","first-page":"2166","volume":"3","author":"K. Sripanidkulchai","year":"2003","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. INFOCOM\u00a03, 2166\u20132176 (2003)","journal-title":"INFOCOM"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. In: SPAA, pp. 271\u2013272 (2004)","DOI":"10.1145\/1007912.1007955"},{"issue":"6","key":"10_CR24","first-page":"821","volume":"19","author":"G. Chen","year":"2008","unstructured":"Chen, G., Low, C.P., Yang, Z.: Enhancing search performance in unstructured p2p networks based on users\u2019 common interest. TPDS\u00a019(6), 821\u2013836 (2008)","journal-title":"TPDS"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Sedmidubsky, J., Barton, S., Dohnal, V., Zezula, P.: Adaptive approximate similarity searching through metric social networks. In: ICDE, pp. 1424\u20131426 (2008)","DOI":"10.1109\/ICDE.2008.4497577"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Eyal, A., Gal, A.: Self organizing semantic topologies in p2p data integration systems. In: ICDE, pp. 1159\u20131162 (2009)","DOI":"10.1109\/ICDE.2009.190"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Jin, H., Ning, X., Chen, H.: Efficient search for peer-to-peer information retrieval using semantic small world. In: WWW, pp. 1003\u20131004 (2006)","DOI":"10.1145\/1135777.1135986"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11558989_18","volume-title":"Peer-to-Peer Systems IV","author":"S. Le-Blond","year":"2005","unstructured":"Le-Blond, S., Guillaume, J.L., Latapy, M.: Clustering in p2p exchanges and consequences on performances. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 193\u2013204. Springer, Heidelberg (2005)"},{"issue":"13","key":"10_CR29","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1016\/j.comnet.2009.03.018","volume":"53","author":"J.A. Patel","year":"2009","unstructured":"Patel, J.A., Rivi\u00e8re, \u0141., Gupta, I., Kermarrec, A.M.: Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems. Computer Networks\u00a053(13), 2304\u20132320 (2009)","journal-title":"Computer Networks"},{"key":"10_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11574781_1","volume-title":"Agents and Peer-to-Peer Computing","author":"A. Crespo","year":"2005","unstructured":"Crespo, A., Garcia-Molina, H.: Semantic overlay networks for p2p systems. In: Moro, G., Bergamaschi, S., Aberer, K. (eds.) AP2PC 2004. LNCS (LNAI), vol.\u00a03601, pp. 1\u201313. Springer, Heidelberg (2005)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Banaei-Kashani, F., Shahabi, C.: Swam: a family of access methods for similarity-search in peer-to-peer data networks. In: CIKM, pp. 304\u2013313 (2004)","DOI":"10.1145\/1031171.1031236"},{"issue":"6","key":"10_CR32","first-page":"735","volume":"19","author":"M. Li","year":"2008","unstructured":"Li, M., Lee, W.C., Sivasubramaniam, A., Zhao, J.: Ssw: A small-world-based overlay for peer-to-peer search. TPDS\u00a019(6), 735\u2013749 (2008)","journal-title":"TPDS"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Carman, M., Baillie, M., Crestani, F.: Tag data and personalized information retrieval. In: SSM, pp. 27\u201334 (2008)","DOI":"10.1145\/1458583.1458591"},{"key":"10_CR34","unstructured":"Jie, H., Zhang, Y.: Personalized faceted query expansion. In: SIGIR (2006)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Bender, M., Crecelius, T., Kacimi, M., Michel, S., Neumann, T., Parreira, J.X., Schenkel, R., Weikum, G.: Exploiting social relations for query expansion and result ranking. In: ICDE Workshops, pp. 501\u2013506 (2008)","DOI":"10.1109\/ICDEW.2008.4498369"}],"container-title":["Lecture Notes in Computer Science","Middleware 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16955-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:23:06Z","timestamp":1559834586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16955-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169540","9783642169557"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16955-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}