Sciweavers

Share
SIGMOD
2005
ACM

Constrained Optimalities in Query Personalization

10 years 10 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically constructing queries that return results of high interest to the user. This, however, may conflict with other constraints on the query execution time and/or result size that may be imposed by the search context, such as the device used, the network connection, etc. For example, if the user is accessing information using a mobile phone, then it is desirable to construct a personalized query that executes quickly and returns a handful of answers. Constrained Query Personalization (CQP) is an integrated approach to database query answering that dynamically takes into account the queries issued, the user's interest in the results, response time, and result size in order to build personalized queries. In this paper, we introduce CQP as a family of constrained optimization problems, where each time one of the paramete...
Georgia Koutrika, Yannis E. Ioannidis
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2005
Where SIGMOD
Authors Georgia Koutrika, Yannis E. Ioannidis
Comments (0)
books