Top-k Combinatorial Skyline Queries
The problem of top-k skyline computation has attracted considerable research attention in the past few years. Given a dataset, a top-k skyline returns k “most interesting” skyline tuples based on some kind of preference specified by the user. We extend the concept of top-k skyline to a so-called top-k combinatorial skyline query (k-CSQ). In contrast to the existing top-k skyline query (which is mainly to find the interesting skyline tuples), a k-CSQ is to find the interesting skyline tuples from various kinds of combinations of the given tuples. The k-CSQ is an important tool for areas such as decision making, market analysis, business planning, and quantitative economics research. In this paper, we will formally define this new problem, propose an intelligent method to resolve this problem, and also conduct a set of experiments to show the effectiveness and efficiency of the proposed algorithm.
KeywordsUser Preference Query Time Investment Portfolio Large Data Base Skyline Query
Unable to display preview. Download preview PDF.
- 1.Reilly, F.K., Brown, K.C.: Investment Analysis & Portfolio Management, 7e. Thomson (2003)Google Scholar
- 4.Chomicki, J., Godfrey, R., Gryz, J., Liang, D.: Skyline with presorting. In: Proceedings of the 19th International Conference on Data Engineering, ICDE 2003, pp. 717–719. IEEE Computer Society, Los Alamitos (2003)Google Scholar
- 5.Gautam, D., Dimitrios, G., Nick, K., Dimitris, T.: Answering top-k queries using views. In: VLDB 2006: Proceedings of the 32nd international conference on Very large data bases, September 2006, pp. 451–462 (2006)Google Scholar
- 7.Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In: Proceedings of the 31st International Conference on Very Large Data Bases, August 2005, pp. 229–240 (2005)Google Scholar
- 8.Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: Dada: a data cube for dominant relationship analysis. In: SIGMOD Conference, June 2006, pp. 659–670 (2006)Google Scholar
- 9.Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings of the 27th International Conference on Very Large Data Bases, September 2001, pp. 301–310 (2001)Google Scholar
- 10.Michael, M., Patel, J.M., Jagadish, H.V.: Efficient skyline computation over low-cardinality domains. In: Proceedings of the 33rd international conference on Very large data bases, September 2007, pp. 267–278 (2007)Google Scholar
- 11.Anderson, I.: A First Course in Discrete Mathematics. Springer, Heidelberg (2000)Google Scholar
- 12.Su, I.F., Chung, Y.C., Lee, C.: Top-k combinatorial skyline queries. Technical report, Department of Computer Science and Information Engineering, National Cheng Kung University (2009), http://dblab.csie.ncku.edu.tw/~emily/techreportgroupskyline2009.pdf