Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Flexible and extensible preference evaluation in database systems
Levandoski J., Eldawy A., Mokbel M., Khalefa M. ACM Transactions on Database Systems38 (3):1-43,2013.Type:Article
Date Reviewed: Dec 17 2013

Recent database query languages have been designed to provide adaptable, helpful, and sophisticated instruments that produce query output sets better matched to user preferences or needs. This paper describes such an adaptable tool, FlexPref, which integrates preference declaration and evaluation with any query database processor. The tool extends a database query language to deal with several additional preference requirements, such as retrieving the k best or most frequent tuples, using a set of generic database operators. The work continues previous research of the authors to improve query optimization for preference processing, in terms of features such as cardinality and cost estimation, or theoretical formalization. The theoretical contributions of the paper include defining operating rules for preference methods against certain query operators, and analysis of the required properties to be fulfilled by them.

The FlexPref framework can be operated along with a database query language, after previous registration, by incorporating two supplementary clauses involving the preference criteria ([preferring]) and their attributes ([using] – [with]). Seven preference functions are considered: top-k, skyline, top-k dominating, k-dominance, k-frequency, and two state-of-the-art schemes (ε-dominance and k-representative skyline). Efficiency and optimization issues are surveyed individually for single-table, multiple-table, and sorted list access cases, in the context of select, join, or projection operators. (The aggregate or group-by structured query language (SQL) clauses will be examined in a future version.)

The proposed techniques for improving efficiency include pruning the join input tables according to the preference criteria, and pushing selection.

The experimental evaluation of the system (integrated into PostgreSQL) is performed against some custom implementations of the preference functions, and the results describe the observed benefits and drawbacks. FlexPref proves to be a valuable and useful instrument that eliminates redundant work and opens applications to new preference implementations.

Reviewer:  Svetlana Segarceanu Review #: CR141815 (1402-0148)
Bookmark and Share
  Featured Reviewer  
 
Query Processing (H.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Query Processing": Date
A correction of the termination conditions of the Henschen-Naqvi technique
Briggs D. Journal of the ACM 31(4): 711-719, 1984. Type: Article
Sep 1 1992
A compression technique to materialize transitive closure
Jagadish H. (ed) ACM Transactions on Database Systems 15(3): 558-598, 1990. Type: Article
Oct 1 1992
Efficient and optimal query answering on independent schemes
Atzeni P. (ed), Chan E. Theoretical Computer Science 77(3): 291-308, 1990. Type: Article
Nov 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy