Sciweavers

Share
SC
2000
ACM

Data Access Performance in a Large and Dynamic Pharmaceutical Drug Candidate Database

9 years 1 months ago
Data Access Performance in a Large and Dynamic Pharmaceutical Drug Candidate Database
An explosion in the amount of data generated through chemical and biological experimentation has been observed in recent years. This rapid proliferation of vast amounts of data has led to a set of cheminformatics and bioinformatics applications that manipulate dynamic, heterogeneous, and massive data. An example of such applications in the pharmaceutical industry is the computational process involved in the early discovery of lead drug candidates for a given target disease. This computational process includes repeated sequential and random accesses to a drug candidate database. Using the above pharmaceutical application, an experimental study was conducted in this paper that shows that for optimal performance, the degree of parallelism exploited in the application should be adjusted according to the drug candidate database instance size and the machine size. Additionally, different degrees of parallelism should be used depending on whether the access to the drug candidate database is...
Zina Ben-Miled, Yang Liu, David Powers, Omran A. B
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where SC
Authors Zina Ben-Miled, Yang Liu, David Powers, Omran A. Bukhres, Michael Bem, Robert Jones, Robert J. Oppelt, Samuel Milosevich
Comments (0)
books