Computing Closed Skycubes

Chedy Raïssi 1, * Jian Pei 2 Thomas Kister 3
* Corresponding author
1 ORPAILLEUR - Knowledge representation, reasonning
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 TATOO - Fouille de données environnementales
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of subspaces searched. Technically, we identify two types of skyline points that can be directly derived without using any domination tests. Moreover, based on formal concept analysis, we introduce two closure operators that enable a concise representation of skyline cubes. We show that this concise representation is easy to compute and develop an efficient algorithm, which only needs to search a small portion of the huge search space. We show with empirical results the merits of our approach.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00610923
Contributor : Chedy Raïssi <>
Submitted on : Monday, July 25, 2011 - 12:02:51 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Long-term archiving on : Wednesday, October 26, 2011 - 2:21:29 AM

File

R75.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : inria-00610923, version 1

Citation

Chedy Raïssi, Jian Pei, Thomas Kister. Computing Closed Skycubes. Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2010, 3 (1), pp.838-847. ⟨inria-00610923⟩

Share

Metrics

Record views

429

Files downloads

449