Efficient skycube computation using point and domain-based filtering

Gayathri Tambaram Kailasam, Jin Seung Lee, Jae W. Rhee, Jaewoo Kang

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Skyline queries have been increasingly used in multi-criteria decision making and data mining applications. They retrieve a set of interesting points from a potentially large set of data points. A point is said to be interesting if it is not dominated by any other point. Skyline cube (skycube) consists of skylines of all possible non-empty subsets of a given set of dimensions. In this paper, we propose two algorithms for computing skycube using bitmaps that are derivable from indexes. The Point-based skycube algorithm is an improvement over the existing Bitmap algorithm, extended to compute skycube. The Point-based algorithm processes one point at a time to check for skylines in all subspaces. The Domain-based skycube algorithm views points as value combinations and probes entire search space for potential skyline points. It significantly reduces bitmap access for low cardinality dimensions. Our experimental study shows that the two algorithms strictly dominate, or at least comparable to, the current skycube algorithm in most of the cases, suggesting that such an approach could be a useful addition to the set of skyline query processing techniques.

Original languageEnglish
Pages (from-to)1090-1103
Number of pages14
JournalInformation Sciences
Volume180
Issue number7
DOIs
Publication statusPublished - 2010 Apr 1

Fingerprint

Skyline
Regular hexahedron
Filtering
Query processing
Data mining
Decision making
Multicriteria Decision-making
Query Processing
Large Set
Set of points
Search Space
Cardinality
Experimental Study
Data Mining
Probe
Strictly
Subspace

Keywords

  • Algorithm
  • Database
  • Index
  • Multi-criteria decision making
  • Multidimensional data structures
  • Skycube
  • Skyline

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Software
  • Information Systems and Management
  • Control and Systems Engineering
  • Theoretical Computer Science

Cite this

Efficient skycube computation using point and domain-based filtering. / Tambaram Kailasam, Gayathri; Lee, Jin Seung; Rhee, Jae W.; Kang, Jaewoo.

In: Information Sciences, Vol. 180, No. 7, 01.04.2010, p. 1090-1103.

Research output: Contribution to journalArticle

Tambaram Kailasam, Gayathri ; Lee, Jin Seung ; Rhee, Jae W. ; Kang, Jaewoo. / Efficient skycube computation using point and domain-based filtering. In: Information Sciences. 2010 ; Vol. 180, No. 7. pp. 1090-1103.
@article{87ca24a017694f6286f994ccdf16e121,
title = "Efficient skycube computation using point and domain-based filtering",
abstract = "Skyline queries have been increasingly used in multi-criteria decision making and data mining applications. They retrieve a set of interesting points from a potentially large set of data points. A point is said to be interesting if it is not dominated by any other point. Skyline cube (skycube) consists of skylines of all possible non-empty subsets of a given set of dimensions. In this paper, we propose two algorithms for computing skycube using bitmaps that are derivable from indexes. The Point-based skycube algorithm is an improvement over the existing Bitmap algorithm, extended to compute skycube. The Point-based algorithm processes one point at a time to check for skylines in all subspaces. The Domain-based skycube algorithm views points as value combinations and probes entire search space for potential skyline points. It significantly reduces bitmap access for low cardinality dimensions. Our experimental study shows that the two algorithms strictly dominate, or at least comparable to, the current skycube algorithm in most of the cases, suggesting that such an approach could be a useful addition to the set of skyline query processing techniques.",
keywords = "Algorithm, Database, Index, Multi-criteria decision making, Multidimensional data structures, Skycube, Skyline",
author = "{Tambaram Kailasam}, Gayathri and Lee, {Jin Seung} and Rhee, {Jae W.} and Jaewoo Kang",
year = "2010",
month = "4",
day = "1",
doi = "10.1016/j.ins.2009.11.040",
language = "English",
volume = "180",
pages = "1090--1103",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "7",

}

TY - JOUR

T1 - Efficient skycube computation using point and domain-based filtering

AU - Tambaram Kailasam, Gayathri

AU - Lee, Jin Seung

AU - Rhee, Jae W.

AU - Kang, Jaewoo

PY - 2010/4/1

Y1 - 2010/4/1

N2 - Skyline queries have been increasingly used in multi-criteria decision making and data mining applications. They retrieve a set of interesting points from a potentially large set of data points. A point is said to be interesting if it is not dominated by any other point. Skyline cube (skycube) consists of skylines of all possible non-empty subsets of a given set of dimensions. In this paper, we propose two algorithms for computing skycube using bitmaps that are derivable from indexes. The Point-based skycube algorithm is an improvement over the existing Bitmap algorithm, extended to compute skycube. The Point-based algorithm processes one point at a time to check for skylines in all subspaces. The Domain-based skycube algorithm views points as value combinations and probes entire search space for potential skyline points. It significantly reduces bitmap access for low cardinality dimensions. Our experimental study shows that the two algorithms strictly dominate, or at least comparable to, the current skycube algorithm in most of the cases, suggesting that such an approach could be a useful addition to the set of skyline query processing techniques.

AB - Skyline queries have been increasingly used in multi-criteria decision making and data mining applications. They retrieve a set of interesting points from a potentially large set of data points. A point is said to be interesting if it is not dominated by any other point. Skyline cube (skycube) consists of skylines of all possible non-empty subsets of a given set of dimensions. In this paper, we propose two algorithms for computing skycube using bitmaps that are derivable from indexes. The Point-based skycube algorithm is an improvement over the existing Bitmap algorithm, extended to compute skycube. The Point-based algorithm processes one point at a time to check for skylines in all subspaces. The Domain-based skycube algorithm views points as value combinations and probes entire search space for potential skyline points. It significantly reduces bitmap access for low cardinality dimensions. Our experimental study shows that the two algorithms strictly dominate, or at least comparable to, the current skycube algorithm in most of the cases, suggesting that such an approach could be a useful addition to the set of skyline query processing techniques.

KW - Algorithm

KW - Database

KW - Index

KW - Multi-criteria decision making

KW - Multidimensional data structures

KW - Skycube

KW - Skyline

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

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

U2 - 10.1016/j.ins.2009.11.040

DO - 10.1016/j.ins.2009.11.040

M3 - Article

VL - 180

SP - 1090

EP - 1103

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 7

ER -