In this paper, we consider two main approaches to compute Grobner bases for parametric polynomial ideals, namely the DisPGB algorithm developed by Montes [18] and the PGBMain proposed by Kapur, Sun and Wang [11]. The former algorithm creates new branches in the space of parameters during the construction of Gr¨obner basis of a given ideal in the polynomial ring of variables and the latter computes (at each iteration) a Gobner basis of the ideal in the polynomial ring of the variables and parameters and creates new branches according to leading coefficients in terms of parameters. Therefore, the latter algorithm can benefit from the efficient implementation of Grobner basis algorithm in each computer algebra system. In order to compare these two algorithms (in the same platform) we use the recent algorithm namely GVW due to Gao et al. [8] to compute Grobner bases which makes the use of the F5 criteria proposed by Faug`ere to remove superfluous reductions [6]. We show that there exists a class of examples so that an incremental structure on the DisPGB algorithm by using the GVW algorithm is faster than the PGBMain by applying the same algorithm to compute Grobner bases. The mentioned algorithms have been implemented in Maple and experimented with a number of examples