Toward efficient multidimensional subspace skyline computation

Jongwuk Lee, Seung won Hwang

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Skyline queries have attracted considerable attention to assist multicriteria analysis of large-scale datasets. In this paper, we focus on multidimensional subspace skyline computation that has been actively studied for two approaches. First, to narrow down a full-space skyline, users may consider multiple subspace skylines reflecting their interest. For this purpose, we tackle the concept of a skycube, which consists of all possible non-empty subspace skylines in a given full space. Second, to understand diverse semantics of subspace skylines, we address skyline groups in which a skyline point (or a set of skyline points) is annotated with decisive subspaces. Our primary contributions are to identify common building blocks of the two approaches and to develop orthogonal optimization principles that benefit both approaches. Our experimental results show the efficiency of proposed algorithms by comparing them with state-of-the-art algorithms in both synthetic and real-life datasets.

Original languageEnglish
Pages (from-to)129-145
Number of pages17
JournalVLDB Journal
Volume23
Issue number1
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Semantics

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture

Cite this

@article{3cb04f5f2bdf4f4aa181f122991786ce,
title = "Toward efficient multidimensional subspace skyline computation",
abstract = "Skyline queries have attracted considerable attention to assist multicriteria analysis of large-scale datasets. In this paper, we focus on multidimensional subspace skyline computation that has been actively studied for two approaches. First, to narrow down a full-space skyline, users may consider multiple subspace skylines reflecting their interest. For this purpose, we tackle the concept of a skycube, which consists of all possible non-empty subspace skylines in a given full space. Second, to understand diverse semantics of subspace skylines, we address skyline groups in which a skyline point (or a set of skyline points) is annotated with decisive subspaces. Our primary contributions are to identify common building blocks of the two approaches and to develop orthogonal optimization principles that benefit both approaches. Our experimental results show the efficiency of proposed algorithms by comparing them with state-of-the-art algorithms in both synthetic and real-life datasets.",
author = "Jongwuk Lee and Hwang, {Seung won}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s00778-013-0317-y",
language = "English",
volume = "23",
pages = "129--145",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "1",

}

Toward efficient multidimensional subspace skyline computation. / Lee, Jongwuk; Hwang, Seung won.

In: VLDB Journal, Vol. 23, No. 1, 01.01.2014, p. 129-145.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Toward efficient multidimensional subspace skyline computation

AU - Lee, Jongwuk

AU - Hwang, Seung won

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Skyline queries have attracted considerable attention to assist multicriteria analysis of large-scale datasets. In this paper, we focus on multidimensional subspace skyline computation that has been actively studied for two approaches. First, to narrow down a full-space skyline, users may consider multiple subspace skylines reflecting their interest. For this purpose, we tackle the concept of a skycube, which consists of all possible non-empty subspace skylines in a given full space. Second, to understand diverse semantics of subspace skylines, we address skyline groups in which a skyline point (or a set of skyline points) is annotated with decisive subspaces. Our primary contributions are to identify common building blocks of the two approaches and to develop orthogonal optimization principles that benefit both approaches. Our experimental results show the efficiency of proposed algorithms by comparing them with state-of-the-art algorithms in both synthetic and real-life datasets.

AB - Skyline queries have attracted considerable attention to assist multicriteria analysis of large-scale datasets. In this paper, we focus on multidimensional subspace skyline computation that has been actively studied for two approaches. First, to narrow down a full-space skyline, users may consider multiple subspace skylines reflecting their interest. For this purpose, we tackle the concept of a skycube, which consists of all possible non-empty subspace skylines in a given full space. Second, to understand diverse semantics of subspace skylines, we address skyline groups in which a skyline point (or a set of skyline points) is annotated with decisive subspaces. Our primary contributions are to identify common building blocks of the two approaches and to develop orthogonal optimization principles that benefit both approaches. Our experimental results show the efficiency of proposed algorithms by comparing them with state-of-the-art algorithms in both synthetic and real-life datasets.

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

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

U2 - 10.1007/s00778-013-0317-y

DO - 10.1007/s00778-013-0317-y

M3 - Article

AN - SCOPUS:84892791605

VL - 23

SP - 129

EP - 145

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 1

ER -