A METRIC FOR RANKING HIGH DIMENSIONAL SKYLINE QUERIES

Marlene Goncalves, Graciela Perera

2010

Abstract

Skyline queries have been proposed to express user’s preferences. Since the size of Skyline set increases as the number of criteria augments, it is necessary to rank high dimensional Skyline queries. In this work, we propose a new metric to rank high dimensional Skylines which allows to identify the k most interesting objects from the Skyline set (Top-k Skyline). We have empirically studied the variability and performance of our metric. Our initial experimental results show that the metric is able to speed up the computation of the Top-k Skyline in up to two orders of magnitude w.r.t. the state-of-the-art metric: Skyline Frequency.

References

  1. W. Balke, and U. Güntzer, “Multi-objetive query processing for database systems,” in Proc. of VLDB, 2004, pp. 936-947.
  2. J. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, “On the average number of maxima in a set of vectors and applications,” JACM, vol. 25(4), pp. 536 - 543, 1978.
  3. S. Börzsönyi, D. Kossmann, and K. Stocker, “The skyline operator,” in Proc. of ICDE, 2001, pp. 421-430.
  4. C. Brando, M. Goncalves, and V. Gonzalez, “Evaluating top-k skyline queries over relational databases,” in Proc. of DEXA, 2007, pp. 254-263.
  5. C. Y. Chan, V. Jagadish, K.-L. Tan, A. K. H. Tung, and Z. Zhang, “On high dimensional skylines,” in Proc. of ICDE, 2006, pp. 478-495.
  6. C. Y. Chan, V. Jagadish, K. L. Tan, A. K. H. Tung, and Z. Zhang, “Finding k-dominant skyline in high dimensional space,” in SIGMOD, 2006, pp. 539-550.
  7. M. Goncalves and M. Vidal, “Top-k skyline: A unified approach,” in Proceedings of OTM 2005 PhD Symposium, 2005, pp. 790-799.
  8. M. Goncalves and M. Vidal, “Reaching the top of the skyline: An efficient indexed algorithm for top-k skyline queries,” in Proc. of DEXA, 2009, pp. 471- 485.
  9. M. de Kunder, “The size of the world wide web,” 2010. [Online]. Available http://www.worldwidewebsize. com
  10. X. Lin, Y. Yuan, and Y. Zhang, “Selecting stars: the k most representative skyline operator,” in ICDE, 2007, pp. 86-95.
  11. J. Pei, Y. Yuan, X. Lin, W. Jin, M. Ester, Q. Liu, W. Wang, Y. Tao, J. X. Yu, and Q. Zhang, “To- wards multi-dimensional subspace skyline analy- sis,” in TODS, 2006, pp. 1335 - 1381.
  12. Y. Yuan, X. Lin, Q. Liu, W. Wang, J. Yu, and Q. Zhang, “Efficient computation of the skyline cube,” in VLDB, 2005, pp. 241 - 252.
Download


Paper Citation


in Harvard Style

Goncalves M. and Perera G. (2010). A METRIC FOR RANKING HIGH DIMENSIONAL SKYLINE QUERIES . In Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8425-04-1, pages 383-386. DOI: 10.5220/0002904803830386


in Bibtex Style

@conference{iceis10,
author={Marlene Goncalves and Graciela Perera},
title={A METRIC FOR RANKING HIGH DIMENSIONAL SKYLINE QUERIES},
booktitle={Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2010},
pages={383-386},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002904803830386},
isbn={978-989-8425-04-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - A METRIC FOR RANKING HIGH DIMENSIONAL SKYLINE QUERIES
SN - 978-989-8425-04-1
AU - Goncalves M.
AU - Perera G.
PY - 2010
SP - 383
EP - 386
DO - 10.5220/0002904803830386