• DocumentCode
    2054169
  • Title

    Computation Time Reduction to Speed-up the Database Searching Process

  • Author

    Bonny, Talal ; Soudan, Bassel

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Sharjah, Sharjah, United Arab Emirates
  • fYear
    2015
  • fDate
    18-20 May 2015
  • Firstpage
    121
  • Lastpage
    126
  • 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.
  • Keywords
    query processing; computation time reduction; database searching process; database sequence searching; DNA; Distributed databases; Heuristic algorithms; Standards; Streaming media; Time measurement; Database; Needleman-Wunsch; Sequence Analysis; sequence comparison;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic (ISMVL), 2015 IEEE International Symposium on
  • Conference_Location
    Waterloo, ON
  • ISSN
    0195-623X
  • Type

    conf

  • DOI
    10.1109/ISMVL.2015.24
  • Filename
    7238144