Top-k Query for Weighted Interactive Product Configuration
Baijun Chen, Tao Feng · 2018
Interactive product configuration should be complete and backtrack free. it requires that the system responds quickly. A popular solution to implement interactive product configuration is Binary Decision Diagrams(BDDs) which represents the solution space of product model, the structure of BDDs is very compact, and the interactive configuration can be carried out in linearly dependent time of BDD's size. In this paper, we proposed the concept of top-k query about weighted interactive product configuration based on BDDs. the solution space of BDD may be exponential explosion in practice, we defined weight value for each valid configuration, the weight represents price, quality etc., in the interactive phase, users input a rule and k, the system lists top-k maximum(minimum) valid configurations to user for reference. Using our code, we solved a number of problems including those from real application and synthetic data set. Our experiment results showed that our algorithm had a faster response time than the traditional algorithm.