The typical semiclassical wave version of the unsorted database search algorithm based on a system of coupled simple harmonic oscillators does not consider an important ingredient of Grovers original algorithm as it is quantum entanglement. The role of entanglement in the wave version of the unsorted database search algorithm is explored and contradictions with the time of execution of Grovers algorithm are found. We remedy the contradictions by employing two arguments, one of them qualitative and the other quantitative. For the qualitative argument we employ the probabilistic nature of a legitimate quantum algorithm and remedy the above inconsistence. Within the quantitative argument we identify a parameter in the wave version of the unsorted database search algorithm which is related to entanglement. The contradiction with the time of execution of Grovers algorithm is solved by choosing an appropriate values of such a parameter which incorporates entanglement to the wave version of the unsorted database search algorithm. The utility of the present arguments are evident if the wave version of the unsorted data base search algorithm is experimentally implemented through a system of N quantum dots with a harmonic oscillator potential as a confinement potential for each of the quantum dots. Each of the above N vibrating quantum dots must be coupled to an extra single vibrating quantum dot which entangles to all of them. In order to obtain optimal results, the coupling constants of the mentioned quantum dots should be adjusted in the way described in the present work.