Constraint satisfaction problems or CSP are very often used to formalize product configuration problems in both research and industry. CSP formalize relevant knowledge through variables, each one associated to a definition domain, linked by constraints, limiting the combinations of their permissible values. Thus, CSP makes it possible to describe exhaustively the solution space, corresponding to a set of all possible products. Two different methods of processing CSP allow to exploit the generic models in an interactive way: problem filtering methods (reasoning directly on the CSP network and removing inconsistent values) and solution filtering methods (reasoning on a representation of the solution space in the form of a compiled graph). Both of the methods have advantages and drawbacks in online product configuration. This paper aims at putting the first ideas on the joint use of these two methods in the same interactive configuration problem.