Computation Time Reduction to Speed-up the Database Searching Process

Abstract

Computation time is one of the major concerns in database sequence applications such as searching process. These kinds of applications need to process many sequences and as result, consume much computation time. The mean and standard deviation of the different codes in each sequence of the database are parameters which may be used for searching process. We introduce a novel and efficient technique which computes these parameters for each sequence of the database off-line (i.e. design time). Each time a new sequence is required to be searched in the database on-line (i.e. run time), these parameter are used for comparison. Using our technique, we explicitly accelerate the database sequence searching by 35% in comparison to the traditional known methods.