research-article

Collaborative personalized top-k processing

Authors:

Rachid Guerraoui,

Anne-Marie Kermarrec,

Vincent LeroyAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 36, Issue 4

Article No.: 26, Pages 1 - 38

https://doi.org/10.1145/2043652.2043659

Published: 19 December 2011 Publication History

Abstract

This article presents P4Q, a fully decentralized gossip-based protocol to personalize query processing in social tagging systems. P4Q dynamically associates each user with social acquaintances sharing similar tagging behaviors. Queries are gossiped among such acquaintances, computed on-the-fly in a collaborative, yet partitioned manner, and results are iteratively refined and returned to the querier. Analytical and experimental evaluations convey the scalability of P4Q for top-k query processing, as well its inherent ability to cope with users updating profiles and departing.

References

[1]

Amer-Yahia, S., Benedikt, M., Lakshmanan, V., and Stoyanovic, J. 2008a. Efficient network aware search in collaborative tagging sites. In Proceedings of the 34st International Conference on Very Large Databases (VLDB'08). 710--721.

[2]

Amer-Yahia, S., Marlow, C., Yu, C., and Stoyanovich, J. 2008b. Leveraging tagging to model user interests in del.icio.us. In Proceedings of the AAAI International Conference on Social Information Proceeding (AAAI SIP'08).

[3]

Bai, X., Bertier, M., Guerraoui, R., and Kermarrec, A. 2009. Toward peer-to-peer personalized top-k processing. In Proceedings of the 2nd ACM EuroSys Workshop on Social Networks Systems (SNS'09). 1--6.

Digital Library

[4]

Bai, X., Bertier, M., Guerraoui, R., Kermarrec, A.-M., and Leroy, V. 2010. Gossiping personalized queries. In Proceedings of the 13th International Conference on Extending Database Technology (EDBT'10). 87--98.

Digital Library

[5]

Bender, M., Crecelius, T., Kacimi, M., Miche, S., Xavier Parreira, J., and Weikum, G. 2007. Peer-to-peer information search: Semantic, social, or spiritual&quest; IEEE Data Engin. Bull. 30, 2, 51--60.

[6]

Bender, M., Michel, S., Triantafillou, P., Weikum, G., and Zimmer, C. 2005. MINERVA: Collaborative P2P search. In Proceedings of the 31st International Conference on Very Large Databases (VLDB'05). 1263--1266.

Digital Library

[7]

Bloom, B. H. 1970. Space/Time trade-offs in hash coding with allowable errors. Comm. ACM 13, 7, 422--426.

Digital Library

[8]

Carman, M., M.Baillie, and Crestani, F. 2008. Tag data and personalized information retrieval. In Proceedings of the CIKM Workshop on Search in Social Media (SSM'08). 27--34.

Digital Library

[9]

Chirita, P. A., Firan, C. S., and Nejdl, W. 2007. Personalized query expansion for the web. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'07). 7--14.

Digital Library

[10]

Cuenca-acuna, F. M., Peery, C., Martin, R. P., and Nguyen, T. D. 2003. PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities. In Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC'03). 236--246.

Digital Library

[11]

Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M. F., and Morris, R. 2004. Designing a DHT for low latency and high throughput. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI'04). 85--98.

Digital Library

[12]

Dou, Z., Song, R., and Wen, J.-R. 2007. A large-scale evaluation and analysis of personalized search strategies. In Proceedings of the 16th International Conference on World Wide Web (WWW'07). 581--590.

Digital Library

[13]

Eugster, P. T., Guerraoui, R., Kermarrec, A. M., and Massoulie, L. 2004. Epidemic information dissemination in distributed systems. IEEE Comput. 37, 5, 60--67.

Digital Library

[14]

Fagin, R. 2002. Combining fuzzy information: An overview. SIGMOD Rec. 31, 2, 109--118.

Digital Library

[15]

Frey, D., Guerraoui, R., Kermarrec, A., Monod, M., and Quéma, V. 2009. Stretching gossip with live streaming. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'09). 259--264.

[16]

Jelasity, M. 2004. An approach to massively distributed aggregate computing on peer-to-peer networks. In Proceedings of the 12th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP'O4). 200--207.

[17]

Jelasity, M., Montresor, A., Jesi, G., and Voulgaris, S. 2004. The Peersim simulator. http://peersim.sf.net.

[18]

Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A., and van Steen, M. 2007. Gossip-Based peer sampling. ACM Trans. Comput. Syst. 25, 3, 8.

Digital Library

[19]

Lawrence, S. 2000. Context in web search. IEEE Data Engin. Bull. 23, 25--32.

[20]

Loupasakis, A., Ntarmos, N., and Triantafillou, P. 2011. eXO: Decentralized autonomous scalable social networking. In Proceedings of the 5th Biennial Conference on Innovative Data Systems Research (CIDR'11). 85--95.

[21]

Michel, S., Triantafillou, P., and Weikum, G. 2005. KLEE: A framework for distributed top-k query algorithms. In Proceedings of the 31st International Conference on Very Large Databases (VLDB'05). 637--648.

Digital Library

[22]

Mislove, A., Gummadi, K., and Druschel, P. 2006. Exploiting social networks for internet search. In Proceedings of the 5th ACM Workshop on Hot Topics in Networks (HotNets'06). 79--85.

[23]

Mislove, A., Marcon, M., Gummadi, K., Druschel, P., and Bhattacharjee, B. 2007. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement (IMC'07). 29--42.

Digital Library

[24]

Montresor, A. and Jelasity, M. 2009. PeerSim: A scalable P2P simulator. In Proceedings of the 9th International Conference on Peer-to-Peer (P2P'09). 99--100.

[25]

Noll, M. and Meinel, C. 2007. Web search personalization via social bookmarking and tagging. In Proceedings of the 6th International and 2nd Asian Semantic Web Conference (ISWC'07 + ASWC'07). 365--378.

Digital Library

[26]

Pitkow, J., Schütze, H., Cass, T., Cooley, R., Turnbull, D., Edmonds, A., Adar, E., and Breuel, T. 2002. Personalized search. Comm. ACM 45, 9, 50--55.

Digital Library

[27]

Schenkel, R., Crecelius, T., Kacimi, M., Michel, S., Neumann, T., Parreira, J. X., and Weikum, G. 2008. Efficient top-k querying over social-tagging networks. In Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'08). 523--530.

Digital Library

[28]

Speretta, M. and Gauch, S. 2005. Personalized search based on user search histories. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence (WI'05). 622--628.

Digital Library

[29]

Sugiyama, K., Hatano, K., and Yoshikawa, M. 2004. Adaptive web search based on user profile constructed without any effort from users. In Proceedings of the 13th International Conference on World Wide Web (WWW'04). 675--684.

Digital Library

[30]

Tan, G. and Jarvis, S. A. 2007. Improving the fault resilience of overlay multicast for media streaming. IEEE Trans. Parall. Distrib. Syst. 18, 721--734.

Digital Library

[31]

Teevan, J., Dumais, S. T., and Horvitz, E. 2007. Characterizing the value of personalizing search. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'07). 757--758.

Digital Library

[32]

Vlachou, A., Doulkeridis, C., Norvag, K., and Vazirgiannis, M. 2008. On efficient top-k query processing in highly distributed environments. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'08). 753--764.

Digital Library

[33]

Voulgaris, S. and van Steen, M. 2005. Epidemic-Style management of semantic overlays for content-based searching. In Proceedings of the 11th International European Conference on Parallel and Distributed Computing (Euro-Par'05). 1143--1152.

Digital Library

[34]

Witten, I. H., Moffat, A., and Bell, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers.

Digital Library

[35]

Zegura, E., Calvert, K., and Bhattacharjee, S. 1996. How to model an internetwork. In Proceedings of the 15th International Conference on Computer Communications (INFOCOM'96). 594--602.

Digital Library

Cited By

Song GRochas JBeze LHuet FMagoules F(2019)K Nearest Neighbour Joins for Big Data on MapReduceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.256262728:9(2376-2392)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1109/TKDE.2016.2562627
Benkaouz YErradi MFreisleben BBertino ESandhu RKrishnan R(2016)Work in ProgressProceedings of the 2016 ACM International Workshop on Attribute Based Access Control10.1145/2875491.2875497(72-75)Online publication date: 11-Mar-2016
https://dl.acm.org/doi/10.1145/2875491.2875497
Benkaouz YErradi MKermarrec A(2016)Nearest Neighbors Graph Construction: Peer Sampling to the RescueNetworked Systems10.1007/978-3-319-46140-3_4(48-62)Online publication date: 15-Sep-2016
https://doi.org/10.1007/978-3-319-46140-3_4
Show More Cited By

Index Terms

Collaborative personalized top-k processing

Recommendations

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

The rapidly increasing amount of user-generated content in social tagging systems provides a huge source of information. Yet, performing effective search in these systems is very challenging, especially when we seek the most appropriate items that match ...
Distributed collaborative filtering for peer-to-peer file sharing systems
SAC '06: Proceedings of the 2006 ACM symposium on Applied computing

Collaborative filtering requires a centralized rating database. However, within a peer-to-peer network such a centralized database is not readily available. In this paper, we propose a fully distributed collaborative filtering method that is self-...
Cost-effective broadcast for fully decentralized peer-to-peer networks

Fully unstructured and decentralized peer-to-peer networks such as Gnutella are appealing for a variety of applications, among which file-sharing is the most prominent one. The decentralized nature of these systems provides a high degree of robustness ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 36, Issue 4

December 2011

271 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/2043652

Issue’s Table of Contents

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 December 2011

Accepted: 01 July 2011

Revised: 01 April 2011

Received: 01 October 2010

Published in TODS Volume 36, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

European Research Council

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
394
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song GRochas JBeze LHuet FMagoules F(2019)K Nearest Neighbour Joins for Big Data on MapReduceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.256262728:9(2376-2392)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1109/TKDE.2016.2562627
Benkaouz YErradi MFreisleben BBertino ESandhu RKrishnan R(2016)Work in ProgressProceedings of the 2016 ACM International Workshop on Attribute Based Access Control10.1145/2875491.2875497(72-75)Online publication date: 11-Mar-2016
https://dl.acm.org/doi/10.1145/2875491.2875497
Benkaouz YErradi MKermarrec A(2016)Nearest Neighbors Graph Construction: Peer Sampling to the RescueNetworked Systems10.1007/978-3-319-46140-3_4(48-62)Online publication date: 15-Sep-2016
https://doi.org/10.1007/978-3-319-46140-3_4
Song GRochas JHuet FMagoulès F(2015)Solutions for Processing K Nearest Neighbor Joins for Massive Data on MapReduceProceedings of the 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing10.1109/PDP.2015.79(279-287)Online publication date: 4-Mar-2015
https://dl.acm.org/doi/10.1109/PDP.2015.79
Servajean MPacitti ELiroz-Gistau MAmer-Yahia SAbbadi A(2015)Increasing Coverage in Distributed Search and Recommendation with Profile DiversityTransactions on Large-Scale Data- and Knowledge-Centered Systems XXII - Volume 943010.1007/978-3-662-48567-5_4(115-144)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-662-48567-5_4
Bai XGuerraoui RKermarrec A(2014)Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging NetworkACM Transactions on Internet Technology (TOIT)10.1145/260257213:4(1-36)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1145/2602572
Servajean MPacitti ELiroz-Gistau MAmer-Yahia SEl Abbadi A(2014)Exploiting Diversification in Gossip-Based RecommendationData Management in Cloud, Grid and P2P Systems10.1007/978-3-319-10067-8_3(25-36)Online publication date: 2014
https://doi.org/10.1007/978-3-319-10067-8_3
Servajean MPacitti EAmer-Yahia SNeveu PSchwabe DAlmeida VGlaser HBaeza-Yates RMoon S(2013)Profile diversity in search and recommendationProceedings of the 22nd International Conference on World Wide Web10.1145/2487788.2488094(973-980)Online publication date: 13-May-2013
https://dl.acm.org/doi/10.1145/2487788.2488094
Kermarrec A(2013)Towards a personalized Internet: a case for a full decentralizationPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences10.1098/rsta.2012.0380371:1987(20120380-20120380)Online publication date: 18-Feb-2013
https://doi.org/10.1098/rsta.2012.0380

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents