Progressive ranking of range aggregates

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Ranking-aware queries have been gaining much attention recently in many applications such as search engines and data streams. They are, however, not only restricted to such applications but are also very useful in 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. 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
Title of host publicationLecture Notes in Computer Science
EditorsA.M. Tjoa, J. Trujillo
Pages179-189
Number of pages11
Volume3589
Publication statusPublished - 2005
Externally publishedYes
Event7th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2005 - Copenhagen, Denmark
Duration: 22 Aug 200526 Aug 2005

Other

Other7th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2005
CountryDenmark
CityCopenhagen
Period22/8/0526/8/05

Fingerprint

Agglomeration
Data warehouses
Search engines
Costs

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Li, H. G., Yu, H., Agrawal, D., & El Abbadi, A. (2005). Progressive ranking of range aggregates. In A. M. Tjoa, & J. Trujillo (Eds.), Lecture Notes in Computer Science (Vol. 3589, pp. 179-189)

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

Lecture Notes in Computer Science. ed. / A.M. Tjoa; J. Trujillo. Vol. 3589 2005. p. 179-189.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, HG, Yu, H, Agrawal, D & El Abbadi, A 2005, Progressive ranking of range aggregates. in AM Tjoa & J Trujillo (eds), Lecture Notes in Computer Science. vol. 3589, pp. 179-189, 7th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2005, Copenhagen, Denmark, 22/8/05.
Li HG, Yu H, Agrawal D, El Abbadi A. Progressive ranking of range aggregates. In Tjoa AM, Trujillo J, editors, Lecture Notes in Computer Science. Vol. 3589. 2005. p. 179-189
Li, Hua Gang ; Yu, Hailing ; Agrawal, Divyakant ; El Abbadi, Amr. / Progressive ranking of range aggregates. Lecture Notes in Computer Science. editor / A.M. Tjoa ; J. Trujillo. Vol. 3589 2005. pp. 179-189
@inproceedings{f5de4d7463354c2aab57125d45a45573,
title = "Progressive ranking of range aggregates",
abstract = "Ranking-aware queries have been gaining much attention recently in many applications such as search engines and data streams. They are, however, not only restricted to such applications but are also very useful in 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. 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.",
author = "Li, {Hua Gang} and Hailing Yu and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2005",
language = "English",
volume = "3589",
pages = "179--189",
editor = "A.M. Tjoa and J. Trujillo",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Progressive ranking of range aggregates

AU - Li, Hua Gang

AU - Yu, Hailing

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2005

Y1 - 2005

N2 - Ranking-aware queries have been gaining much attention recently in many applications such as search engines and data streams. They are, however, not only restricted to such applications but are also very useful in 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. 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 search engines and data streams. They are, however, not only restricted to such applications but are also very useful in 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. 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.

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

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

M3 - Conference contribution

VL - 3589

SP - 179

EP - 189

BT - Lecture Notes in Computer Science

A2 - Tjoa, A.M.

A2 - Trujillo, J.

ER -