|
Efficient Skyline and Top-k Retrieval in Subspaces |
|
IEEE Transactions on Knowledge and Data Engineering (TKDE), 19(8): 1072-1088, 2007 |
| Abstract |
|
|
| Paper download |
![]() The short version appeared in ICDE 2006. |
| Implementation and datasets |
| Before you proceed with downloading, please read and agree to the terms of using our implementation. Source codes SUBSKY and BBS (implemented: by Xiaokui Xiao). Datasets used in our experiments: NBA, Color, House. Dataset description: NBA contains 17k 8-dimensional points, where each point corresponds to the statistics of a player in 8 categories. These categories include the numbers of points scored, rebounds, assists, steals, blocks, field goals attempted, free throws, and three-point shots, all averaged over the number of minutes played. Household consists of 127k 6-dimensional tuples, each of which represents the percentage of an American family’s annual income spent on 6 types of expenditure: gas, electricity, water, heating, insurance, and property tax. Color is a 9-dimensional dataset with a cardinality 68k, and a tuple captures several properties of an image. Specifically, each image is encoded in the HSV space, and those 9 dimensions record the mean, standard deviation, and skewness of all the pixels in the H, S, and V channels, respectively. All the values are normalized into the unit range [0, 1]. File format:
A d-dimensional dataset has the following format: |