A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Modern Information Retrieval
Combining fuzzy information: an overview
ACM SIGMOD Record
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
SIAM Journal on Discrete Mathematics
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
High-performance complex event processing over streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Probe Minimization by Schedule Optimization: Supporting Top-K Queries with Expensive Predicates
IEEE Transactions on Knowledge and Data Engineering
Joining ranked inputs in practice
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Tag-based social interest discovery
Proceedings of the 17th international conference on World Wide Web
Exploring social annotations for information retrieval
Proceedings of the 17th international conference on World Wide Web
Individual and social behavior in tagging systems
Proceedings of the 20th ACM conference on Hypertext and hypermedia
RichVSM: enRiched vector space models for folksonomies
Proceedings of the 20th ACM conference on Hypertext and hypermedia
Toward personalized query expansion
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
Learning similarity metrics for event identification in social media
Proceedings of the third ACM international conference on Web search and data mining
On managing social data for enabling socially-aware applications and services
Proceedings of the 3rd Workshop on Social Network Systems
The social bookmark and publication management system bibsonomy
The VLDB Journal — The International Journal on Very Large Data Bases
Evolutionary taxonomy construction from dynamic tag space
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Query expansion in folksonomies
SAMT'10 Proceedings of the 5th international conference on Semantic and digital media technologies
Workload-aware indexing for keyword search in social networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Private similarity computation in distributed systems: from cryptography to differential privacy
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
A social inverted index for social-tagging-based information retrieval
Journal of Information Science
Peer-to-peer distributed text classifier learning in PADMINI
Statistical Analysis and Data Mining
RssE-Miner: a new approach for efficient events mining from social media RSS feeds
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
BLIP: non-interactive differentially-private similarity computation on bloom filters
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Profile diversity in search and recommendation
Proceedings of the 22nd international conference on World Wide Web companion
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network of taggers related to a seeker. In this paper, we present the first in-depth study of network-aware search. We investigate efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network. We argue that obvious adaptations of top-k algorithms are too space-intensive, due to the dependence of scores on the seeker's network. We therefore develop algorithms based on maintaining score upper-bounds. The global upper-bound approach maintains a single score upper-bound for every pair of item and tag, over the entire collection of users. The resulting bounds are very coarse. We thus investigate clustering seekers based on similar behavior of their networks. We show that finding the optimal clustering of seekers is intractable, but we provide heuristic methods that give substantial time improvements. We then give an optimization that can benefit smaller populations of seekers based on clustering of taggers. Our results are supported by extensive experiments on del.icio.us datasets.