Finding k most favorite products based on reverse top-t queries

Jia-Ling Koh, Chen Yi Lin, Arbee L.P. Chen

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most k products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-t queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-t queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-t favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

Original languageEnglish
Pages (from-to)541-564
Number of pages24
JournalVLDB Journal
Volume23
Issue number4
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Computational complexity
Data storage equipment
Costs
Experiments

Keywords

  • Maximum coverage problem
  • Potential customers
  • Query processing
  • Reverse top-t query

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture

Cite this

Finding k most favorite products based on reverse top-t queries. / Koh, Jia-Ling; Lin, Chen Yi; Chen, Arbee L.P.

In: VLDB Journal, Vol. 23, No. 4, 01.01.2014, p. 541-564.

Research output: Contribution to journalArticle

Koh, Jia-Ling ; Lin, Chen Yi ; Chen, Arbee L.P. / Finding k most favorite products based on reverse top-t queries. In: VLDB Journal. 2014 ; Vol. 23, No. 4. pp. 541-564.
@article{56d9ff69527440059f41fc00cf11c643,
title = "Finding k most favorite products based on reverse top-t queries",
abstract = "A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most k products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-t queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-t queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-t favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.",
keywords = "Maximum coverage problem, Potential customers, Query processing, Reverse top-t query",
author = "Jia-Ling Koh and Lin, {Chen Yi} and Chen, {Arbee L.P.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s00778-013-0336-8",
language = "English",
volume = "23",
pages = "541--564",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "4",

}

TY - JOUR

T1 - Finding k most favorite products based on reverse top-t queries

AU - Koh, Jia-Ling

AU - Lin, Chen Yi

AU - Chen, Arbee L.P.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most k products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-t queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-t queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-t favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

AB - A reverse top-t query for a product returns a set of customers, named potential customers, who regard the product as one of their top-t favorites. Given a set of customers with different preferences on the features of the products, we want to select at most k products from a pool of candidate products such that their total number of potential customers is maximized. Two versions of the problem are defined according to whether the competitive existing products are given. For solving this NP-hard problem, we first propose an incremental greedy approach to find an approximate solution of the problem with quality guaranteed. For further speeding up this basic greedy approach, we exploit several properties of the top-t queries and skyline queries to reduce the solution space of the problem. In addition, an upper bound of the potential customers is estimated to reduce the cost of computing the reverse top-t queries for the candidate products. Finally, when the candidate products are formed from multiple component tables, we propose a strategy to reduce the number of the accessed tuples in the component tables such that only the tuples that are possibly components of the top-t favorites of the customers need to be accessed. By applying these pruning strategies, we propose another faster greedy approach. The experiment results demonstrate that the proposed pruning strategies work very well and make the faster greedy algorithms for both versions of the problem achieve excellent performance on both efficiency and memory utilization.

KW - Maximum coverage problem

KW - Potential customers

KW - Query processing

KW - Reverse top-t query

UR - http://www.scopus.com/inward/record.url?scp=84904562527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904562527&partnerID=8YFLogxK

U2 - 10.1007/s00778-013-0336-8

DO - 10.1007/s00778-013-0336-8

M3 - Article

AN - SCOPUS:84904562527

VL - 23

SP - 541

EP - 564

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 4

ER -