ABSTRACT
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval paradigm. But recently it has been convincingly argued that it is almost impossible for users to provide meaningful scoring functions for top-k retrieval, subsequently leading to the adoption of the skyline paradigm. Here users just specify the relevant attributes in a query and all suboptimal alternatives are filtered following the Pareto semantics. Up to now the intuitive concept of compensation, however, cannot be used in skyline queries, which also contributes to the often unmanageably large result set sizes. In this paper we discuss an innovative and efficient method for computing skylines allowing the use of qualitative trade-offs. Such trade-offs compare examples from the database on a focused subset of attributes. Thus, users can provide information on how much they are willing to sacrifice to gain an improvement in some other attribute(s). Our contribution is the design of the first skyline algorithm allowing for qualitative compensation across attributes. Moreover, we also provide an novel trade-off representation structure to speed up retrieval. Indeed our experiments show efficient performance allowing for focused skyline sets in practical applications. Moreover, we show that the necessary amount of object comparisons can be sped up by an order of magnitude using our indexing techniques.
- Balke, W.-T., Lofi, C., Güntzer, U. Incremental Trade-Off Management for Preference Based Queries, Int. Jour. of Computer Science & Applications (IJCSA), 4 (Jun. 2007).Google Scholar
- Balke, W.-T., Zheng, J., Güntzer, U. Approaching the Efficient Frontier: Cooperative Database Retrieval Using High-Dimensional Skylines, Conf. on Database Systems for Advanced Applications (DASFAA), Beijing, China, 2005. Google ScholarDigital Library
- Börzsönyi, S., Kossmann, D., Stocker, K. The Skyline Operator. Int. Conf. on Data Engineering (ICDE), Heidelberg, Germany, 2001. Google ScholarDigital Library
- Chan, C.-Y., Jagadish, H. V., Tan, K.-L., Tung, A. K. H., Zhang, Z. Finding k-dominant skylines in high dimensional space, Int. Conf. on Management of Data (SIGMOD), Chicago, IL, USA, 2006. Google ScholarDigital Library
- Chan, C.-Y., Jagadish, H. V., Tan, K.-L., Tung, A. K. H., Zhang, Z. On High Dimensional Skylines, Advances in Database Technology (EDBT), Munich, Germany, 2006. Google ScholarDigital Library
- Chomicki, J. Iterative Modification and Incremental Evaluation of Preference Queries. Int. Symp. on Found. of Inf. and Knowledge Systems (FoIKS), Budapest, Hungary, 2006. Google ScholarDigital Library
- Godfrey, P. Skyline cardinality for relational processing. How many vectors are maximal? Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS). Vienna, Austria, 2004.Google ScholarCross Ref
- Godfrey, P.; Shipley, R.; Gryz. J. Maximal Vector Computation in Large Data. Int. Conf. on Very Large Databases (VLDB), Trondheim, Norway, 2005. Google ScholarDigital Library
- Hansson, S. O. Preference Logic, Handbook of Philosophical Logic, Second Edition, 4 (2002)Google Scholar
- Ihab F. Ilyas and George Beskales and Mohamed A. Soliman. A Survey of Top-K Query Processing Techniques in Relational Database Systems, ACM Computing Surveys, 40--4 (2008) Google ScholarDigital Library
- Kossmann, D., Ramsak, F., Rost, S. Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. Int. Conf. on Very Large Data Bases (VLDB), Hong Kong, China, 2002. Google ScholarDigital Library
- Lacroix, M., Lavency., P., Preferences: Putting more Knowledge into Queries. Int. Conf. Very Large Databases (VLDB), Brighton, UK, 1987. Google ScholarDigital Library
- Lee, J., You, G., Hwang, S. Telescope: Zooming to Interesting Skylines. Int. Conf. on Database Systems for Advanced Applications (DASFAA), Bangkok, Thailand, 2007. Google ScholarDigital Library
- Lofi, C., Balke, W.-T., Güntzer, U. Efficiently Performing Consistency Checks for Multi-Dimensional Preference Trade-Offs, Int. Conf. on Research Challenges in Computer Science (RCIS), Marrakech, Morocco, 2008.Google ScholarCross Ref
- Papadias, D., Tao, Y., Fu, G., Seeger, B. An Optimal and Progressive Algorithm for Skyline Queries. Int. Conf. on Management of Data (SIGMOD), San Diego, USA, 2003. Google ScholarDigital Library
- Pei, J., Jin, W., Ester, M., Tao, Y. Catching the best views of skyline: a semantic approach based on decisive subspaces. Int. Conf. on Very Large Data Bases, Trondheim, Norway, 2005 Google ScholarDigital Library
- Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J. Y., Zhang, Q., Efficient computation of the skyline cube, Int. Conf. on Very Large Data Bases, Trondheim, Norway, 2005. Google ScholarDigital Library
Index Terms
- Efficient computation of trade-off skylines
Recommendations
Flexible Skylines: Dominance for Arbitrary Sets of Monotone Functions
SIGMOD 2019 Best Paper, PODS 2019 Best Paper, and Regular PapersSkyline and ranking queries are two popular, alternative ways of discovering interesting data in large datasets. Skyline queries are simple to specify, as they just return the set of all non-dominated tuples, thereby providing an overall view of ...
Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods
Uncertain data are inherent in some important applications. Although a considerable amount of research has been dedicated to modeling uncertain data and answering some types of queries on uncertain data, how to conduct advanced analysis on uncertain ...
Toward efficient multidimensional subspace skyline computation
Skyline queries have attracted considerable attention to assist multicriteria analysis of large-scale datasets. In this paper, we focus on multidimensional subspace skyline computation that has been actively studied for two approaches. First, to narrow ...
Comments