Supporting Ad-Hoc Ranking Aggregates. Chengkai Li (UIUC) joint work with Kevin Chang (UIUC) Ihab Ilyas (Waterloo). Ranking (Top-k) Queries. Find the top k answers with respect to a ranking function , which often is the aggregation of multiple criteria .
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Chengkai Li (UIUC)
joint work with
Kevin Chang (UIUC) Ihab Ilyas (Waterloo)
Find the top k answers with respect to a ranking function, which often is the aggregation of multiple criteria.
Ranking is important in many database applications:
Find the best hotel deals by price, distance, etc.
Find the most similar images by color, shape, texture, etc.
Find the most relevant records/documents/pages.
Find the top profitable customers to send ads.
SPJ queries (SELECT … FROM … WHERE … ORDER BY …)
top k groups instead of tuples.
(SELECT … FROM … WHERE … GROUP BY … ORDER BY …)
AVG(income*w1+age*w2+credit*w3) as score
GROUP BY zipcode
ORDER BY score
SELECT P.cateogy, S.zipcode,
MID_SUM(S.price - P.manufact_price)
FROM products P, sales S
GROUP BY P.category, S.zipcode
ORDER BY score
Ranking Condition : F=G(T)
MID_SUM (S.price - P.manufact_price)
w1, w2, w3 can be any values.
DSS applications are exploratory and interactive:
e.g., mid_sum cannot be derived from sum, avg, etc.
e.g., a+b does not help in doing a*b, and vice versa.
from the scratch
Select zipcode, AVG(income
Group By zipcode
Order By score
Goal: minimize the number of tuples processed. (Partial vs. full materialization)
rank- & group-aware operators
(b) New query plan.
(a) Traditional query plan.
There is a certain minimal number of tuples to retrieve before we can stop.
A non-trivial upper-bound is a must. (e.g., +infinity will not save anything.)
Upper-bound of a group indicates the best a group can achieve, thus tells us if it is going to make top-k or not.
Select g, SUM(v)
Group By g
Order By SUM(v)
Assumptions for getting a non-trivial upper-bound:
F[g] can be obtained by applying G over the maximal T of g’s members.
v <= 1.)
Though G(T) is ad-hoc, the Boolean conditions are shared in sessions of decision making.
Similar queries computed.
Pay as much as materialize-group-sort for the 1st query; amortized by the future similar queries.
Upper-Bound, Group-Ranking, and Tuple-Ranking
Minimal number of tuples processed