Proceedings of the 17th International Conference on Data Engineering
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
IO-Top-k: index-access optimized top-k query processing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A context-aware preference model for database querying in an ambient intelligent environment
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
SQLf: a relational database language for fuzzy querying
IEEE Transactions on Fuzzy Systems
Hi-index | 0.00 |
This paper deals with the interpretation and processing of database queries with preference conditions of the form "attribute is low (resp. medium, high)" in the situation where the user is not aware of the actual content of the database but still wants to retrieve the best possible answers (relatively to that content). An approach to the definition of the terms "low", "medium" and "high" in a contextual and relative manner is introduced. A processing algorithm aimed at efficiently retrieving the top-k answers to such a query is also outlined.