Creating a scalable computational infrastructure to analyze the wealth of information contained in data repositories is difficult due to significant barriers in organizing, extracting and analyzing relevant data. Shared data science infrastructures are needed to efficiently process and parse data contained in large data repositories. This thesis introduces Boag, Boa for genomics. The main features of Boa are inspired from existing languages for data-intensive computing and can easily integrate data from biological data repositories.

As a proof of concept, Boag, has been implemented to analyze RefSeq's 153,848 annotation (GFF) and assembly (FASTA) file metadata. Boa provides a massive improvement from existing solutions like Python and MongoDB, by utilizing a domain-specific language that uses Hadoop infrastructure for a smaller storage footprint that scales well and requires fewer lines of code. We execute scripts through Boa to answer questions about the genomes in RefSeq. We identify the largest and smallest genomes deposited, explore exon frequencies for assemblies after 2016, identify the most commonly used bacterial genome assembly program, and address how animal genome assemblies have improved since 2016. Boa databases provide a significant reduction in required storage of the raw data and a significant speedup in its ability to query large datasets due to automated parallelization and distribution of Hadoop infrastructure during computations.

In order to keep pace with our ability to produce biological data, innovative methods are required. The Shared Data Science Infrastructure, Boag, provides researchers greater access to researchers to efficiently explore data in new ways. We demonstrate the potential of the domain-specific language Boa using the RefSeq database to explore how deposited genome assemblies and annotations are changing over time. This is a small example of how Boa could be used with large biological datasets.