On the Complexity of Query Result Diversification

被引:12
|
作者
Deng, Ting [1 ,2 ]
Fan, Wenfei [3 ,4 ]
机构
[1] Beihang Univ, SKLSDE, RCBD, Beijing, Peoples R China
[2] Beihang Univ, Sch Comp Sci & Engn, Beijing, Peoples R China
[3] Univ Edinburgh, Sch Informat, Lab Fdn Comp Sci, Edinburgh, Midlothian, Scotland
[4] Beihang Univ, Beijing, Peoples R China
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2014年 / 39卷 / 02期
基金
英国工程与自然科学研究理事会;
关键词
Design; Algorithms; Theory; Result diversification; relevance; diversity; recommender systems; database queries; combined complexity; data complexity; counting problems;
D O I
10.1145/2602136
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 article investigates the complexity of result diversification for relational queries. (1) 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 based on an objective function. (2) We study these problems for a variety of query languages and for the three objective functions proposed in Gollapudi and Sharma [2009]. We establish the upper and lower bounds of these problems, all matching, for both combined complexity and data complexity. (3) We also investigate several special settings of these problems, identifying tractable cases. Moreover, (4) we reinvestigate these problems in the presence of compatibility constraints commonly found in practice, and provide their complexity in all these settings.
引用
收藏
页数:46
相关论文
共 50 条
  • [1] On the Complexity of Query Result Diversification
    Deng, Ting
    Fan, Wenfei
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (08): : 577 - 588
  • [2] On Query Result Diversification
    Vieira, Marcos R.
    Razente, Humberto L.
    Barioni, Maria C. N.
    Hadjieleftheriou, Marios
    Srivastava, Divesh
    Traina, Caetano, Jr.
    Tsotras, Vassilis J.
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 1163 - 1174
  • [3] A survey of query result diversification
    Kaiping Zheng
    Hongzhi Wang
    Zhixin Qi
    Jianzhong Li
    Hong Gao
    Knowledge and Information Systems, 2017, 51 : 1 - 36
  • [4] A survey of query result diversification
    Zheng, Kaiping
    Wang, Hongzhi
    Qi, Zhixin
    Li, Jianzhong
    Gao, Hong
    KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 51 (01) : 1 - 36
  • [5] A Query Performance Analysis for Result Diversification
    He, Jiyin
    Bron, Marc
    De Rijke, Maarten
    ADVANCES IN INFORMATION RETRIEVAL THEORY, 2011, 6931 : 351 - +
  • [6] Diversification of Keyword Query Result Patterns
    Aksoy, Cem
    Dass, Ananya
    Theodoratos, Dimitri
    Wu, Xiaoying
    WEB-AGE INFORMATION MANAGEMENT, PT II, 2016, 9659 : 171 - 183
  • [7] Search Result Diversification Based on Query Facets
    Sha Hu
    Zhi-Cheng Dou
    Xiao-Jie Wang
    Ji-Rong Wen
    Journal of Computer Science and Technology, 2015, 30 : 888 - 901
  • [8] Query Subtopic Mining for Search Result Diversification
    Ullah, Md Zia
    Aono, Masaki
    2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA), 2014, : 309 - 314
  • [9] Search Result Diversification Based on Query Facets
    Hu, Sha
    Dou, Zhi-Cheng
    Wang, Xiao-Jie
    Wen, Ji-Rong
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2015, 30 (04) : 888 - 901
  • [10] Search Result Diversification Using Query Aspects as Bottlenecks
    Yu, Puxuan
    Rahimi, Razieh
    Huang, Zhiqi
    Allan, James
    PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, : 3040 - 3051