Database Paper Browser

Back to papers

Constrained Optimalities in Query Personalization

Summary: Constrained Query Personalization (CQP) introduces a constrained optimization framework for personalized database queries. It maps CQP to state-space search and offers algorithms to optimize a target while keeping other constraints within bounds; experiments validate. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3625
Venue
SIGMOD
Year
2005
Pagerank
4.6859276e-05
Overall Rank
7,662 | 46.70%
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,637 Context-Sensitive Ranking 2006 SIGMOD 6.0303293e-05
11,506 Robust Voice Querying with MUVE: Optimally Visualizing Results of Phonetically Similar Queries 2021 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0040449103
438 Query Optimization for Parallel Execution 1992 SIGMOD 0.00023199245
674 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00018327585
805 Evaluating Top-k Selection Queries 1999 VLDB 0.00016437265
Previous Page 1 / 1 Next

Semantically Similar Papers