Aggregate skyline

Analysis for online users

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

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

8 Citations (Scopus)

Abstract

Aggregation is among the core functionalities of LAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. In conventional settings, the queries take a long time to compute (hours!) and produce massive result-sets at varying degrees of aggregation. Providing real time analysis results to web users can enhance the utility of sites dealing with large amounts of data. However, to do so, needs succinct ways of capturing interesting analysis results rather than complex offline analysis. The result set should be presentable in a few web pages. Furthermore, such results should be computed quickly and updated in the background whenever possible. We propose skyline queries over aggregated data as a means of providing succinct but interesting analysis results. We support aggregation functions from a large class of monotonous functions that can be specified at runtime, thereby allowing user customization of the analysis. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and identify an optimal algorithm within the family. We further refine the algorithm by taking into account system issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results provide strong validation for the performance and progressive nature of the algorithm.

Original languageEnglish
Title of host publicationProceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009
Pages50-56
Number of pages7
DOIs
Publication statusPublished - 4 Nov 2009
Externally publishedYes
Event2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009 - Bellevue, WA, United States
Duration: 20 Jul 200924 Jul 2009

Other

Other2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009
CountryUnited States
CityBellevue, WA
Period20/7/0924/7/09

Fingerprint

Agglomeration
Decision support systems
Websites

Keywords

  • Analysis
  • Database
  • Skyline queries

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Antony, S., Wu, P., Agrawal, D., & Abbadi, A. E. (2009). Aggregate skyline: Analysis for online users. In Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009 (pp. 50-56). [5230659] https://doi.org/10.1109/SAINT.2009.17

Aggregate skyline : Analysis for online users. / Antony, Shyam; Wu, Ping; Agrawal, Divyakant; Abbadi, Amr El.

Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009. 2009. p. 50-56 5230659.

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

Antony, S, Wu, P, Agrawal, D & Abbadi, AE 2009, Aggregate skyline: Analysis for online users. in Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009., 5230659, pp. 50-56, 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009, Bellevue, WA, United States, 20/7/09. https://doi.org/10.1109/SAINT.2009.17
Antony S, Wu P, Agrawal D, Abbadi AE. Aggregate skyline: Analysis for online users. In Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009. 2009. p. 50-56. 5230659 https://doi.org/10.1109/SAINT.2009.17
Antony, Shyam ; Wu, Ping ; Agrawal, Divyakant ; Abbadi, Amr El. / Aggregate skyline : Analysis for online users. Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009. 2009. pp. 50-56
@inproceedings{da44e4e0963443879f8bbece5417799d,
title = "Aggregate skyline: Analysis for online users",
abstract = "Aggregation is among the core functionalities of LAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. In conventional settings, the queries take a long time to compute (hours!) and produce massive result-sets at varying degrees of aggregation. Providing real time analysis results to web users can enhance the utility of sites dealing with large amounts of data. However, to do so, needs succinct ways of capturing interesting analysis results rather than complex offline analysis. The result set should be presentable in a few web pages. Furthermore, such results should be computed quickly and updated in the background whenever possible. We propose skyline queries over aggregated data as a means of providing succinct but interesting analysis results. We support aggregation functions from a large class of monotonous functions that can be specified at runtime, thereby allowing user customization of the analysis. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and identify an optimal algorithm within the family. We further refine the algorithm by taking into account system issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results provide strong validation for the performance and progressive nature of the algorithm.",
keywords = "Analysis, Database, Skyline queries",
author = "Shyam Antony and Ping Wu and Divyakant Agrawal and Abbadi, {Amr El}",
year = "2009",
month = "11",
day = "4",
doi = "10.1109/SAINT.2009.17",
language = "English",
isbn = "9780769537009",
pages = "50--56",
booktitle = "Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009",

}

TY - GEN

T1 - Aggregate skyline

T2 - Analysis for online users

AU - Antony, Shyam

AU - Wu, Ping

AU - Agrawal, Divyakant

AU - Abbadi, Amr El

PY - 2009/11/4

Y1 - 2009/11/4

N2 - Aggregation is among the core functionalities of LAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. In conventional settings, the queries take a long time to compute (hours!) and produce massive result-sets at varying degrees of aggregation. Providing real time analysis results to web users can enhance the utility of sites dealing with large amounts of data. However, to do so, needs succinct ways of capturing interesting analysis results rather than complex offline analysis. The result set should be presentable in a few web pages. Furthermore, such results should be computed quickly and updated in the background whenever possible. We propose skyline queries over aggregated data as a means of providing succinct but interesting analysis results. We support aggregation functions from a large class of monotonous functions that can be specified at runtime, thereby allowing user customization of the analysis. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and identify an optimal algorithm within the family. We further refine the algorithm by taking into account system issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results provide strong validation for the performance and progressive nature of the algorithm.

AB - Aggregation is among the core functionalities of LAP systems. Frequently, such queries are issued in decision support systems to identify interesting groups of data. In conventional settings, the queries take a long time to compute (hours!) and produce massive result-sets at varying degrees of aggregation. Providing real time analysis results to web users can enhance the utility of sites dealing with large amounts of data. However, to do so, needs succinct ways of capturing interesting analysis results rather than complex offline analysis. The result set should be presentable in a few web pages. Furthermore, such results should be computed quickly and updated in the background whenever possible. We propose skyline queries over aggregated data as a means of providing succinct but interesting analysis results. We support aggregation functions from a large class of monotonous functions that can be specified at runtime, thereby allowing user customization of the analysis. We explore a family of algorithms which try to consume only as many data records as are necessary to compute the skyline and identify an optimal algorithm within the family. We further refine the algorithm by taking into account system issues such as disk behavior which are often ignored but have strong impact on real system performance. Experimental results provide strong validation for the performance and progressive nature of the algorithm.

KW - Analysis

KW - Database

KW - Skyline queries

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

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

U2 - 10.1109/SAINT.2009.17

DO - 10.1109/SAINT.2009.17

M3 - Conference contribution

SN - 9780769537009

SP - 50

EP - 56

BT - Proceedings - 2009 9th Annual International Symposium on Applications and the Internet, SAINT 2009

ER -