Skyline ranking for uncertain databases

Hyountaek Yong, Jongwuk Lee, Jinha Kim, Seung Won Hwang

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Skyline queries have been actively studied to effectively identify interesting tuples with low formulation overhead. This paper aims to support skyline queries for uncertain data with maybe confidence. Prior skyline work for uncertain data assumes that each tuple is exhaustively enumerated with all possible probabilities of alternative confidence. However, it is inappropriate to some real-life scenarios, e.g., scientific Web data or privacy-preserving data, such that each tuple is associated with a probability of existence. We thus propose novel skyline algorithms that efficiently deal with maybe uncertainty, leveraging auxiliary indexes, i.e., an R-tree or a dominance graph. We also discuss our proposed algorithms over data dependency. Our experiments demonstrate that the proposed algorithms are significantly faster than a naive method by orders of magnitude.

Original languageEnglish
Pages (from-to)247-262
Number of pages16
JournalInformation sciences
Volume273
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Skyline
Ranking
Uncertain Data
Confidence
Data privacy
Query
R-tree
Data Dependency
Privacy Preserving
Uncertainty
Scenarios
Data base
Formulation
Alternatives
Graph in graph theory
Experiments
Demonstrate
Experiment

All Science Journal Classification (ASJC) codes

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

Cite this

Yong, Hyountaek ; Lee, Jongwuk ; Kim, Jinha ; Hwang, Seung Won. / Skyline ranking for uncertain databases. In: Information sciences. 2014 ; Vol. 273. pp. 247-262.
@article{445857b09b934eb18c268b302fd4ca1a,
title = "Skyline ranking for uncertain databases",
abstract = "Skyline queries have been actively studied to effectively identify interesting tuples with low formulation overhead. This paper aims to support skyline queries for uncertain data with maybe confidence. Prior skyline work for uncertain data assumes that each tuple is exhaustively enumerated with all possible probabilities of alternative confidence. However, it is inappropriate to some real-life scenarios, e.g., scientific Web data or privacy-preserving data, such that each tuple is associated with a probability of existence. We thus propose novel skyline algorithms that efficiently deal with maybe uncertainty, leveraging auxiliary indexes, i.e., an R-tree or a dominance graph. We also discuss our proposed algorithms over data dependency. Our experiments demonstrate that the proposed algorithms are significantly faster than a naive method by orders of magnitude.",
author = "Hyountaek Yong and Jongwuk Lee and Jinha Kim and Hwang, {Seung Won}",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.ins.2014.03.044",
language = "English",
volume = "273",
pages = "247--262",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

Skyline ranking for uncertain databases. / Yong, Hyountaek; Lee, Jongwuk; Kim, Jinha; Hwang, Seung Won.

In: Information sciences, Vol. 273, 01.01.2014, p. 247-262.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Skyline ranking for uncertain databases

AU - Yong, Hyountaek

AU - Lee, Jongwuk

AU - Kim, Jinha

AU - Hwang, Seung Won

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Skyline queries have been actively studied to effectively identify interesting tuples with low formulation overhead. This paper aims to support skyline queries for uncertain data with maybe confidence. Prior skyline work for uncertain data assumes that each tuple is exhaustively enumerated with all possible probabilities of alternative confidence. However, it is inappropriate to some real-life scenarios, e.g., scientific Web data or privacy-preserving data, such that each tuple is associated with a probability of existence. We thus propose novel skyline algorithms that efficiently deal with maybe uncertainty, leveraging auxiliary indexes, i.e., an R-tree or a dominance graph. We also discuss our proposed algorithms over data dependency. Our experiments demonstrate that the proposed algorithms are significantly faster than a naive method by orders of magnitude.

AB - Skyline queries have been actively studied to effectively identify interesting tuples with low formulation overhead. This paper aims to support skyline queries for uncertain data with maybe confidence. Prior skyline work for uncertain data assumes that each tuple is exhaustively enumerated with all possible probabilities of alternative confidence. However, it is inappropriate to some real-life scenarios, e.g., scientific Web data or privacy-preserving data, such that each tuple is associated with a probability of existence. We thus propose novel skyline algorithms that efficiently deal with maybe uncertainty, leveraging auxiliary indexes, i.e., an R-tree or a dominance graph. We also discuss our proposed algorithms over data dependency. Our experiments demonstrate that the proposed algorithms are significantly faster than a naive method by orders of magnitude.

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

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

U2 - 10.1016/j.ins.2014.03.044

DO - 10.1016/j.ins.2014.03.044

M3 - Article

AN - SCOPUS:84899969426

VL - 273

SP - 247

EP - 262

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -