The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2011 vol.23)
pp: 1050-1064
Stefano Rizzi , University of Bologna, Bologna
Matteo Golfarelli , University of Bologna, Bologna
Multidimensional databases are the core of business intelligence systems. Their users express complex OLAP queries, often returning large volumes of facts, sometimes providing little or no information. Thus, expressing preferences could be highly valuable in this domain. The OLAP domain is representative of an unexplored class of preference queries, characterized by three peculiarities: preferences can be expressed on both numerical and categorical domains; they can also be expressed on the aggregation level of facts; the space on which preferences are expressed includes both elemental and aggregated facts. In this paper, we present myOLAP, an approach for expressing and evaluating OLAP preferences, devised by taking into account the three peculiarities above. We first propose a preference algebra where users are enabled to express their preferences, besides on attributes and measures, also on the aggregation level of facts, for instance, by stating that monthly data are preferred to yearly and daily data. Then, with respect to preference evaluation, we propose an algorithm called WeSt that relies on a novel graph representation where two types of domination between sets of facts may be expressed, which considerably improves efficiency. The approach is extensively tested for efficiency and effectiveness on real data, and compared against two other approaches in the literature.
Decision support, personalization, query processing.
Stefano Rizzi, Matteo Golfarelli, "myOLAP: An Approach to Express and Evaluate OLAP Preferences", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 7, pp. 1050-1064, July 2011, doi:10.1109/TKDE.2010.196
[1] J. Han, "Towards Online Analytical Mining in Large Databases," ACM SIGMOD Record, vol. 27, no. 1, pp. 97-107, 1998.
[2] Minnesota Population Center, "Integrated Public Use Microdata Series," http:/, 2008.
[3] M. Golfarelli and S. Rizzi, "Expressing OLAP Preferences," Proc. 21st Int'l Conf. Scientific and Statistical Database Management (SSDBM), pp. 83-91, 2009.
[4] W. Kießling, "Foundations of Preferences in Database Systems," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 311-322, 2002.
[5] J. Chomicki, "Preference Formulas in Relational Queries," ACM Trans. Database Systems, vol. 28, no. 4, pp. 427-466, 2003.
[6] K. Stefanidis, E. Pitoura, and P. Vassiliadis, "Adding Context to Preferences," Proc. 23rd Int'l Conf. Data Eng. (ICDE), pp. 846-855, 2007.
[7] H. Jerbi, F. Ravat, O. Teste, and G. Zurfluh, "Applying Recommendation Technology in OLAP Systems," Proc. 11th Int'l Conf. Enterprise Information Systems (ICEIS), pp. 220-233, 2009.
[8] D. Xin and J. Han, "P-Cube: Answering Preference Queries in Multi-Dimensional Space," Proc. 24th Int'l Conf. Data Eng. (ICDE), pp. 1092-1100, 2008.
[9] G. Koutrika and Y. Ioannidis, "Answering Queries Based on Preference Hierarchies," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2008.
[10] C. Li, K.C.-C. Chang, and I.F. Ilyas, "Supporting Ad-Hoc Ranking Aggregates," Proc. ACM SIGMOD, pp. 61-72, 2006.
[11] C. Li, Ê. Wang, L. Lim, H. Wang, and K.C.-C. Chang, "Supporting Ranking and Clustering as Generalized Order-By and Group-By," Proc. ACM SIGMOD, pp. 127-138, 2007.
[12] D. Kossmann, F. Ramsak, and S. Rost, "Shooting Stars in the Sky: An Online Algorithm for Skyline Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 275-286, 2002.
[13] Y. Tao, V. Hristidis, D. Papadias, and Y. Papakonstantinou, "Branch-and-Bound Processing of Ranked Queries," Information Systems, vol. 32, no. 3, pp. 424-445, 2007.
[14] C.Y. Chan, P.-K. Eng, and K.-L. Tan, "Stratified Computation of Skylines with Partially-Ordered Domains," Proc. ACM SIGMOD, pp. 203-214, 2005.
[15] M.D. Morse, J.M. Patel, and H.V. Jagadish, "Efficient Skyline Computation over Low-Cardinality Domains," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 267-278, 2007.
[16] T. Presinger and W. Kießling, "The Hexagon Algoritm for Pareto Preisinger Queries," Proc. Third Multidisciplinary Workshop Advances in Preference Handling (M-PREF), 2007.
[17] P. Georgiadis, I. Kapantaidakis, V. Christophides, E.M. Nguer, and N. Spyratos, "Efficient Rewriting Algorithms for Preference Queries," Proc. 24th Int'l Conf. Data Eng. (ICDE), pp. 1101-1110, 2008.
[18] S. Börzsönyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001.
[19] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Presorting," Proc. 19th Int'l Conf. Data Eng. (ICDE), pp. 717-816, 2003.
[20] P. Godfrey, R. Shipley, and J. Gryz, "Maximal Vector Computation in Large Data Sets," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 229-240, 2005.
[21] I. Bartolini, P. Ciaccia, and M. Patella, "Efficient Sort-Based Skyline Evaluation," ACM Trans. Database Systems, vol. 33, no. 4, pp. 1-49, 2008.
[22] S. Zhang, N. Mamoulis, and D. Cheung, "Scalable Skyline Computation Using Object-Based Space Partitioning," Proc. ACM SIGMOD, pp. 483-494, 2009.
[23] E. Baralis, S. Paraboschi, and E. Teniente, "Materialized Views Selection in a Multidimensional Database," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 156-165, 1997.
[24] W. Kiessling, "Preference Queries with SV-Semantics," Proc. 11th Int'l Conf. Management of Data (COMAD), pp. 15-26, 2005.
[25] T. Preisinger, W. Kießling, and M. Endres, "The BNL++ Algorithm for Evaluating Pareto Preference Queries," Proc. Multidisciplinary Workshop Advances in Preference Handling, 2006.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool