DBScholar

Back to papers

On the Complexity of Query Result Diversification

Summary: Explores the complexity of query result diversification for relational queries under a bi-criteria relevance–diversity objective; defines existence, ranking, and counting of k-element diversified sets. Establishes tight bounds for several languages and three objectives, and notes tractable cases. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10909
Venue
VLDB
Year
2013
Pagerank
7.2722683e-05
Overall Rank
3,596 | 75.33%
DOI
10.14778/2536354.2536358

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{deng_vldb13,
        title = {{On the Complexity of Query Result Diversification}},
        author = {Deng, Ting and Fan, Wenfei},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {8},
        pages = {577--588},
        doi = {10.14778/2536354.2536358},
        url = {https://doi.org/10.14778/2536354.2536358},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers