Skip to main content

Finding the most profitable candidate product by dynamic skyline and parallel processing

Distributed and Parallel Databases volume 39, pages 979–1008 (2021)Cite this article

Abstract

Given a set of existing products in the market and a set of customer preferences, we set a price for a specific product selected from a pool of candidate products to launch to market to gain the most profit. A customer preference represents his/her basic requirements. The dynamic skyline of a customer preference identifies the products that the customer may purchase. Each time the price of a candidate product is adjusted, it needs to compete with all of the existing products to determine whether it can be one of the dynamic skyline products of some customer preferences. To compute in parallel, we use a Voronoi-Diagram-based partitioning method to separate the set of existing products and that of customer preferences into cells. For these cells, a large number of combinations can be generated. For each price under consideration of a candidate product, we process all the combinations in parallel to determine whether this candidate product can be one of the dynamic skyline products of the customer preferences. We then integrate the results to decide the price for each candidate product to achieve the most profit. To further improve the performance, we design two efficient pruning strategies to avoid computing all combinations. A set of experiments using real and synthetic datasets are performed and the experiment results reveal that the pruning strategies are effective.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

References

  1. Afrati, F.N., Koutris, P., Suciu, D., Ullman, J.D.: Parallel skyline queries. In: Proceedings of the 15th International Conference on Database Theory (ICDT), pp. 274–284 (2012)

  2. Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline operator. In: Proceedings of the 17th International Conference on Data Engineering (ICDE), pp. 421–430 (2001)

  3. Chester, S., Sidlauskas, D., Assent, I., Bpgh, K.S.: Scalable parallelization of skyline computation for multi-core processors. In: Proceedings of the International Conference on Data Engineering, pp. 1083–1094 (2015)

  4. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting: theory and optimizations. In: Proceedings of the IEEE International Conference on Data Engineering (ICDE), pp. 717–719 (2003)

  5. Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: Proceedings of the 33rd International Conference on Very large Data Bases Conference (VLDB), pp. 291–302 (2007)

  6. Deshpande, P.M., Deepak, P: Efficient reverse skyline retrieval with arbitrary non-metric similarity measures. In: Proceedings of the 14th International Conference on Extending Database Technology (EDBT), pp. 319–330 (2011)

  7. Islam, M.S., Liu, C.: Know your customer: computing k-most promising products for targeted marketing. VLDB J. 25(4), 545–570 (2016)

    Article  Google Scholar 

  8. Koh, J.-L., Lin, C.-Y., Chen, A.L.P.: Finding k most favorite products based on reverse top-t queries. VLDB J. 23, 541–564 (2014)

    Article  Google Scholar 

  9. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: Proceedings of the Very Large Data Bases Conference (VLDB), pp. 175–286 (2002)

  10. Lee, J., Hwang, S.: Scalable skyline computation using a balanced pivot selection technique. Inf. Syst. 39, 1–21 (2014)

    Article  Google Scholar 

  11. Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: a data cube for dominant relationship analysis. In: Proceedings of the 25th ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 659–670 (2006)

  12. Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 213–226 (2008)

  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. (TKDE) 25(8), 1732–1747 (2013)

    Article  Google Scholar 

  14. Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient processing of k nearest neighbor joins using MapReduce. VLDB J. 5(10), 1016–1027 (2012)

    Google Scholar 

  15. Mullesgaard, K., Pederseny, J.L., Lu, H., Zhou, Y.: Efficient skyline computation in MapReduce. In: Proceedings of the 17th International Conference on Extending Database Technology (EDBT), pp. 37–48 (2014)

  16. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 467–478 (2003)

  17. Papadias, D., Tao, Y., Greg, F., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. (TODS) 30(1), 41–82 (2005)

    Article  Google Scholar 

  18. Park, Y., Min, J.-K., Shim, K.: Parallel computation of skyline and reverse skyline queries using MapReduce. VLDB J. 6(14), 2002–2013 (2013)

    Google Scholar 

  19. Peng, Y., Wong, R.C.-W.: Finding competitive price. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 144–153 (2013)

  20. Peng, Y., Wong, R.C.-W., Wan, Q.: Finding top-k preferable products. IEEE Trans. Knowl. Data Eng. (TKDE) 24(10), 1774–1788 (2012)

    Article  Google Scholar 

  21. Random dataset generator for SKYLINE operator evaluation (2020). https://www.postgresql.org/message-id/470E36C2.1040308%40HannesEder.net

  22. Sacharidis, D., Bouros, P., Sellis, T.: Caching dynamic skyline queries. In: Proceedings of the 20th International Conference on Scientific and Statistical Database Management (SSDBM), pp. 55–472 (2008)

  23. Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In Proceedings of the 27th International Conference on Very Large Data Bases Conference (VLDB), pp. 301–310 (2001)

  24. Vlachou, A., Doulkeridis, C., Kotidis, Y.: Angle-based space partitioning for efficient parallel skyline computation. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 227–238 (2008)

  25. Wang, W.-C., Wang, E.T., Chen, A.L.P.: Dynamic skylines considering range queries. In: Proceedings of the 16th International Conference on Database Systems for Advanced Applications: Part II (DASFAA), pp. 235–250 (2011)

  26. Xu, S., Lui, J.C.S.: Product selection problem: improve market share by learning consumer behavior. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 851–860 (2014)

  27. Zhang, S., Mamoulis, N., Cheung, D.W.: Scalable skyline computation using object-based space partitioning. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 483–494 (2009)

  28. Zhang, B., Zhou, S., Guan, J.: Adapting skyline computation to the MapReduce framework: algorithms and experiments. In: Proceedings of the 16th International Conference on Database Systems for Advanced Applications (DASFAA), pp. 403–414 (2011)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan

    Liang Kuang Tai

  2. Computational Intelligence Technology Center, Industrial Technology Research Institute, Hsinchu, Taiwan

    En Tzu Wang

  3. Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan

    Arbee L. P. Chen

Authors
  1. Liang Kuang Tai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. En Tzu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arbee L. P. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arbee L. P. Chen.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Tai, L.K., Wang, E.T. & Chen, A.L.P. Finding the most profitable candidate product by dynamic skyline and parallel processing. Distrib Parallel Databases 39, 979–1008 (2021). https://doi.org/10.1007/s10619-021-07323-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-021-07323-4

Keywords

  • Dynamic skyline
  • Price setting
  • Voronoi-Diagram-based partitioning
  • Parallel processing
  • Pruning strategies