{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:15:01Z","timestamp":1758266101045},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous works study how to help customers find a set of \"best\" possible products from a pool of given products. In this paper, we identify an interesting problem, creating competitive products, which has not been studied before. Given a set of products in the existing market, we want to study how to create a set of \"best\" possible products such that the newly created products are not dominated by the products in the existing market. We refer such products as competitive products. A straightforward solution is to generate a set of all possible products and check for dominance relationships. However, the whole set is quite large. In this paper, we propose a solution to generate a subset of this set effectively. An extensive performance study using both synthetic and real datasets is reported to verify its effectiveness and efficiency.<\/jats:p>","DOI":"10.14778\/1687627.1687729","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"898-909","source":"Crossref","is-referenced-by-count":41,"title":["Creating competitive products"],"prefix":"10.14778","volume":"2","author":[{"given":"Qian","family":"Wan","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology"}]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}]},{"given":"Ihab F.","family":"Ilyas","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Yu","family":"Peng","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.60"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066181"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"e_1_2_1_7_1","volume-title":"SODA","author":"J. L.","year":"1990","unstructured":"J. L. B. et al. Fast linear expected-time algorithms for computing maxima and convex hulls . In SODA , 1990 . J. L. B. et al. Fast linear expected-time algorithms for computing maxima and convex hulls. In SODA, 1990."},{"key":"e_1_2_1_8_1","volume-title":"Theory of Probability and its Application, 11(2)","author":"O.","year":"1966","unstructured":"O. B.-N. et al. On the distribution of the number of admissable points in a vector random sample . In Theory of Probability and its Application, 11(2) , 1966 . O. B.-N. et al. On the distribution of the number of admissable points in a vector random sample. In Theory of Probability and its Application, 11(2), 1966."},{"key":"e_1_2_1_9_1","volume-title":"International Conference on Very Large Data Bases (VLDB)","author":"Godfrey P.","year":"2005","unstructured":"P. Godfrey , R. Shipley , and J. Gryz . Maximal vector computation in large data sets . In International Conference on Very Large Data Bases (VLDB) , 2005 . P. Godfrey, R. Shipley, and J. Gryz. Maximal vector computation in large data sets. In International Conference on Very Large Data Bases (VLDB), 2005."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401940"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368992"},{"key":"e_1_2_1_12_1","volume-title":"VLDB","author":"Kossmann D.","year":"2002","unstructured":"D. Kossmann , F. Ramsak , and S. Rost . Shooting stars in the sky: An online algorithm for skyline queries . In VLDB , 2002 . D. Kossmann, F. Ramsak, and S. Rost. Shooting stars in the sky: An online algorithm for skyline queries. In VLDB, 2002."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"e_1_2_1_14_1","volume-title":"VLDB","author":"Pei J.","year":"2005","unstructured":"J. Pei , W. Jin , M. Ester , and Y. Tao . Catching the best views of skyline: A semantic approach based on decisive subspaces . In VLDB , 2005 . J. Pei, W. Jin, M. Ester, and Y. Tao. Catching the best views of skyline: A semantic approach based on decisive subspaces. In VLDB, 2005."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.129"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2008.4498313"},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Tan K.-L.","year":"2001","unstructured":"K.-L. Tan , P. Eng , and B. Ooi . Efficient progressive skyline computation . In VLDB , 2001 . K.-L. Tan, P. Eng, and B. Ooi. Efficient progressive skyline computation. In VLDB, 2001."},{"key":"e_1_2_1_18_1","volume-title":"Creating competitive products. In http:\/\/www.cse.ust.hk\/~raywong\/paper\/createCompetitiveProducttechnical.pdf","author":"Wan Q.","year":"2009","unstructured":"Q. Wan , R. C.-W. Wong , I. F. Ilyas , M. T. Ozsu , and Y. Peng . Creating competitive products. In http:\/\/www.cse.ust.hk\/~raywong\/paper\/createCompetitiveProducttechnical.pdf , 2009 . Q. Wan, R. C.-W. Wong, I. F. Ilyas, M. T. Ozsu, and Y. Peng. Creating competitive products. In http:\/\/www.cse.ust.hk\/~raywong\/paper\/createCompetitiveProducttechnical.pdf, 2009."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453967"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281278"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142529"},{"key":"e_1_2_1_22_1","volume-title":"VLDB","author":"Yuan Y.","year":"2005","unstructured":"Y. Yuan , X. Lin , Q. Liu , W. Wang , J. X. Yu , and Q. Zhang . Efficient computation of the skyline cube . In VLDB , 2005 . Y. Yuan, X. Lin, Q. Liu, W. Wang, J. X. Yu, and Q. Zhang. Efficient computation of the skyline cube. In VLDB, 2005."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460797.1460801"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:33:03Z","timestamp":1672227183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687729"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687729","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}