Abstract
Skyline queries retrieve the most interesting objects from a database with respect to multi-dimensional preferences. Identifying and extracting the relevant data corresponding to multiple criteria provided by users remains a difficult task, especially when the data are large. In 2008-2009, Wong et al. showed how to avoid costly skyline query computations by deriving the skyline points associated with any preference from the skyline points associated with the most preferred values. They propose to materialize these points in a structure called IPO-tree (Implicit Preference Order Tree). However, its size is exponential with respect to the number of dimensions. We propose an incremental method for calculating the skyline points related to several dimensions associated with dynamic preferences. For this purpose, a materialization of linear size which allows a great flexibility for dimension preference updates is defined. This contribution improves notably the computation cost of queries. Experiments on synthetic data highlight the relevance of EC 2 Sky compared to IPO-Tree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of Multiobjective Optimization. Academic Press, Orlando (1985)
Raïssi, C., Pei, J., Kister, T.: Computing closed skycubes. PVLDB 3(1), 838–847 (2010)
Wong, R.C.W., Fu, A.W.C., Pei, J., Ho, Y.S., Wong, T., Liu, Y.: Efficient skyline querying with variable user preferences on nominal attributes. PVLDB 1(1), 1032–1043 (2008)
Wong, R.C.W., Pei, J., Fu, A.W.C., Wang, K.: Online skyline analysis with dynamic preferences on nominal attributes. IEEE Trans. Knowl. Data Eng. 21(1), 35–49 (2009)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB, pp. 241–252 (2005)
Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. IEEE Trans. on Knowl. and Data Eng., 1072–1088 (2008)
Huang, Z., Guo, J., Sun, S., Wang, W.: Efficient optimization of multiple subspace skyline queries. J. Comput. Sci. Technol, 103–111 (2008)
Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. of the 17th ICDE, pp. 421–430. IEEE Computer Society (2001)
Mindolin, D., Chomicki, J.: Preference elicitation in prioritized skyline queries. VLDB J 20(2), 157–182 (2011)
Brando, C., Goncalves, M., González, V.: Evaluating Top-k Skyline Queries over Relational Databases. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 254–263. Springer, Heidelberg (2007)
Bouadi, T., Bringay, S., Poncelet, P., Teisseire, M.: Requêtes skyline avec prise en compte des préférences utilisateurs pour des données volumineuses. In: EGC 2010, pp. 399–404 (2010)
Balke, W., Guntzer, U., Siberski, W.: Exploiting indifference for customization of partial order skylines. In: Proc. of the 10th IDEAS, pp. 80–88. IEEE Computer Society (2006)
Trenkler, G.: Univariate discrete distributions : N.L. Johnson, S. Kotz and A.W. Kemp: 2nd edn. John Wiley, New York (1992) ISBN 0-471-54897-9; Computational Statistics & Data Analysis, 240–241 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouadi, T., Cordier, MO., Quiniou, R. (2012). Incremental Computation of Skyline Queries with Dynamic Preferences. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)