## Catching the best views of skyline: A semantic approach based on decisive subspaces (2005)

### Cached

### Download Links

- [www.cse.cuhk.edu.hk]
- [www.cs.sfu.ca]
- [www.cs.sfu.ca]
- [www.cs.sfu.ca]
- [www.vldb2005.org]
- [vldb.idi.ntnu.no]
- [www.vldb.org]
- DBLP

### Other Repositories/Bibliography

Venue: | In VLDB |

Citations: | 68 - 12 self |

### BibTeX

@INPROCEEDINGS{Pei05catchingthe,

author = {Jian Pei and Wen Jin and Martin Ester and Yufei Tao},

title = {Catching the best views of skyline: A semantic approach based on decisive subspaces},

booktitle = {In VLDB},

year = {2005},

pages = {253--264}

}

### Years of Citing Articles

### OpenURL

### Abstract

The skyline operator is important for multicriteria decision making applications. Although many recent studies developed efficient methods to compute skyline objects in a specific space, the fundamental problem on the semantics of skylines remains open: Why and in which subspaces is (or is not) an object in the skyline? Practically, users may also be interested in the skylines in any subspaces. Then, what is the relationship between the skylines in the subspaces and those in the super-spaces? How can we effectively analyze the subspace skylines? Can we efficiently compute skylines in various subspaces? In this paper, we investigate the semantics of skylines, propose the subspace skyline analysis, and extend the full-space skyline computation to subspace skyline computation. We introduce a novel notion of skyline group which essentially is a group of objects that are coincidentally in the skylines of some subspaces. We identify the decisive subspaces that qualify skyline groups in the subspace skylines. The new notions concisely capture the semantics and the structures of skylines in various subspaces. Multidimensional roll-up and drilldown analysis is introduced. We also develop

### Citations

894 |
R.: Formal Concept Analysis: Mathematical Foundations
- Ganter, Wille
- 1997
(Show Context)
Citation Context ...systems, applying the ”threshold” algorithm of [4]. Recently, Lin et al. [10] consider the skyline maintenance over data streams. The maximal c-group lattice is levered by the formal concept analysis =-=[5]-=-. However, very different from previous studies on database and data mining studies using formal concept analysis, such as [13, 9], we are interested in a small part of the lattice – only the skyline ... |

425 | The skyline operator
- Börzsönyi, Kossmann, et al.
- 2001
(Show Context)
Citation Context ...or is important for multi-criteria decision making applications. A (classic) illustrative example of skyline queries is to search for hotels in Nassau (Bahamas) which are cheap and close to the beach =-=[2]-=-. Suppose each hotel has two attributes: the price and the distance to the beach. Hotel A dominates hotel B (or, A is a better choice than B in the context of this example) if A.price ≤ B.price, A.dis... |

350 | Discovering frequent closed itemsets for association rules
- Pasquier, Bastide, et al.
- 1999
(Show Context)
Citation Context ...ms. The maximal c-group lattice is levered by the formal concept analysis [5]. However, very different from previous studies on database and data mining studies using formal concept analysis, such as =-=[13, 9]-=-, we are interested in a small part of the lattice – only the skyline groups. Moreover, the challenge is how to compute the skyline groups and the objects in the subspace skylines. These issues are fa... |

209 | Shooting stars in the sky: An online algorithm for skyline queries
- Kossmann, Ramsak, et al.
- 2002
(Show Context)
Citation Context ... original dataset. The authors also provide another method based on some clever observations on the relationships between the skyline and the minimum coordinates of individual points. Kossmann et al. =-=[7]-=- present an algorithm that finds the skyline with numerous nearest neighbor searches. An improved approach following this idea appears in [12]. Balke et al. [1] study skyline computation in web inform... |

185 | On Finding the Maxima of a Set of Vectors
- Kung, Luccio, et al.
- 1975
(Show Context)
Citation Context ...nd its applications in multidimensional data analysis. Numerous algorithms have been proposed for skyline retrieval and other related problems (e.g., multiobjective optimization [15], maximum vectors =-=[8, 16, 11]-=-, etc.). In the database context, Borzsonyi et al. [2] develop the solutions based on divide-and-conquer (DC) and block nested loops (BNL). Specifically, DC divides the dataset into several partitions... |

176 | An Optimal and Progressive Algorithm for Skyline Queries
- Papadias, Tao, et al.
- 2003
(Show Context)
Citation Context ... minimum coordinates of individual points. Kossmann et al. [7] present an algorithm that finds the skyline with numerous nearest neighbor searches. An improved approach following this idea appears in =-=[12]-=-. Balke et al. [1] study skyline computation in web information systems, applying the ”threshold” algorithm of [4]. Recently, Lin et al. [10] consider the skyline maintenance over data streams. The ma... |

149 |
Efficient progressive skyline computation
- Tan, Eng, et al.
- 2001
(Show Context)
Citation Context ...in any case. The sort-first-skyline (SFS) [3] sorts the input data according to a (monotone) preference function, after which the skyline can be found in another pass over the sorted list. Tan et al. =-=[17]-=- propose a solution that deploys the highly CPU-efficient bit-operations (e.g., calculating the AND/OR of two binary vectors) by computing the skyline from some bitmaps capturing the original dataset.... |

122 | Skyline with presorting
- Chomicki, Godfrey, et al.
- 2003
(Show Context)
Citation Context ...al order. 259 {D1,D2,D3} {D1,D2,D4} {D1,D3,D4} {D2,D3,D4} {D1,D2} {D1,D3} {D2,D3} {D1,D4} {D2,D4} {D3,D4} {D1} {D1,D2,D3,D4} {D2} {D3} {D4} Figure 4: A top-down subspace enumeration tree. As shown in =-=[3]-=-, skyline objects in the full space D can be found in two steps, as illustrated in the following example. Example 8 (Skyline computation by sorting). Let us compute skyline objects in space (X, Y ) fo... |

116 |
Search through systematic set enumeration, in
- Rymon
- 1992
(Show Context)
Citation Context ...n) subspace enumeration tree. For example, Figure 4 shows a tree enumerating subspaces of space (D1, D2, D3, D4). A top-down subspace enumeration tree differs from a conventional set enumeration tree =-=[14]-=- in the way of enumeration. In a conventional set enumeration tree, search starts from the empty set, and each child adds a new element to the parent set. It is bottom-up. In the top-down subspace enu... |

101 | Efficient distributed skylining for web information systems
- Balke, Güntzer, et al.
- 2004
(Show Context)
Citation Context ...s of individual points. Kossmann et al. [7] present an algorithm that finds the skyline with numerous nearest neighbor searches. An improved approach following this idea appears in [12]. Balke et al. =-=[1]-=- study skyline computation in web information systems, applying the ”threshold” algorithm of [4]. Recently, Lin et al. [10] consider the skyline maintenance over data streams. The maximal c-group latt... |

69 | Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
- Lin, Yuan, et al.
- 2005
(Show Context)
Citation Context ...rches. An improved approach following this idea appears in [12]. Balke et al. [1] study skyline computation in web information systems, applying the ”threshold” algorithm of [4]. Recently, Lin et al. =-=[10]-=- consider the skyline maintenance over data streams. The maximal c-group lattice is levered by the formal concept analysis [5]. However, very different from previous studies on database and data minin... |

67 |
Amnon Lotem, and Moni Naor. Optimal aggregation algorithms for middleware
- Fagin
- 2001
(Show Context)
Citation Context ...erous nearest neighbor searches. An improved approach following this idea appears in [12]. Balke et al. [1] study skyline computation in web information systems, applying the ”threshold” algorithm of =-=[4]-=-. Recently, Lin et al. [10] consider the skyline maintenance over data streams. The maximal c-group lattice is levered by the formal concept analysis [5]. However, very different from previous studies... |

67 | Finding Intensional Knowledge of Distance-Based Outliers
- Knorr, Ng
- 1999
(Show Context)
Citation Context ...e traditional studies on formal concept analysis. There have been some recent studies on finding the determinant factors in multidimensional subspaces for some critical data. Two typical examples are =-=[6, 9]-=-. In [6], Knorr and Ng propose an approach to find the minimal sets of factors that explain the distance-based outliers. In [9], the quotient cube lattice is developed to identify groups of aggregates... |

45 | Quotient cube: How to summarize the semantics of a data cube
- Lakshmanan, Pei, et al.
(Show Context)
Citation Context ...ms. The maximal c-group lattice is levered by the formal concept analysis [5]. However, very different from previous studies on database and data mining studies using formal concept analysis, such as =-=[13, 9]-=-, we are interested in a small part of the lattice – only the skyline groups. Moreover, the challenge is how to compute the skyline groups and the objects in the subspace skylines. These issues are fa... |

40 |
Multiple Criteria Optimization
- Steuer
- 1989
(Show Context)
Citation Context ...mal concept analysis and its applications in multidimensional data analysis. Numerous algorithms have been proposed for skyline retrieval and other related problems (e.g., multiobjective optimization =-=[15]-=-, maximum vectors [8, 16, 11], etc.). In the database context, Borzsonyi et al. [2] develop the solutions based on divide-and-conquer (DC) and block nested loops (BNL). Specifically, DC divides the da... |

1 |
Computing dominances in e n (short communication
- Matousek
- 1991
(Show Context)
Citation Context ...nd its applications in multidimensional data analysis. Numerous algorithms have been proposed for skyline retrieval and other related problems (e.g., multiobjective optimization [15], maximum vectors =-=[8, 16, 11]-=-, etc.). In the database context, Borzsonyi et al. [2] develop the solutions based on divide-and-conquer (DC) and block nested loops (BNL). Specifically, DC divides the dataset into several partitions... |

1 |
Stojmenovic and Masahiro Miyakawa. An optimal parallel algorithm for solving the maximal elements problem in the plane
- Ivan
- 1988
(Show Context)
Citation Context ...nd its applications in multidimensional data analysis. Numerous algorithms have been proposed for skyline retrieval and other related problems (e.g., multiobjective optimization [15], maximum vectors =-=[8, 16, 11]-=-, etc.). In the database context, Borzsonyi et al. [2] develop the solutions based on divide-and-conquer (DC) and block nested loops (BNL). Specifically, DC divides the dataset into several partitions... |