Name
Abstract | ||
|---|---|---|
Stored procedures are an important feature of all major database systems that allows to execute application logic within database servers. This paper reports on experiences to implement a popular scientific algorithm, the Basic Local Alignment Search Tool (BLAST), as stored procedures within a relational database. We implemented the un-gapped, nucleotide version of the BLAST algorithm with four different relational database engines, both commercial and open source. In an experimental evaluation, we compared our dbBLAST implementations with a standard file-based BLAST implementation from NCBI with regard to the implementation effort, runtime performance, and scalability. It shows that although our dbBLAST runs faster than the file-based BLAST program for short query sequences, all implementations lack scalability. However, the results also indicate that stored procedures require significant less development effort—both in time and space—than traditional programming approaches. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11733836_58 | DASFAA |
Keywords | Field | DocType |
blast search,different relational database engine,database server,relational database,major database system,dbblast implementation,file-based blast program,development effort,standard file-based blast implementation,blast algorithm,implementation effort,nucleotides | Inverted index,Data mining,Stored procedure,Relational database,Computer science,Server,Implementation,Local search (optimization),Database server,Database,Scalability | Conference |
Volume | ISSN | ISBN |
3882 | 0302-9743 | 3-540-33337-1 |
Citations | PageRank | References |
2 | 0.42 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uwe Röhm | 1 | 308 | 31.42 |
| Thanh-Mai Diep | 2 | 2 | 0.42 |