Abstract
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome the cons, subspace skyline queries have been recently studied, where users iteratively specify relevant feature subspaces on search space. However, existing works mainly focuss on centralized databases. This paper aims to extend subspace skyline computation to distributed environments such as the Web, where the most important issue is to minimize the cost of accessing vertically distributed objects. Toward this goal, we exploit prior skylines that have overlapped subspaces to the given subspace. In particular, we develop algorithms for three scenarios- when the subspace of prior skylines is superspace, subspace, or the rest. Our experimental results validate that our proposed algorithm shows significantly better performance than the state-of-the-art algorithms.
| Original language | English |
|---|---|
| Title of host publication | Data Warehousing and Knowledge Discovery - 11th International Conference, DaWaK 2009, Proceedings |
| Pages | 312-324 |
| Number of pages | 13 |
| DOIs | |
| Publication status | Published - 2009 Sep 28 |
| Event | 11th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2009 - Linz, Austria Duration: 2009 Aug 31 → 2009 Sep 2 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 5691 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 11th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2009 |
|---|---|
| Country | Austria |
| City | Linz |
| Period | 09/8/31 → 09/9/2 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
}
Skyline view : Efficient distributed subspace skyline computation. / Kim, Jinhan; Lee, Jongwuk; Hwang, Seung Won.
Data Warehousing and Knowledge Discovery - 11th International Conference, DaWaK 2009, Proceedings. 2009. p. 312-324 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5691 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Skyline view
T2 - Efficient distributed subspace skyline computation
AU - Kim, Jinhan
AU - Lee, Jongwuk
AU - Hwang, Seung Won
PY - 2009/9/28
Y1 - 2009/9/28
N2 - Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome the cons, subspace skyline queries have been recently studied, where users iteratively specify relevant feature subspaces on search space. However, existing works mainly focuss on centralized databases. This paper aims to extend subspace skyline computation to distributed environments such as the Web, where the most important issue is to minimize the cost of accessing vertically distributed objects. Toward this goal, we exploit prior skylines that have overlapped subspaces to the given subspace. In particular, we develop algorithms for three scenarios- when the subspace of prior skylines is superspace, subspace, or the rest. Our experimental results validate that our proposed algorithm shows significantly better performance than the state-of-the-art algorithms.
AB - Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome the cons, subspace skyline queries have been recently studied, where users iteratively specify relevant feature subspaces on search space. However, existing works mainly focuss on centralized databases. This paper aims to extend subspace skyline computation to distributed environments such as the Web, where the most important issue is to minimize the cost of accessing vertically distributed objects. Toward this goal, we exploit prior skylines that have overlapped subspaces to the given subspace. In particular, we develop algorithms for three scenarios- when the subspace of prior skylines is superspace, subspace, or the rest. Our experimental results validate that our proposed algorithm shows significantly better performance than the state-of-the-art algorithms.
UR - http://www.scopus.com/inward/record.url?scp=70349336153&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349336153&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-03730-6_25
DO - 10.1007/978-3-642-03730-6_25
M3 - Conference contribution
AN - SCOPUS:70349336153
SN - 3642037291
SN - 9783642037290
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 312
EP - 324
BT - Data Warehousing and Knowledge Discovery - 11th International Conference, DaWaK 2009, Proceedings
ER -