Polynomial asymptotic complexity of multiple-objective OLAP data cube compression

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

Organisationseinheiten

Externe Organisationen

  • University of Calabria
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksAdvances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings
Seiten580-593
Seitenumfang14
AuflagePART 2
PublikationsstatusVeröffentlicht - 2012
Veranstaltung14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012 - Catania, Italien
Dauer: 9 Juli 201213 Juli 2012

Publikationsreihe

NameCommunications in Computer and Information Science
NummerPART 2
Band298 CCIS
ISSN (Print)1865-0929

Abstract

In this paper, we complement previous research results provided in [8], where the multiple-objective OLAP data cube compression paradigm has been introduced. This paradigm pursues the idea of compressing OLAP data cubes in the dependence of multiple requirements rather than only one, like in traditional approaches. Here, we provide a comprehensive description of algorithm computeMQHist, the main algorithm of the framework [8], which allows us to obtain compressed data cubes that adhere to the multiple-objective computational paradigm, and we prove that computeMQHist has a polynomial asymptotic complexity.

ASJC Scopus Sachgebiete

Zitieren

Polynomial asymptotic complexity of multiple-objective OLAP data cube compression. / Cuzzocrea, Alfredo; Fisichella, Marco.
Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings. PART 2. Aufl. 2012. S. 580-593 (Communications in Computer and Information Science; Band 298 CCIS, Nr. PART 2).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Cuzzocrea, A & Fisichella, M 2012, Polynomial asymptotic complexity of multiple-objective OLAP data cube compression. in Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings. PART 2 Aufl., Communications in Computer and Information Science, Nr. PART 2, Bd. 298 CCIS, S. 580-593, 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Catania, Italien, 9 Juli 2012. https://doi.org/10.1007/978-3-642-31715-6_61
Cuzzocrea, A., & Fisichella, M. (2012). Polynomial asymptotic complexity of multiple-objective OLAP data cube compression. In Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings (PART 2 Aufl., S. 580-593). (Communications in Computer and Information Science; Band 298 CCIS, Nr. PART 2). https://doi.org/10.1007/978-3-642-31715-6_61
Cuzzocrea A, Fisichella M. Polynomial asymptotic complexity of multiple-objective OLAP data cube compression. in Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings. PART 2 Aufl. 2012. S. 580-593. (Communications in Computer and Information Science; PART 2). doi: 10.1007/978-3-642-31715-6_61
Cuzzocrea, Alfredo ; Fisichella, Marco. / Polynomial asymptotic complexity of multiple-objective OLAP data cube compression. Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings. PART 2. Aufl. 2012. S. 580-593 (Communications in Computer and Information Science; PART 2).
Download
@inproceedings{7a77c80c35024a15a88385db1a863ba4,
title = "Polynomial asymptotic complexity of multiple-objective OLAP data cube compression",
abstract = "In this paper, we complement previous research results provided in [8], where the multiple-objective OLAP data cube compression paradigm has been introduced. This paradigm pursues the idea of compressing OLAP data cubes in the dependence of multiple requirements rather than only one, like in traditional approaches. Here, we provide a comprehensive description of algorithm computeMQHist, the main algorithm of the framework [8], which allows us to obtain compressed data cubes that adhere to the multiple-objective computational paradigm, and we prove that computeMQHist has a polynomial asymptotic complexity.",
author = "Alfredo Cuzzocrea and Marco Fisichella",
year = "2012",
doi = "10.1007/978-3-642-31715-6_61",
language = "English",
isbn = "9783642317149",
series = "Communications in Computer and Information Science",
number = "PART 2",
pages = "580--593",
booktitle = "Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings",
edition = "PART 2",
note = "14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012 ; Conference date: 09-07-2012 Through 13-07-2012",

}

Download

TY - GEN

T1 - Polynomial asymptotic complexity of multiple-objective OLAP data cube compression

AU - Cuzzocrea, Alfredo

AU - Fisichella, Marco

PY - 2012

Y1 - 2012

N2 - In this paper, we complement previous research results provided in [8], where the multiple-objective OLAP data cube compression paradigm has been introduced. This paradigm pursues the idea of compressing OLAP data cubes in the dependence of multiple requirements rather than only one, like in traditional approaches. Here, we provide a comprehensive description of algorithm computeMQHist, the main algorithm of the framework [8], which allows us to obtain compressed data cubes that adhere to the multiple-objective computational paradigm, and we prove that computeMQHist has a polynomial asymptotic complexity.

AB - In this paper, we complement previous research results provided in [8], where the multiple-objective OLAP data cube compression paradigm has been introduced. This paradigm pursues the idea of compressing OLAP data cubes in the dependence of multiple requirements rather than only one, like in traditional approaches. Here, we provide a comprehensive description of algorithm computeMQHist, the main algorithm of the framework [8], which allows us to obtain compressed data cubes that adhere to the multiple-objective computational paradigm, and we prove that computeMQHist has a polynomial asymptotic complexity.

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

U2 - 10.1007/978-3-642-31715-6_61

DO - 10.1007/978-3-642-31715-6_61

M3 - Conference contribution

AN - SCOPUS:84868270651

SN - 9783642317149

T3 - Communications in Computer and Information Science

SP - 580

EP - 593

BT - Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Proceedings

T2 - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012

Y2 - 9 July 2012 through 13 July 2012

ER -

Von denselben Autoren