Database Paper Browser

Back to papers

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)

Paper ID
1583
Venue
PODS
Year
2012
Pagerank
4.6562597e-05
Overall Rank
7,770 | 45.95%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,056 On the Complexity of Query Result Diversification 2013 VLDB 6.4883623e-05
7,888 Scalable Package Queries in Relational Database Systems 2016 VLDB 4.6254226e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers