Abstract
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation of skylines based on additional information elicited from the user. Extending the traditional case of totally ordered domains, we consider preferences in their most general form as strict partial orders of attribute values. After getting an initial skyline set our basic approach aims at interactively increasing the system’s information about the user’s wishes explicitly including indifferences. The additional knowledge then is incorporated into the preference information and constantly reduces skyline sizes. In fact, our approach even allows users to specify trade-offs between different query predicates, thus effectively decreasing the query dimensionality. We give theoretical proof for the soundness and consistence of the extended preference information and an extensive experimental evaluation of the efficiency of our approach. On average, skyline sizes can be considerably decreased in each elicitation step.
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
Balke, W.-T., Güntzer, U.: Multi-objective Query Processing for Database Systems. In: Int. Conf. on Very Large Data Bases (VLDB), Toronto, Canada (2004)
Balke, W.-T., Güntzer, U., Siberski, W.: Exploiting Indifference for Customization of Partial Order Skylines. In: Int. Database Engineering and Applications Symp. (IDEAS), Delhi, India (2006)
Balke, W.-T., Güntzer, U., Zheng, J.X.: Efficient Distributed Skylining for Web Information Systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)
Balke, W.-T., Zheng, J.X., Güntzer, U.: Approaching the Efficient Frontier: Cooperative Database Retrieval Using High-Dimensional Skylines. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 410–421. Springer, Heidelberg (2005)
Bentley, J., Kung, H., Schkolnick, M., Thompson, C.: On the Average Number of Maxima in a Set of Vectors and Applications. Journal of the ACM (JACM) 25(4) (1978)
Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Int. Conf. on Data Engineering (ICDE), Heidelberg, Germany (2001)
Boutilier, C., Brafman, R., Geib, C., Poole, D.: A Constraint-Based Approach to Preference Elicitation and Decision Making. In: AAAI Spring Symposium on Qualitative Decision Theory, Stanford, USA (1997)
Boutilier, C.: A POMDP Formulation of Preference Elicitation Problems. In: National Conference on Artificial Intelligence (AAAI), Edmonton, USA (2002)
Chomicki, J.: Preference Formulas in Relational Queries. ACM Transactions on Database Systems (TODS) 28(4) (2003)
Chomicki, J.: Iterative Modification and Incremental Evaluation of Preference Queries. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 63–82. Springer, Heidelberg (2006)
Godfrey, P.: Skyline Cardinality for Relational Processing. In: Seipel, D., Turull-Torres, J.M.a. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 78–97. Springer, Heidelberg (2004)
Keeney, R., Raiffa, H.: Decisions with Multiple Objectives: Preferences and value tradeoffs. Cambridge University Press, Cambridge (1976)
Kießling, W.: Foundations of Preferences in Database Systems. In: Int. Conf. on Very Large Databases (VLDB), Hong Kong, China (2002)
Koltun, V., Papadimitriou, C.H.: Approximately Dominating Representatives. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 204–214. Springer, Heidelberg (2004)
Kossmann, D., Ramsak, F., Rost, S.: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries. In: Int. Conf. on Very Large Data Bases (VLDB), Hong Kong, China (2002)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An Optimal and Progressive Algorithm for Skyline Queries. In: Int. Conf. on Management of Data (SIGMOD), San Diego, USA (2003)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In: Int. Conf. on Very Large Databases (VLDB), Trondheim, Norway (2005)
Satty, T.: A Scaling Method for Priorities in Hierarchical Structures. Journal of Mathematical Psychology (1977)
Xia, T., Zhang, D.: Refreshing the sky: the compressed skycube with efficient support for frequent updates. In: Int. Conf. on Management of Data (SIGMOD), Chicago, USA (2006)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J., Zhang, Q.: Efficient Computation of the Skyline Cube. In: Int. Conf. on Very Large Databases (VLDB), Trondheim, Norway (2005)
Chen, L., Pu, P.: Survey of Preference Elicitation Methods. EPFL Technical Report IC/2004/67, Lausanne, Swiss (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balke, WT., Güntzer, U., Lofi, C. (2007). Eliciting Matters – Controlling Skyline Sizes by Incremental Integration of User Preferences. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)