Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Combining fuzzy information: an overview
ACM SIGMOD Record
Communications of the ACM
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Adaptive web search based on user profile constructed without any effort from users
Proceedings of the 13th international conference on World Wide Web
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
MINERVA: collaborative P2P search
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Personalized Search Based on User Search Histories
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
ACM Transactions on Computer Systems (TOCS)
Personalized query expansion for the web
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Characterizing the value of personalizing search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Tag data and personalized information retrieval
Proceedings of the 2008 ACM workshop on Search in social media
Toward personalized peer-to-peer top-k processing
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Web search personalization via social bookmarking and tagging
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Epidemic-Style management of semantic overlays for content-based searching
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
P2Prec: a P2P recommendation system for large-scale data sharing
Transactions on large-scale data- and knowledge-centered systems III
Asynchronous peer-to-peer data mining with stochastic gradient descent
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Collaborative personalized top-k processing
ACM Transactions on Database Systems (TODS)
Private similarity computation in distributed systems: from cryptography to differential privacy
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 0.00 |
This paper presents P3Q, a fully decentralized gossip-based protocol to personalize query processing in social tagging systems. P3Q dynamically associates each user with social acquaintances sharing similar tagging behaviours. 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 P3Q for top-k query processing. More specifically, we show that on a 10,000-user delicious trace, with little storage at each user, the queries are accurately computed within reasonable time and bandwidth consumption. We also report on the inherent ability of P3Q to cope with users updating profiles and departing.