The VLDB Journal

, Volume 25, Issue 4, pp 545–570 | Cite as

Know your customer: computing k-most promising products for targeted marketing

  • Md. Saiful Islam
  • Chengfei Liu
Regular Paper


The advancement of World Wide Web has revolutionized the way the manufacturers can do business. The manufacturers can collect customer preferences for products and product features from their sales and other product-related Web sites to enter and sustain in the global market. For example, the manufactures can make intelligent use of these customer preference data to decide on which products should be selected for targeted marketing. However, the selected products must attract as many customers as possible to increase the possibility of selling more than their respective competitors. This paper addresses this kind of product selection problem. That is, given a database of existing products P from the competitors, a set of company’s own products Q, a dataset C of customer preferences and a positive integer k, we want to find k-most promising products (k-MPP) from Q with maximum expected number of total customers for targeted marketing. We model k-MPP query and propose an algorithmic framework for processing such query and its variants. Our framework utilizes grid-based data partitioning scheme and parallel computing techniques to realize k-MPP query. The effectiveness and efficiency of the framework are demonstrated by conducting extensive experiments with real and synthetic datasets.


Product selection Dynamic skylines Reverse skylines Algorithms Complexity analysis 



The work is supported by the ARC Discovery Grant DP140103499. We would like to thank Dr. Robin Humble for his help on optimizing the performance of our programs in Swinburne HPC system and the anonymous reviewers for their insightful feedback.


  1. 1.
    Arvanitis, A., Deligiannakis, A., Vassiliou, Y.: Efficient influence-based processing of market research queries. In: CIKM, pp. 1193–1202 (2012)Google Scholar
  2. 2.
    Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421–430 (2001)Google Scholar
  3. 3.
    Chang, K.C., Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, June 3–6, 2002, pp. 346–357 (2002)Google Scholar
  4. 4.
    Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: VLDB, pp. 291–302 (2007)Google Scholar
  5. 5.
    Deshpande, P.M., Padmanabhan, D.: Efficient reverse skyline retrieval with arbitrary non-metric similarity measures. In: EDBT, pp. 319–330 (2011)Google Scholar
  6. 6.
    Ester, M., Ge, R., Jin, W., Hu, Z.: A microeconomic data mining problem: customer-oriented catalog segmentation. In: KDD, pp. 557–562 (2004)Google Scholar
  7. 7.
    Frischknecht, B., Gonzalez, R., Papalambros, P., Reid, T.: A design science approach to analytical product design. In: International Conference on Engineering Design, 24–27 (2009)Google Scholar
  8. 8.
    Islam, M.S., Zhou, R., Liu, C.: On answering why-not questions in reverse skyline queries. In: ICDE, pp. 973–984 (2013)Google Scholar
  9. 9.
    Koh, J.-L., Lin, C.-Y., Chen, A.L.P.: Finding k most favorite products based on reverse top-t queries. VLDB J. 23(4), 541–564 (2014)CrossRefGoogle Scholar
  10. 10.
    Köhler, H., Yang, J., Zhou, X.: Efficient parallel skyline processing using hyperplane projections. In: SIGMOD, pp. 85–96 (2011)Google Scholar
  11. 11.
    Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: a data cube for dominant relationship analysis. In: SIGMOD, pp. 659–670 (2006)Google Scholar
  12. 12.
    Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: SIGMOD, pp. 213–226 (2008)Google Scholar
  13. 13.
    Lin, C.-Y., Koh, J.-L., Chen, A.L.P.: Determining \((k)\)-most demanding products with maximum expected number of total customers. IEEE Trans. Knowl. Data Eng. 25(8), 1732–1747 (2013)CrossRefGoogle Scholar
  14. 14.
    Miah, M., Das, G., Hristidis, V., Mannila, H.: Standing out in a crowd: selecting attributes for maximum visibility. In: ICDE, pp. 356–365(2008)Google Scholar
  15. 15.
    Miah, M., Das, G., Hristidis, V., Mannila, H.: Determining attributes to maximize visibility of objects. IEEE Trans. Knowl. Data Eng. 21(7), 959–973 (2009)CrossRefGoogle Scholar
  16. 16.
    Michalek, J.J., Feinberg, R.M., Papalambros, P.Y.: An optimal marketing and engineering design model for product development using analytical target cascading. In: Proceedings of the TMCE, April 12–16 (2004)Google Scholar
  17. 17.
    Mullesgaard, K., Pederseny, J.L., Lu, H., Zhou, Y.: Efficient skyline computation in MapReduce. In: EDBT, pp. 37–48 (2014)Google Scholar
  18. 18.
    Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp. 467–478 (2003)Google Scholar
  19. 19.
    Park, Y., Min, J.-K., Shim, K.: Parallel computation of skyline and reverse skyline queries using MapReduce. PVLDB 6(14), 2002–2013 (2013)Google Scholar
  20. 20.
    Peng, Y., Wong, R.C., Wan, Q.: Finding top-k preferable products. IEEE Trans. Knowl. Data Eng. 24(10), 1774–1788 (2012)CrossRefGoogle Scholar
  21. 21.
    Pertesis, D., Doulkeridis, C.: Efficient skyline query processing in SpatialHadoop. Inf. Syst. 54, 325–335 (2015)Google Scholar
  22. 22.
    Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB, VLDB Endowment, pp. 751–762 (2006)Google Scholar
  23. 23.
    Tao, Y., Ding, L., Lin, X., Pei, J.: Distance-based representative skyline. In: ICDE, pp. 892–903 (2009)Google Scholar
  24. 24.
    Vlachou, A., Doulkeridis, C., Kotidis, Y.: Angle-based space partitioning for efficient parallel skyline computation. In: SIGMOD, pp. 227–238 (2008)Google Scholar
  25. 25.
    Wan, Q., Wong, R.C., Ilyas, I.F., Özsu, M.T., Peng, Y.: Creating competitive products. PVLDB 2(1), 898–909 (2009)Google Scholar
  26. 26.
    Wan, Q., Wong, R.C., Peng, Y.: Finding top-k profitable products. In: ICDE, pp. 1055–1066 (2011)Google Scholar
  27. 27.
    Wu, T., Sun, Y., Li, C., Han, J.: Region-based online promotion analysis. In: EDBT, pp. 63–74 (2010)Google Scholar
  28. 28.
    Wu, T., Xin, D., Mei, Q., Han, J.: Promotion analysis in multi-dimensional space. PVLDB 2(1), 109–120 (2009)Google Scholar
  29. 29.
    Wu, X., Tao, Y., Wong, R.C.-W., Ding, L., Yu, J.X.: Finding the influence set through skylines. In: EDBT, pp. 1030–1041 (2009)Google Scholar
  30. 30.
    Xu, S., Lin, Y., Xie, H., Lui, J.C.S.: A provable algorithmic approach to product selection problems for market entry and sustainability. In: SSDBM, p. 19 (2014)Google Scholar
  31. 31.
    Zhang, B., Zhou, S., Guan, J.: Adapting skyline computation to the MapReduce framework: Algorithms and experiments. In: DASFAA, pp. 403–414, Springer, Berlin (2011)Google Scholar
  32. 32.
    Zhang, S., Mamoulis, N., Cheung, D.W.: Scalable skyline computation using object-based space partitioning. In: SIGMOD, pp. 483–494 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Swinburne University of TechnologyMelbourneAustralia

Personalised recommendations