Preference evaluation techniques of preference queries in database
Preference queries are considered as a major necessity tool in today’s database management system (DBMS). Adopting preference queries in the database application systems enable users to determine more than one objective in the submitted query which result into more accurate results compared to the t...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IJoAT Foundation
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/36669/ http://irep.iium.edu.my/36669/ http://irep.iium.edu.my/36669/ http://irep.iium.edu.my/36669/4/The_Published_Version_%28Preference_Evaluation_Techniques_of_Preference_Queries_in_Database%29.pdf |
| Summary: | Preference queries are considered as a major necessity tool in today’s database management system (DBMS). Adopting preference queries in the database application systems enable users to determine more than one objective in the submitted query which result into more accurate results compared to the traditional queries. Preference queries prefer one data item (tuple) p over the other data item (tuple) q if and only if p is better than q in all dimensions (attributes) and not worse than q in at least one dimension (attribute). Several preference evaluation techniques for preference queries have been proposed which aimed at finding the “best” results that meet the user preferences. These include but not limited to top-k, skyline, ranked skylines, k-representative dominance, k-dominance, top-k dominating, and k-frequency. This paper attempts to survey and analyze the following preference evaluation techniques of query processing in database systems: top-k, skyline, top-k dominating, k-dominance, and k-frequency by highlighting the strengths and the weaknesses of each technique. |
|---|