On the Complexity of Package Recommendation Problems
Summary: Formalize package recommendations: multi-criteria selection, compatibility constraints, and utility/cost functions; support query-relaxation and vendor-adjustment suggestions. Prove tight combined/data-complexity bounds for decision, counting and computation tasks for top-k packages, exposing effects of package size, compatibility, and query expressiveness. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ting Deng (Beihang University)
- 2. Wenfei Fan (University of Edinburgh)
- 3. Floris Geerts (University of Antwerp)
BibTeX Citation
@inproceedings{deng_pods12,
address = {New York, NY, USA},
series = {{PODS} '12},
title = {{On the Complexity of Package Recommendation Problems}},
url = {https://dl.acm.org/doi/10.1145/2213556.2213592},
doi = {10.1145/2213556.2213592},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Deng, Ting and Fan, Wenfei and Geerts, Floris},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,596 | On the Complexity of Query Result Diversification | 2013 | VLDB | 7.2722683e-05 |
| 6,853 | Scalable Package Queries in Relational Database Systems | 2016 | VLDB | 5.7540003e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 499 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00017431827 |
| 1,636 | Relaxing Join and Selection Queries | 2006 | VLDB | 0.00010156479 |
| 2,585 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 8.3774452e-05 |
| 3,048 | FlexRecs: Expressing and Combining Flexible Recommendations | 2009 | SIGMOD | 7.815276e-05 |
| 3,608 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 7.2609441e-05 |
| 5,862 | RankSQL: Supporting Ranking Queries in Relational Database Management Systems | 2005 | VLDB | 6.0635561e-05 |
| 8,013 | Optimizing and Parallelizing Ranked Enumeration | 2011 | VLDB | 5.5073426e-05 |
| 8,071 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 5.4935818e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,657 | A Rank-Based Approach to Recommender System’s Top-K Queries with Uncertain Scores | 2025 | SIGMOD |
| 2 | 6,052 | Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings | 2018 | VLDB |
| 3 | 12,205 | Show Me the Money: Dynamic Recommendations for Revenue Maximization | 2014 | VLDB |
| 4 | 11,790 | Minimization of Classifier Construction Cost for Search Queries | 2020 | SIGMOD |
| 5 | 4,758 | Constructing and Exploring Composite Items | 2010 | SIGMOD |
| 6 | 9,073 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS |
| 7 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 8 | 3,596 | On the Complexity of Query Result Diversification | 2013 | VLDB |
| 9 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 10 | 12,206 | Generating Top-k Packages via Preference Elicitation | 2014 | VLDB |