Query optimization for parallel execution
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
Evaluation of Item-Based Top-N Recommendation Algorithms
Proceedings of the tenth international conference on Information and knowledge management
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Communications of the ACM
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Personalized web search by mapping user queries to categories
Proceedings of the eleventh international conference on Information and knowledge management
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Personalization of Queries in Database Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Learning and managing user context in personalized communications services
Proceedings of the international workshop in conjunction with AVI 2006 on Context in advanced interfaces
Query result ranking over e-commerce web databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficient computation of personal aggregate queries on blogs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Toward context and preference-aware location-based services
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Personalizing queries based on networks of composite preferences
ACM Transactions on Database Systems (TODS)
Introducing contexts into personalized web applications
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Relaxing queries based on XML structure and content preferences
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
Expert Systems with Applications: An International Journal
Flexible and extensible preference evaluation in database systems
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
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 parameters of concern is optimized while the others remain within the bounds of range constraints. Taking into account some key (exact or approximate) properties of these parameters, we map CQP to a state search problem and provide several algorithms for the discovery of optimal solutions. Experimental results demonstrate the effectiveness of the proposed techniques and the appropriateness of the overall approach.