Related Experiment Video
Updated: Aug 30, 2026

Executing Complexity-Increasing Queries in Relational (MySQL) and NoSQL (MongoDB and EXist) Size-Growing ISO/EN 13606 Standardized EHR Databases
Published on: March 19, 2018
Parallel BLAST on split databases
1Division of Biology, California Institute of Technology, Pasadena, CA 91125, USA. mathog@caltech.edu
Summary:
BLAST programs often run on large SMP machines where multiple threads can work simultaneously and there is enough memory to cache the databases between program runs. A group of programs is described which allows comparable performance to be achieved with a Beowulf configuration in which no node has enough memory to cache a database but the cluster as an aggregate does. To achieve this result, databases are split into equal sized pieces and stored locally on each node. Each query is run on all nodes in parallel and the resultant BLAST output files from all nodes merged to yield the final output.
Availability:
Source code is available from ftp://saf.bio.caltech.edu/
Related Concept Videos
Tandem Mass Spectrometry
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule
Long-patch Base Excision Repair
¹³C NMR: ¹H–¹³C Decoupling
A broadband decoupling technique is used to simplify these complex, sometimes overlapping, signals. Broadband decoupling relies on a...
¹H NMR Signal Multiplicity: Splitting Patterns

