Affiliation:
1. Yahoo! Research Barcelona, Spain
2. EPFL, Switzerland
3. INRIA Rennes Bretagne-Atlantique, France
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.
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Reference35 articles.
1. Toward personalized peer-to-peer top-k processing
2. Gossiping personalized queries
3. Peer-to-peer information search: Semantic, social, or spiritual? IEEE Data;Bender M.;Engin. Bull.,2007
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. K Nearest Neighbour Joins for Big Data on MapReduce: A Theoretical and Experimental Analysis;IEEE Transactions on Knowledge and Data Engineering;2016-09-01
2. Nearest Neighbors Graph Construction: Peer Sampling to the Rescue;Networked Systems;2016
3. Work in Progress;Proceedings of the 2016 ACM International Workshop on Attribute Based Access Control - ABAC '16;2016
4. Want to scale in centralized systems? Think P2P;Journal of Internet Services and Applications;2015-08
5. Solutions for Processing K Nearest Neighbor Joins for Massive Data on MapReduce;2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing;2015-03