MOOLAP: Towards multi-objective OLAP

Shyam Antony, Ping Wu, Divyakant Agrawal, Amr El Abbadi

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

4 Citations (Scopus)

Abstract

Aggregation is among the core functionalities of OLAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. When more than one aggregation function is involved and the notion of interest is not clearly defined, skyline queries provide a robust mechanism to capture the potentially interesting points where (i) users do not need to specify a ranking function and (ii) the result is independent of the dimension scales. To provide better exploration functionalities in OLAP systems, we propose to use skyline queries over aggregated data to identify the most interesting groups. Since aggregation functions have to be ad-hoc to cover a wide variety of user interests, the skyline over the aggregates has to be computed on the fly. Hence any algorithm to compute such a skyline must be fast and be able to progressively produce the result set with potential skyline groups being produced as early as possible. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and design an optimal algorithm. We further refine the algorithm by taking into account systems issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results validate the performance and progressive benefits of our algorithm.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Pages1394-1396
Number of pages3
DOIs
Publication statusPublished - 1 Oct 2008
Externally publishedYes
Event2008 IEEE 24th International Conference on Data Engineering, ICDE'08 - Cancun, Mexico
Duration: 7 Apr 200812 Apr 2008

Other

Other2008 IEEE 24th International Conference on Data Engineering, ICDE'08
CountryMexico
CityCancun
Period7/4/0812/4/08

Fingerprint

Agglomeration
Decision support systems
Optimal design

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Antony, S., Wu, P., Agrawal, D., & El Abbadi, A. (2008). MOOLAP: Towards multi-objective OLAP. In Proceedings - International Conference on Data Engineering (pp. 1394-1396). [4497567] https://doi.org/10.1109/ICDE.2008.4497567

MOOLAP : Towards multi-objective OLAP. / Antony, Shyam; Wu, Ping; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings - International Conference on Data Engineering. 2008. p. 1394-1396 4497567.

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

Antony, S, Wu, P, Agrawal, D & El Abbadi, A 2008, MOOLAP: Towards multi-objective OLAP. in Proceedings - International Conference on Data Engineering., 4497567, pp. 1394-1396, 2008 IEEE 24th International Conference on Data Engineering, ICDE'08, Cancun, Mexico, 7/4/08. https://doi.org/10.1109/ICDE.2008.4497567
Antony S, Wu P, Agrawal D, El Abbadi A. MOOLAP: Towards multi-objective OLAP. In Proceedings - International Conference on Data Engineering. 2008. p. 1394-1396. 4497567 https://doi.org/10.1109/ICDE.2008.4497567
Antony, Shyam ; Wu, Ping ; Agrawal, Divyakant ; El Abbadi, Amr. / MOOLAP : Towards multi-objective OLAP. Proceedings - International Conference on Data Engineering. 2008. pp. 1394-1396
@inproceedings{d9f3200e44174a4caf647f66d87a9b73,
title = "MOOLAP: Towards multi-objective OLAP",
abstract = "Aggregation is among the core functionalities of OLAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. When more than one aggregation function is involved and the notion of interest is not clearly defined, skyline queries provide a robust mechanism to capture the potentially interesting points where (i) users do not need to specify a ranking function and (ii) the result is independent of the dimension scales. To provide better exploration functionalities in OLAP systems, we propose to use skyline queries over aggregated data to identify the most interesting groups. Since aggregation functions have to be ad-hoc to cover a wide variety of user interests, the skyline over the aggregates has to be computed on the fly. Hence any algorithm to compute such a skyline must be fast and be able to progressively produce the result set with potential skyline groups being produced as early as possible. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and design an optimal algorithm. We further refine the algorithm by taking into account systems issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results validate the performance and progressive benefits of our algorithm.",
author = "Shyam Antony and Ping Wu and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2008",
month = "10",
day = "1",
doi = "10.1109/ICDE.2008.4497567",
language = "English",
isbn = "9781424418374",
pages = "1394--1396",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - MOOLAP

T2 - Towards multi-objective OLAP

AU - Antony, Shyam

AU - Wu, Ping

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2008/10/1

Y1 - 2008/10/1

N2 - Aggregation is among the core functionalities of OLAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. When more than one aggregation function is involved and the notion of interest is not clearly defined, skyline queries provide a robust mechanism to capture the potentially interesting points where (i) users do not need to specify a ranking function and (ii) the result is independent of the dimension scales. To provide better exploration functionalities in OLAP systems, we propose to use skyline queries over aggregated data to identify the most interesting groups. Since aggregation functions have to be ad-hoc to cover a wide variety of user interests, the skyline over the aggregates has to be computed on the fly. Hence any algorithm to compute such a skyline must be fast and be able to progressively produce the result set with potential skyline groups being produced as early as possible. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and design an optimal algorithm. We further refine the algorithm by taking into account systems issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results validate the performance and progressive benefits of our algorithm.

AB - Aggregation is among the core functionalities of OLAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. When more than one aggregation function is involved and the notion of interest is not clearly defined, skyline queries provide a robust mechanism to capture the potentially interesting points where (i) users do not need to specify a ranking function and (ii) the result is independent of the dimension scales. To provide better exploration functionalities in OLAP systems, we propose to use skyline queries over aggregated data to identify the most interesting groups. Since aggregation functions have to be ad-hoc to cover a wide variety of user interests, the skyline over the aggregates has to be computed on the fly. Hence any algorithm to compute such a skyline must be fast and be able to progressively produce the result set with potential skyline groups being produced as early as possible. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and design an optimal algorithm. We further refine the algorithm by taking into account systems issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results validate the performance and progressive benefits of our algorithm.

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

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

U2 - 10.1109/ICDE.2008.4497567

DO - 10.1109/ICDE.2008.4497567

M3 - Conference contribution

AN - SCOPUS:52649144723

SN - 9781424418374

SP - 1394

EP - 1396

BT - Proceedings - International Conference on Data Engineering

ER -