Progressive ranking of range aggregates

Hua Gang Li, Hailing Yu, Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Ranking-aware queries have been gaining much attention recently in many applications such as multimedia databases, search engines and data streams. They are, however, not only restricted to such applications but are also very useful in On-Line Analytical Processing (OLAP) applications. In this paper, we introduce aggregation ranking queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked order of the aggregated values. For instance, an advertiser might be interested in the top-k publishers over the last three months in terms of sales obtained through the online advertisements placed on the publishers. They differ from range aggregate queries in that range aggregate queries are mainly concerned with an aggregate operator such as SUM and MIN/MAX over the selected ranges of all dimensions in the data cubes. Existing techniques for range aggregate queries are not able to process aggregation ranking queries efficiently. Hence, in this paper we propose new algorithms to handle this problem. The essence of the proposed algorithms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.

Original languageEnglish
Pages (from-to)4-25
Number of pages22
JournalData and Knowledge Engineering
Volume63
Issue number1
DOIs
Publication statusPublished - 1 Oct 2007
Externally publishedYes

Fingerprint

Agglomeration
Data warehouses
Search engines
Sales
Ranking
Query
Processing
Costs
Online advertisement
Data cube

Keywords

  • Aggregation
  • Data cube
  • Data warehousing
  • On-line analytical processing

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Progressive ranking of range aggregates. / Li, Hua Gang; Yu, Hailing; Agrawal, Divyakant; Abbadi, Amr El.

In: Data and Knowledge Engineering, Vol. 63, No. 1, 01.10.2007, p. 4-25.

Research output: Contribution to journalArticle

Li, HG, Yu, H, Agrawal, D & Abbadi, AE 2007, 'Progressive ranking of range aggregates', Data and Knowledge Engineering, vol. 63, no. 1, pp. 4-25. https://doi.org/10.1016/j.datak.2006.10.008
Li, Hua Gang ; Yu, Hailing ; Agrawal, Divyakant ; Abbadi, Amr El. / Progressive ranking of range aggregates. In: Data and Knowledge Engineering. 2007 ; Vol. 63, No. 1. pp. 4-25.
@article{62fc46c641b24d8aa4ac428207ead523,
title = "Progressive ranking of range aggregates",
abstract = "Ranking-aware queries have been gaining much attention recently in many applications such as multimedia databases, search engines and data streams. They are, however, not only restricted to such applications but are also very useful in On-Line Analytical Processing (OLAP) applications. In this paper, we introduce aggregation ranking queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked order of the aggregated values. For instance, an advertiser might be interested in the top-k publishers over the last three months in terms of sales obtained through the online advertisements placed on the publishers. They differ from range aggregate queries in that range aggregate queries are mainly concerned with an aggregate operator such as SUM and MIN/MAX over the selected ranges of all dimensions in the data cubes. Existing techniques for range aggregate queries are not able to process aggregation ranking queries efficiently. Hence, in this paper we propose new algorithms to handle this problem. The essence of the proposed algorithms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.",
keywords = "Aggregation, Data cube, Data warehousing, On-line analytical processing",
author = "Li, {Hua Gang} and Hailing Yu and Divyakant Agrawal and Abbadi, {Amr El}",
year = "2007",
month = "10",
day = "1",
doi = "10.1016/j.datak.2006.10.008",
language = "English",
volume = "63",
pages = "4--25",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Progressive ranking of range aggregates

AU - Li, Hua Gang

AU - Yu, Hailing

AU - Agrawal, Divyakant

AU - Abbadi, Amr El

PY - 2007/10/1

Y1 - 2007/10/1

N2 - Ranking-aware queries have been gaining much attention recently in many applications such as multimedia databases, search engines and data streams. They are, however, not only restricted to such applications but are also very useful in On-Line Analytical Processing (OLAP) applications. In this paper, we introduce aggregation ranking queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked order of the aggregated values. For instance, an advertiser might be interested in the top-k publishers over the last three months in terms of sales obtained through the online advertisements placed on the publishers. They differ from range aggregate queries in that range aggregate queries are mainly concerned with an aggregate operator such as SUM and MIN/MAX over the selected ranges of all dimensions in the data cubes. Existing techniques for range aggregate queries are not able to process aggregation ranking queries efficiently. Hence, in this paper we propose new algorithms to handle this problem. The essence of the proposed algorithms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.

AB - Ranking-aware queries have been gaining much attention recently in many applications such as multimedia databases, search engines and data streams. They are, however, not only restricted to such applications but are also very useful in On-Line Analytical Processing (OLAP) applications. In this paper, we introduce aggregation ranking queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked order of the aggregated values. For instance, an advertiser might be interested in the top-k publishers over the last three months in terms of sales obtained through the online advertisements placed on the publishers. They differ from range aggregate queries in that range aggregate queries are mainly concerned with an aggregate operator such as SUM and MIN/MAX over the selected ranges of all dimensions in the data cubes. Existing techniques for range aggregate queries are not able to process aggregation ranking queries efficiently. Hence, in this paper we propose new algorithms to handle this problem. The essence of the proposed algorithms is based on both ranking and cumulative information to progressively rank aggregation results. Furthermore we empirically evaluate our techniques and the experimental results show that the query cost is improved significantly.

KW - Aggregation

KW - Data cube

KW - Data warehousing

KW - On-line analytical processing

UR - http://www.scopus.com/inward/record.url?scp=34250335087&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250335087&partnerID=8YFLogxK

U2 - 10.1016/j.datak.2006.10.008

DO - 10.1016/j.datak.2006.10.008

M3 - Article

AN - SCOPUS:34250335087

VL - 63

SP - 4

EP - 25

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

IS - 1

ER -