@inproceedings{bry_computational_2003,
	title = {A Computational Biology Database Digest},
	url = {http://dl.acm.org/citation.cfm?id=607994},
	author = {Bry, François and Kröger, Peer},
	year = {2003}
}

@article{galperin_molecular_2008,
	title = {The Molecular Biology Database Collection: 2008 update},
	volume = {36},
	issn = {0305-1048},
	shorttitle = {The Molecular Biology Database Collection},
	doi = {10.1093/nar/gkm1037},
	abstract = {The Nucleic Acids Research online Molecular Biology Database Collection is a public repository that lists more than 1000 databases described in this and previous Nucleic Acids Research annual database issues, as well as a selection of molecular biology databases described in other journals. All databases included in this Collection are freely available to the public. The 2008 update includes 1078 databases, 110 more than the previous one. The links to more than 80 databases have been updated and 25 obsolete databases have been removed from the list. The complete database list and summaries are available online at the Nucleic Acids Research web site, http://nar.oxfordjournals.org/.},
	number = {Database issue},
	journal = {Nucleic Acids Research},
	author = {Galperin, Michael Y.},
	month = jan,
	year = {2008},
	note = {{PMID:} 18025043
{PMCID:} 2238887},
	pages = {D2--D4}
}


@article{acid_def,
	title = {Principles of transaction-oriented database recovery},
	volume = {15},
	issn = {03600300},
	url = {http://dl.acm.org/citation.cfm?id=291},
	doi = {10.1145/289.291},
	journal = {{ACM} Computing Surveys},
	author = {Haerder, Theo and Reuter, Andreas},
	month = dec,
	year = {1983},
	pages = {287--317}
}

@article{hadoop,
  	title={The hadoop distributed file system: Architecture and design},
  	author={Borthakur, D.},
	url = {http://hadoop.apache.org/common/docs/r0.18.0/hdfs_design.pdf},
  	journal={Hadoop Project Website},
  	year={2007}
}

@article{cassandra,
  	title={Cassandra: Principles and Application},
  	author={Featherston, D.},
	url = {http://dfeatherston.com/cassandra-cs591-su10-fthrstn2.pdf}
}

@article{biozon,
	title = {{BIOZON:} a hub of heterogeneous biological data},
	volume = {34},
	issn = {0305-1048, 1362-4962},
	shorttitle = {{BIOZON}},
	url = {http://nar.oxfordjournals.org/content/34/suppl_1/D235.abstract},
	doi = {10.1093/nar/gkj153},
	journal = {Nucleic Acids Research},
	author = {Birkland, A.},
	month = jan,
	year = {2006},
	pages = {D235--D242}
}



@misc{mongodb,
	title = {MongoDB},
	url = {http://www.mongodb.org/}
}


@misc{brewers_conjecture,
	title = {Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services},
	url = {lpd.epfl.ch/sgilbert/pubs/BrewersConjecture-SigAct.pdf},
	author = {Seth Gilbert and Nancy Lynch}
}

@misc{simpledb,
	title = {Amazon SimpleDB},
	url = {http://aws.amazon.com/simpledb/},
	howpublished = {http://aws.amazon.com/simpledb/}
}

@article{dean_mapreduce_2008,
	title = {{MapReduce}},
	volume = {51},
	issn = {00010782},
	url = {http://dl.acm.org/citation.cfm?id=1327492},
	doi = {10.1145/1327452.1327492},
	journal = {Communications of the {ACM}},
	author = {Dean, Jeffrey and Ghemawat, Sanjay},
	month = jan,
	year = {2008},
	pages = {107}
}

@article{cloudblast,
	title = {{CloudBurst:} highly sensitive read mapping with {MapReduce}},
	volume = {25},
	shorttitle = {{CloudBurst}},
	url = {http://bioinformatics.oxfordjournals.org/content/25/11/1363.abstract},
	doi = {10.1093/bioinformatics/btp236},
	abstract = {Motivation: Next-generation {DNA} sequencing machines are generating an enormous amount of sequence data, placing unprecedented demands on traditional single-processor read-mapping algorithms. {CloudBurst} is a new parallel read-mapping algorithm optimized for mapping next-generation sequence data to the human genome and other reference genomes, for use in a variety of biological analyses including {SNP} discovery, genotyping and personal genomics. It is modeled after the short read-mapping program {RMAP}, and reports either all alignments or the unambiguous best alignment for each read with any number of mismatches or differences. This level of sensitivity could be prohibitively time consuming, but {CloudBurst} uses the open-source Hadoop implementation of {MapReduce} to parallelize execution using multiple compute {nodes.Results:} {CloudBurst's} running time scales linearly with the number of reads mapped, and with near linear speedup as the number of processors increases. In a 24-processor core configuration, {CloudBurst} is up to 30 times faster than {RMAP} executing on a single core, while computing an identical set of alignments. Using a larger remote compute cloud with 96 cores, {CloudBurst} improved performance by {\textgreater}100-fold, reducing the running time from hours to mere minutes for typical jobs involving mapping of millions of short reads to the human {genome.Availability:} {CloudBurst} is available open-source as a model for parallelizing algorithms with {MapReduce} at {http://cloudburst-bio.sourceforge.net/.Contact:} mschatz@umiacs.umd.edu},
	number = {11},
	journal = {Bioinformatics},
	author = {Schatz, Michael C.},
	month = jun,
	year = {2009},
	pages = {1363 --1369}
}

@article{hbase,
  	title={HBase and Hypertable for large scale distributed storage systems},
  	author={Khetrapal, Ankur and Vinay Ganesh},
	url = {http://www.uavindia.com/ankur/downloads/HypertableHBaseEval2.pdf}
}

