Polynomial space counting problems
SIAM Journal on Computing
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Improving recommendation lists through topic diversification
WWW '05 Proceedings of the 14th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
RankSQL: supporting ranking queries in relational database management systems
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Addressing diverse user preferences in SQL-query-result navigation
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Evaluating rank joins with optimal cost
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
CARD: a decision-guidance framework and application for recommending composite alternatives
Proceedings of the 2008 ACM conference on Recommender systems
Proceedings of the Second ACM International Conference on Web Search and Data Mining
It takes variety to make a world: diversification in recommender systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
An axiomatic approach for result diversification
Proceedings of the 18th international conference on World wide web
Discrete Applied Mathematics
Efficient Computation of Diverse Query Results
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Recommendation Diversification Using Explanations
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
FlexRecs: expressing and combining flexible recommendations
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Structured search result differentiation
Proceedings of the VLDB Endowment
PerK: personalized keyword search in relational databases through preferences
Proceedings of the 13th International Conference on Extending Database Technology
DivQ: diversification for keyword search over structured databases
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
ACM SIGMOD Record
Efficient diversification of web search results
Proceedings of the VLDB Endowment
Efficient and generic evaluation of ranked queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
On query result diversification
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Recommendation systems with complex constraints: A course recommendation perspective
ACM Transactions on Information Systems (TOIS)
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
On the complexity of package recommendation problems
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
Query result diversification is a bi-criteria optimization problem for ranking query results. Given a database D, a query Q and a positive integer k, it is to find a set of k tuples from Q(D) such that the tuples are as relevant as possible to the query, and at the same time, as diverse as possible to each other. Subsets of Q(D) are ranked by an objective function defined in terms of relevance and diversity. Query result diversification has found a variety of applications in databases, information retrieval and operations research. This paper studies the complexity of result diversification for relational queries. We identify three problems in connection with query result diversification, to determine whether there exists a set of k tuples that is ranked above a bound with respect to relevance and diversity, to assess the rank of a given k-element set, and to count how many k-element sets are ranked above a given bound. We study these problems for a variety of query languages and for three objective functions. We establish the upper and lower bounds of these problems, all matching, for both combined complexity and data complexity. We also investigate several special settings of these problems, identifying tractable cases.