Skip to main content
Download PDF

Applications of the MapReduce programming framework to clinical big data analysis: current landscape and future trends

BioData Mining volume 7, Article number: 22 (2014) Cite this article

Abstract

The emergence of massive datasets in a clinical setting presents both challenges and opportunities in data storage and analysis. This so called “big data” challenges traditional analytic tools and will increasingly require novel solutions adapted from other fields. Advances in information and communication technology present the most viable solutions to big data analysis in terms of efficiency and scalability. It is vital those big data solutions are multithreaded and that data access approaches be precisely tailored to large volumes of semi-structured/unstructured data.

The MapReduce programming framework uses two tasks common in functional programming: Map and Reduce. MapReduce is a new parallel processing framework and Hadoop is its open-source implementation on a single computing node or on clusters. Compared with existing parallel processing paradigms (e.g. grid computing and graphical processing unit (GPU)), MapReduce and Hadoop have two advantages: 1) fault-tolerant storage resulting in reliable data processing by replicating the computing tasks, and cloning the data chunks on different computing nodes across the computing cluster; 2) high-throughput data processing via a batch processing framework and the Hadoop distributed file system (HDFS). Data are stored in the HDFS and made available to the slave nodes for computation.

In this paper, we review the existing applications of the MapReduce programming framework and its implementation platform Hadoop in clinical big data and related medical health informatics fields. The usage of MapReduce and Hadoop on a distributed system represents a significant advance in clinical big data processing and utilization, and opens up new opportunities in the emerging era of big data analytics. The objective of this paper is to summarize the state-of-the-art efforts in clinical big data analytics and highlight what might be needed to enhance the outcomes of clinical big data analytics tools. This paper is concluded by summarizing the potential usage of the MapReduce programming framework and Hadoop platform to process huge volumes of clinical data in medical health informatics related fields.

Peer Review reports

Introduction

Big data is the term used to describe huge datasets having the “4 V” definition: volume, variety, velocity and value (e.g. medical images, electronic medical records (EMR), biometrics data, etc.). Such datasets present problems with storage, analysis, and visualization [1, 2]. To deal with these challenges, new software programming frameworks to multithread computing tasks have been developed [2–4]. These programming frameworks are designed to get their parallelism not from a supercomputer, but from computing clusters: large collections of commodity hardware, including conventional processors (computing nodes) connected by Ethernet cables or inexpensive switches. These software programming frameworks begin with a new form of file system, known as a distributed file system (DFS) [3, 4], which features much larger units than the disk blocks in a conventional operating system. DFS also provides replication of data or redundancy to protect against the frequent media failures that occur when data is distributed over potentially thousands of low cost computing nodes [3]. The goal of this review is to summarize the potential and expanding usage of MapReduce on top of the Hadoop platform in the processing of clinical big data. A secondary objective is to highlight the potential benefits of predictive and prescriptive clinical big data analytics. These types of analytics are needed for better usage and optimization of resources [5, 6].

Types of analytics

Analytics is a term used to describe various goals and techniques of processing a dataset.

There are three types of analytics:

  1. 1-

    Descriptive analytics: is a process to summarize the dataset under investigation. It may be used to generate standard reports that might be useful to address questions like “What happened? What is the problem? What actions are needed?”

  2. 2-

    Predictive analytics: descriptive analytics, unfortunately do not tell anything about the future, that is the reason predictive analytics is needed. Predictive analytics utilize statistical models of the historical datasets to predict the future. Predictive analytics are useful to answer questions like “Why is this happening? What will happen next?”. The predictive ability is dependent on the goodness of fit of the statistical model [6].

  3. 3-

    Prescriptive analytics: are the type of analytics that help in utilizing different scenarios of the data model (i.e. multi-variables simulation, detecting hidden relationships between different variables). It is useful to answer questions like “What will happen if this scenario of resource utilization is used? What is the best scenario?”. Prescriptive analytics are generally used in optimization problems and require sophisticated algorithms to find the optimum solution and therefore are less widely used in some fields (i.e. clinical big data analytics).

This paper summarizes the efforts in clinical big data analytics which currently entirely focus on descriptive and predictive analytics. This in turn is followed by a discussion of leveraging clinical big data for analytical advantages and highlighting the potential importance of prescriptive analytics with potential applications that might arise from these types of analyses. (See section on Clinical big data and upcoming challenges).

High Performance Computing (HPC) systems

Distributed system

A distributed system [3] is a setup in which several independent computers (computing nodes) participate in solving the problem of processing a large volume of and variety of structured/semi-structured/unstructured data.

Grid computing system

The grid computing system [7] is a way to utilize resources (e.g. CPUs, storage of computer systems across a worldwide network, etc.) to function as a flexible, pervasive, and inexpensive accessible pool of computing resources that can be used on demand by any task.

Graphical processing unit (GPU)

GPU computing [8] is well adapted to the throughput-oriented workload problems that are characteristic of large-scale data processing. Parallel data processing can be handled by GPU clusters [9]. However, implementing MapReduce on a cluster of GPUs has some limitations [10]. For example GPUs have difficulty communicating over a network. Moreover GPUs cannot handle virtualization of resources. Furthermore the system architecture of GPUs may not be suitable for the MapReduce architecture and may require a great deal of modification [9].

The basic differences between grid computing and distributed computing systems are:

  1. 1.

    A distributed computing system manages hundreds or thousands of computer systems, which are limited in processing resources (e.g. memory, CPU, storage, etc.). However the grid computing system is concerned about efficient usage of heterogeneous systems with optimal workload management servers, networks, storage, etc.

  2. 2.

    A grid computing system is dedicated to support computation across a variety of administrative domains, which makes it different from the traditional distributed computing system.

Distributed file systems

Most computing is done on a single processor, with its main memory, cache, and local disk (a computing node). In the past, applications that called for parallel processing, such as large scientific calculations, were done on special-purpose parallel computers with many processors and specialized hardware [2, 3]. However, the prevalence of large-scale Web services has resulted in more computing being done on installations with thousands of computing nodes operating more or less independently [3, 4]. In these installations, the computing nodes are commodity hardware, which greatly reduces the cost compared to special-purpose parallel machines [3]. These new computing facilities have given rise to a new generation of programming frameworks. These frameworks take advantage of the power of parallelism and at the same time avoid the reliability problems that arise when the computing hardware consists of thousands of independent components, any of which could fail at any time [2]. Figure 1 shows a Hadoop cluster with its distributed computing nodes and connecting Ethernet switch. The cluster runs jobs controlled by the master node, which is known as the NameNode and it is responsible for chunking the data, cloning it, sending the data to the distributed computing nodes (DataNodes), monitoring the cluster status, and collecting/aggregating the results. The cluster illustrated in Figure 1 is currently installed in the Department of Pathology and Laboratory Medicine, University of Calgary and Calgary Laboratory Services (CLS), Calgary, Alberta, Canada.

Figure 1
figure 1

The architecture of the Hadoop cluster. Hadoop cluster architecture, showing the distributed computing nodes, which are Master node (NameNode), Slave Nodes (DataNode), and the Ethernet switch.

Full size image

The MapReduce programming framework

On top of the DFS, many different higher-level programming frameworks have been developed. The most commonly implemented programming framework is the MapReduce framework [4, 11, 12]. MapReduce is an emerging programming framework for data-intensive applications proposed by Google. MapReduce borrows ideas from functional programming [12], where the programmer defines Map and Reduce tasks to process large sets of distributed data.

Implementations of MapReduce [11] enable many of the most common calculations on large-scale data to be performed on computing clusters efficiently and in a way that is tolerant of hardware failures during computation. However MapReduce is not suitable for online transactions [11, 12].

The key strengths of the MapReduce programming framework are the high degree of parallelism combined with the simplicity of the programming framework and its applicability to a large variety of application domains [4, 11]. This requires dividing the workload across a large number of machines. The degree of parallelism depends on the input data size. The map function processes the input pairs (key1, value1) returning some other intermediary pairs (key2, value2). Then the intermediary pairs are grouped together according to their key. The reduce function will output some new key-value pairs of the form (key3, value3). Figure 2 shows an example of a MapReduce algorithm used to count words in a file. In this example the map input key is the provided data chunk with a value of 1. The map output key is the word itself and the value is 1 every time the word exists in the processed data chunk. The reducers perform the aggregation of the key-values pair output from the maps and output a single value for every key, which in this case is a count for every word. Figure 2 provides further explanation of the generation of the key-value pairs produced during the processing phases of the WordCount MapReduce program.

Figure 2
figure 2

The WordCount problem MapReduce algorithm workflow. The algorithm counts the number of occurrences for every word in the file. The file is chunked and distributed over the computing nodes in the cluster. The mapper must be completed to start the reducer phase, otherwise an error will be reported and the execution will be stopped.

Full size image

High performance is achieved by breaking the processing into small units of work that can be run in parallel across potentially hundreds or thousands of nodes in the cluster. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system [3, 4].

MapReduce programs are usually written in Java; however they can also be coded in languages such as C++, Perl, Python, Ruby, R, etc. These programs may process data stored in different file and database systems.

The hadoop platform

Hadoop [13–15] is an open source software implementation of the MapReduce framework for running applications on large clusters built of commodity hardware from Apache [16]. Hadoop is a platform that provides both distributed storage and computational capabilities. Hadoop was first comprehended to fix a scalability issue that existed in Nutch [15, 17], an open source crawler and search engine that utilizes the MapReduce and big-table [17] methods developed by Google. Hadoop is a distributed master–slave architecture that consists of the Hadoop Distributed File System (HDFS) for storage and the MapReduce programming framework for computational capabilities. The HDFS stores data on the computing nodes providing a very high aggregate bandwidth across the cluster.

Traits inherent to Hadoop are data partitioning and parallel computation of large datasets. Its storage and computational capabilities scale with the addition of computing nodes to a Hadoop cluster, and can reach volume sizes in the petabytes on clusters with thousands of nodes.

Hadoop also provides Hive [18, 19] and Pig Latin [20], which are high-level languages that generate MapReduce programs. Several vendors offer open source and commercially supported Hadoop distributions; examples include Cloudera [21], DataStax [22], Hortonworks [23] and MapR [24]. Many of these vendors have added their own extensions and modifications to the Hadoop open source platform.

Hadoop differs from other distributed system schemes in its philosophy toward data. A traditional distributed system requires repeat transmissions of data between clients and servers [3]. This works fine for computationally intensive work, but for data-intensive processing, the size of data becomes too large to be moved around easily. Hadoop focuses on moving code to data instead of vice versa [13, 14]. The client (NameNode) sends only the MapReduce programs to be executed, and these programs are usually small (often in kilobytes). More importantly, the move-code-to-data philosophy applies within the Hadoop cluster itself. Data is broken up and distributed across the cluster, and as much as possible, computation on a chunk of data takes place on the same machine where that chunk of data resides.

Figure 3 shows the Hadoop ecosystems, the associated technology, and the current distribution existing in the market. Table 1 shows the basic features of 14 Hadoop distributions [25] and Table 2 shows the related Hadoop projects/ecosystems that are used on top of the Hadoop to provide my functionalities to the MapReduce framework.

Figure 3
figure 3

The Hadoop ecosystems. The Hadoop system core, components (ecosystems), associated technology, and different distributions by vendors. This Figure illustrates the current Hadoop ecosystem and a short list of the available distributions by vendors.

Full size image
Table 1 Basic features of 14 Hadoop distributions and related download links
Full size table
Table 2 Description of the Hadoop related projects/ecosystems
Full size table

Relevant literature cited in this paper related to “MapReduce, Hadoop, clinical data, and biomedical/bioinformatics applications of MapReduce” was obtained from PubMed, IEEEXplore, Springer, and BioMed Central databases. The MapReduce programming framework was first introduced to industry in 2006. And thus the literature search concentrated on 2007 to 2014. A total of 32 articles were found based on the use of the MapReduce framework to process the clinical big data and its application using the Hadoop platform.

Review

In this review we start by listing the different types of big clinical datasets, followed by the efforts that are developed to leverage the data for analytical advantages. These advantages are mainly focused on descriptive and predictive analytics. The major reason for using the MapReduce programming framework in the reviewed efforts is to speed up these kind of analytics. This is due the fact that these kinds of analytic algorithms are very well developed and tested for the MapReduce framework and the Hadoop platform can handle a huge amount of data [11] in a small amount of time. The prescriptive analytics require data sharing among computing nodes, which unfortunately cannot be achieved easily (i.e. sophisticated programs with a great deal of data management) using MapReduce, and thus, not all optimization problems (i.e. prescriptive analytics) can be implemented on the MapReduce framework.

The review section is followed by a challenges and future trends section that highlights the use of the MapReduce programming framework and its open source implementation Hadoop for processing clinical big data. This is followed by our perspective and use cases on how to leverage clinical big data for novel analytics.

Clinical big data analysis

The exponential production of data in recent years has introduced a new area in the field of information technology known as ‘Big Data’. In a clinical setting such datasets are emerging from large-scale laboratory information system (LIS) data, test utilization data, electronic medical record (EMR), biomedical data, biometrics data, gene expression data, and in other areas. Massive datasets are extremely difficult to analyse and query using traditional mechanisms, especially when the queries themselves are quite complicated. In effect, a MapReduce algorithm maps both the query and the dataset into constituent parts. The mapped components of the query can be processed simultaneously – or reduced – to rapidly return results.

Big datasets of clinical, biomedical, and biometric data have been processed successfully using the MapReduce framework on top of the Hadoop distributed file system. An overview of the Hadoop platform, MapReduce framework and its current applications [26, 27] has been reported for the field of bioinformatics. The promise of big data analytics in bioinformatics and health care in general has previously been described [5]. However our review enlarges the scope to the application of the MapReduce framework and its open source implementation Hadoop to a wide range of clinical big data including:

  1. 1.

    Publicly available clinical datasets: online published datasets and reports from the United States Food and Drug Administration (FDA) [28].

  2. 2.

    Biometrics datasets: containing measurable features related to human characteristics. Biometrics data is used as a form of identification and access control [29].

  3. 3.

    Bioinformatics datasets: biological data of a patient (e.g. protein structure, DNA sequence, etc.).

  4. 4.

    Biomedical signal datasets: data resulting from the recording of vital signs of a patient (e.g. electrocardiography (ECG), electroencephalography (EEG), etc.).

  5. 5.

    Biomedical image datasets: data resulting from the scanning of medical images (e.g. ultrasound imaging, magnetic resonance imaging (MRI), histology images, etc.).

Moreover, our review presents a detailed discussion about the various types of clinical big data, challenges and consequences relevant to the application of big data analytics in a health care facility. This review is concluded with the future potential applications of the MapReduce programming framework and the Hadoop platform applied to clinical big data.

Public databases

A MapReduce-based algorithm [30] has been proposed for common adverse drug event (ADE) detection and has been tested in mining spontaneous ADE reports from the United States FDA. The purpose of this algorithm was to investigate the possibility of using the MapReduce framework to speed up biomedical data mining tasks using this pharmacovigilance case as one specific example. The results demonstrated that the MapReduce programming framework could improve the performance of common signal detection algorithms for pharmacovigilance [30] in a distributed computation environment at approximately linear speedup rates. The MapReduce distributed architecture and high dimensionality compression via Markov boundary feature selection [31] have been used to identify unproven cancer treatments on the World Wide Web. This study showed that unproven treatments used distinct language to market their claims and this language was learnable, and through distributed parallelization and state of the art feature selection [32], it is possible to build and apply models with large scalability.

A novel system known as GroupFilterFormat [33] has been developed to handle the definition of field content based on a Pig Latin script [20]. Dummy discharge summary data for 2.3 million inpatients and medical activity log data for 950 million events were processed. The response time was significantly reduced and a linear relationship was observed between the quantity of data and processing time in both a small and a very large dataset. The results show that doubling the number of nodes resulted in a 47% decrease in processing time.

Biometrics

The MapReduce programming framework has also been used to classify biometric measurements [34] using the Hadoop platform for face matching, iris recognition, and fingerprint recognition. A biometrics prototype system [35] has been implemented for generalized searching of cloud-scale biometric data and matching a collection of synthetic human iris images. A biometric-capture mobile phone application has been developed for secure access to the cloud [36]. The biometric capture and recognition are performed during a standard Web session. The Hadoop platform is used to establish the connection between a mobile user and the server in the cloud.

Bioinformatics: genome and protein big data analysis

The large datasets stemming from genomic data are particularly amenable to analysis by distributed systems. A novel and efficient tag for single-nucleotide polymorphism (SNP) selection algorithms has been proposed using the MapReduce framework [37]. A genome sequence comparison algorithm [38] has been implemented on top of Hadoop while relying on HBase [39] for data management and MapReduce jobs for computation. The system performance has been tested with real-life genetic sequences on the level of single genes as well as artificially generated test sequences [38]. While the initial test runs clearly illustrated the feasibility of the approach, more work is needed to improve the applicability of the solution. Moreover additional tuning of the local Hadoop configuration towards the genome comparison is expected to yield additional performance benefits. A bioinformatics processing tool known as BioPig has been built on the Apache’s Hadoop system and the Pig Latin data flow language [40]. Compared with traditional algorithms, BioPig has three major advantages: first, BioPig programmability reduces development time for parallel bioinformatics applications; second, testing BioPig with up to 500 GB sequences demonstrates that it scales automatically with the size of data; and finally, BioPig can be ported without modification on many Hadoop infrastructures, as tested with the Magellan system at the National Energy Research Scientific Computing Center (NERSC [41]) and the Amazon Elastic Compute Cloud [42]. Chang et al. [43] have developed a distributed genome assembler based on string graphs and the MapReduce framework, known as the CloudBrush. The assembler includes a novel edge-adjustment algorithm to detect structural defects by examining the neighbouring areas of a specific read for sequencing errors and adjusting the edges of the string graph. McKenna et al. [44] presented a sequence database search engine that was specifically designed to run efficiently on the Hadoop distributed computing platform. The search engine implemented the K-score algorithm [45], generating comparable output for the same input files as the original implementation for mass spectrometry based proteomics. A parallel protein structure alignment algorithm has also been proposed based on the Hadoop distributed platform [46]. The authors analysed and compared the structure alignments produced by different methods using a dataset randomly selected from the Protein Data Bank (PDB) database [19]. The experimental results verified that the proposed algorithm refined the resulting alignments more accurately than existing algorithms. Meanwhile, the computational performance of the proposed algorithm was proportional to the number of processors used in the cloud platform. The implementation of genome-wide association study (GWAS) statistical tests in the R programming language has been presented in the form of the BlueSNP R package [47], which executes calculations across clusters configured with Hadoop. An efficient algorithm for DNA fragment assembly in the MapReduce framework has been proposed [48]. The experimental results show that the parallel strategy can effectively improve the computational efficiency and remove the memory limitations of the assembly algorithm based on the Euler super path [49]. Next generation genome software mapping has been developed for SNP discovery and genotyping [50]. The software is known as Cloudburst and it is implemented on top of the Hadoop platform for the analysis of next generation sequencing data. Performance comparison studies have been conducted between a message passing interface (MPI) [51], Dryad [52], and a Hadoop MapReduce programming framework for measuring relative performance using three bioinformatics applications [53]. BLAST and gene set enrichment analysis (GSEA) algorithms have been implemented in Hadoop [54] for streaming computation on large data sets and a multi-pass computation on relatively small datasets. The results indicate that the framework could have a wide range of bioinformatics applications while maintaining good computational efficiency, scalability, and ease of maintenance. CloudBLAST [55], a parallelized version of the NCBI BLAST2 algorithm [56] is implemented using Hadoop. The results were compared against the available version of mpiBLAST [57], which is an earlier parallel version of BLAST. CloudBLAST showed better performance and was considered simpler than mpiBLAST. The Hadoop platform has been used for multiple sequence alignment [58] using HBase.

The reciprocal smallest distance (RSD) algorithm for gene sequence comparison has been redesigned to run with EC2 cloud [42]. The redesigned algorithm used ortholog calculations across a wide selection of fully sequenced genomes. They ran over 300,000 RSD process using the MapReduce framework on the EC2 cloud running on 100 high capacity computing nodes. According to their results, MapReduce provides a substantial boost to the process.

Cloudgene [59] is a freely available platform to improve the usability of MapReduce programs in bioinformatics. Cloudgene is used to build a standardized graphical execution environment for currently available and future MapReduce programs, which can be integrated by using its plug-in interface. The results show that MapReduce programs can be integrated into Cloudgene with little effort and without adding any computational overhead to existing programs. Currently, five different bioinformatics programs using MapReduce and two systems are integrated and have been successfully deployed [59].

Hydra is a genome sequence database search engine that is designed to run on top of the Hadoop and MapReduce distributed computing framework [60]. It implements the K-score algorithm [45] and generates comparable output for the same input files as the original implementation. The results show that the software is scalable in its ability to handle a large peptide database.

A parallel version of the random forest algorithm [61] for regression and genetic similarity learning tasks has been developed [62] for large-scale population genetic association studies involving multivariate traits. It is implemented using MapReduce programming framework on top of Hadoop. The algorithm has been applied to a genome-wide association study on Alzheimer disease (AD) in which the quantitative characteristic consists of a high-dimensional neuroimaging phenotype describing longitudinal changes in human brain structure and notable speed-ups in the processing are obtained.

A solution to sequence comparison that can be thoroughly decomposed into multiple rounds of map and reduce operations has been proposed [63]. The procedure described is an effort in decomposition and parallelization of sequence alignment in prediction of a volume of genomic sequence data, which cannot be processed using sequential programming methods.

Nephele is a suite of tools [64] that uses the complete composition vector algorithm [65] to represent each genome sequence in the dataset as a vector derived from its constituent. The method is implemented using the MapReduce framework on top of the Hadoop platform. The method produces results that correlate well with expert-defined clades at a fraction of the computational cost of traditional methods [64]. Nephele was able to generate a neighbor-joined tree of over 10,000 16S samples in less than 2 hours.

A practical framework [66] based on MapReduce programming framework is developed to infer large gene networks, by developing and parallelizing a hybrid genetic algorithm particle swarm optimization (GA-PSO) method [67]. The authors use the open-source software GeneNetWeaver to create the gene profiles. The results show that the parallel method based on the MapReduce framework can be successfully used to gather networks with desired behaviors and the computation time can be reduced.

A method for enhancement of accuracy and efficiency for RNA secondary structure prediction by sequence segmentation and MapReduce has been implemented [68]. The results show that by using statistical analysis implemented using the MapReduce framework, the inversion-based chunking methods can outperform predictions using the whole sequence.

Rainbow [69] is a cloud-based software package that can assist in the automation of large-scale whole-genome sequencing (WGS) data analyses to overcome the limitations of Crossbow [70], which is a software tool that can detect SNPs WGS data from a single subject. The performance of Rainbow was evaluated by analyzing 44 different whole-genome-sequenced subjects. Rainbow has the capacity to process genomic data from more than 500 subjects in two weeks using cloud computing provided by the Amazon Web Service.

Mercury [71] is an automated, flexible, and extensible analysis workflow that provides accurate and reproducible genomic results at scales ranging from individuals to large partners. Moreover, Mercury can be deployed on local clusters and the Amazon Web Services cloud via the DNAnexus platform.

Biomedical signal analysis

The parallel ensemble empirical mode decomposition (EEMD) algorithm [72] has been implemented on top of the Hadoop platform in a modern cyber infrastructure [73]. The algorithm described a parallel neural signal processing with EEMD using the MapReduce framework. Test results and performance evaluation show that parallel EEMD can significantly improve the performance of neural signal processing. A novel approach has been proposed [39] to store and process clinical signals based on the Apache HBase distributed column-store and the MapReduce programming framework with an integrated Web-based data visualization layer.

Biomedical image analysis

The growth in the volume of medical images produced on a daily basis in modern hospitals has forced a move away from traditional medical image analysis and indexing approaches towards scalable solutions [74]. MapReduce has been used to speed up and make possible three large–scale medical image processing use–cases: (1) parameter optimization for lung texture classification using support vector machines (SVM), (2) content–based medical image indexing/retrieval, and (3) dimensional directional wavelet analysis for solid texture classification [75]. A cluster of heterogeneous computing nodes was set up using the Hadoop platform allowing for a maximum of 42 concurrent map tasks. The majority of the machines used were desktop computers that are also used for regular office work. The three use–cases reflect the various challenges of processing medical images in different clinical scenarios.

An ultrafast and scalable cone-beam computed tomography (CT) reconstruction algorithm using MapReduce in a cloud-computing environment has been proposed [76]. The algorithm accelerates the Feldcamp-Davis-Kress (FDK) algorithm [77] by porting it to a MapReduce implementation. The map functions were used to filter and back-project subsets of projections, and reduce functions to aggregate that partial back-projection into the whole volume. The speed up of reconstruction time was found to be roughly linear with the number of nodes employed.

Table 3 includes a summary of the discussed literature on clinical big data analysis using the MapReduce programming framework. It tabulates the studies referenced in this paper grouped by relevant categories to indicate the following fields: study name, year, and technology used, and potential application of the algorithm or the technology used.

Table 3 Summary of reviewed research in clinical big data analysis using the MapReduce programming model
Full size table

Challenges and future trends

Challenges and consequences

Health care systems in general suffer unsustainable costs and lack data utilization [78]. Therefore there is a pressing need to find solutions that can reduce unnecessary costs. Advances in health quality outcomes and cost control measures depend on using the power of large integrated databases to underline patterns and insights. However, there is much less certainty on how this clinical data should be collected, maintained, disclosed, and used. The problem in health care systems is not the lack of data, it is the lack of information that can be utilized to support critical decision-making [79]. This presents the following challenges to big data solutions in clinical facilities:

1- Technology straggling. Health care is resistant to redesigning processes and approving technology that influences the health care system [80].

2- Data dispersion. Clinical data is generated from many sources (e.g. providers, labs, data vendors, financial, regulations, etc.) this motivates the need for data integration and maintaining mechanism to hold the data into a flexible data warehouse.

3- Security concerns and privacy issues. There are lots of benefits from sharing clinical big data between researchers and scholars, however these benefits are constricted due to the privacy issues and laws that regulate clinical data privacy and access [81].

4- Standards and regulations. Big data solution architectures have to be flexible and adoptable to manage the variety of dispersed sources and the growth of standards and regulations (e.g. new encryption standards that may require system architecture modifications) that are used to interchange and maintain data [82].

An outlook for the future

Big Data has a substantial potential to unlock the whole health care value chain [83]. Big data analytics changed the traditional perspective of health care systems from finding new drugs to patient-central health care for better clinical outcomes and increased efficiency. The future applications of big data in the health care system have the potential of enhancing and accelerating interactions among clinicians, administrators, lab directors, logistic mangers, and researchers by saving costs, creating better efficiencies based on outcome comparison, reducing risks, and improving personalized care.

The following is a list is of potential future applications associated with clinical big data.

1- E-clinics, E-medicine, and similar case retrieval applications based on text analytics applications.

Large amounts of health data is unstructured as documents, images, clinical or transcribed notes [84]. Research articles, review articles, clinical references, and practice guidelines are rich sources for text analytics applications that aim to discover knowledge by mining these type of text data.

2- Genotyping applications.

Genomic data represent significant amounts of gene sequencing data and applications are required to analysis and understand the sequence in regards to better understanding of patient treatment.

3- Mining and analysis of biosensors applications.

Streamed data home monitoring, tele-health, handheld and sensor-based wireless are well established data sources for clinical data.

4- Social media analytics applications.

Social media will increase the communication between patients, physician and communities. Consequently, analytics are required to analyse this data to underline emerging outbreak of disease, patient satisfaction, and compliance of patient to clinical regulations and treatments.

5- Business and organizational modelling applications.

Administrative data such as billing, scheduling, and other non-health data present an exponentially growing source of data. Analysing and optimizing this kind of data can save large amounts of money and increase the sustainability of a health care facility [78, 79, 83].

The aforementioned types of clinical data sources provide a rich environment for research and give rise to many future applications that can be analysed for better patient treatment outcomes and a more sustainable health care system.

Clinical big data and the upcoming challenges

Big data by itself usually confers little direct advantage, however analytics based on big data can reveal many actionable insights that may prove useful in a clinical environment. This section describe the potential benefits and highlight potential application to leverage the clinical big data for analytical advantages using the MapReduce programming framework and the Hadoop platform.

Epilepsy affects nearly 70 Million people around the world [85], and is categorized by the incident of extemporaneous seizures. Many medications can be given at high doses to inhibit seizures [85, 86], however patients often suffer side effects. Even after surgical removal of epilepsy foci, many patients suffer extemporaneous seizures [86]. Seizure prediction systems have the potential to help patients alleviate epilepsy episodes [85, 86]. Computational algorithms must consistently predict periods of increased probability of seizure incidence. If the seizure states can be predicted and classified using data mining algorithms, implementation of these algorithms on wearable devices can warn patients of impending seizures. Patients could avoid potentially unsuitable activities in potential seizures episode (e.g. driving and swimming). Seizure patterns are wide and complex resulting in a massive datasets when digitally acquired. MapReduce and Hadoop can be consciously used to train detection and forecasting models. Simulation of different concurrently seizures pattern require the development of complex distributed algorithms to deal with the massive datasets.

Understanding how the human brain functions is the main goal in neuroscience research [87, 88]. Non-invasive functional neuroimaging techniques, such as magneto encephalography (MEG) [89], can capture huge time series of brain data activities. Analysis of concurrent brain activities can reveal the relation between the pattern of recorded signal and the category of the stimulus and may provide insights about the brain functional foci (e.g. epilepsy, Alzheimer’s disease [90], and other neuro-pathologies, etc.). Among the approaches to analyse the relation between brain activity and stimuli, the one based on predicting the stimulus from the concurrent brain recording is called brain decoding.

The brain contains nearly 100 billion neurons with an average of 7000 synaptic connections each [87, 88, 91]. Tracing the neuron connections of the brain is therefore a tedious process due to the resulting massive datasets. Traditional neurons visualization methods cannot scale up to very large scale neuron networks. MapReduce framework and Hadoop platform can be used to visualize and recover neural network structures from neural activity patterns.

More than 44.7 million individuals in the United States are admitted to hospitals each year [92]. Studies have concluded that in 2006 well over $30 billion was spent on unnecessary hospital admissions [93]. To achieve the goal of developing novel algorithms that utilize patient data claim to predict and prevent unnecessary hospitalizations. Claims data analytics require text analytics, prediction and estimation models. The models must be tuned to alleviate the potential risk of decline the admission of patients who need to be hospitalized. This type of analysis is one application of fraud analysis in medicine.

Conclusions

An integrated solution eliminates the need to move data into and out of the storage system while parallelizing the computation, a problem that is becoming more important due to increasing numbers of sensors and resulting data. And, thus, efficient processing of clinical data is a vital step towards multivariate analysis of the data in order to develop a better understanding of a patient clinical status (i.e. descriptive and predictive analysis). This highly demonstrates the significance of using the MapReduce programming model on top of the Hadoop distributed processing platform to process the large volume of clinical data.

Big data solutions [20–24, 42] presents an evolution of clinical big data analysis necessitated by the emergence of ultra-large-scale datasets. Recent developments in open source software, that is, the Hadoop project and the associated software projects, provide a backbone foundation for scaling to terabytes and petabytes data warehouses on Linux clusters, providing fault-tolerant parallelized analysis on such data using a programming framework named MapReduce.

The Hadoop platform and the MapReduce programming framework already have a substantial base in the bioinformatics community, especially in the field of next-generation sequencing analysis, and such use is increasing. This is due to the cost-effectiveness of the Hadoop-based analysis on commodity Linux clusters, and in the cloud via data upload to cloud vendors who have implemented Hadoop/HBase; and due to the effectiveness and ease-of-use of the MapReduce method in parallelization of many data analysis algorithms.

HDFS supports multiple reads and one write of the data. The write process can therefore only append data (i.e. it cannot modify existing data within the file). HDFS does not provide an index mechanism, which means that it is best suited to read-only applications that need to scan and read the complete contents of a file (i.e. MapReduce programs). The actual location of the data within an HDFS file is transparent to applications and external software. And, thus, Software built on top of HDFS has little control over data placement or knowledge of data location, which can make it difficult to optimize performance.

Future work on big clinical data analytics should emphasize modelling of whole interacting processes in a clinical setting (e.g. clinical test utilization pattern, test procedures, specimen collection/handling, etc.). This indeed can be constructed using inexpensive clusters of commodity hardware and the appropriate open source tool (e.g. HBase, Hive, and Pig Latin see Table 2 for Hadoop related projects/ecosystems description and definition) to construct convenient processing tools for massive clinical data. These tools will form the basis of future laboratory informatics applications as laboratory data are increasingly integrated and consolidated.

References

  1. Shuman S: Structure, mechanism, and evolution of the mRNA capping apparatus. Prog Nucleic Acid Res Mol Biol. 2000, 66: 1-40.

    Article  CAS  Google Scholar 

  2. Rajaraman A, Ullman JD: Mining of Massive Datasets. 2012, Cambridge – United Kingdom: Cambridge University Press

    Google Scholar 

  3. Coulouris GF, Dollimore J, Kindberg T: Distributed Systems: Concepts and Design: Pearson Education. 2005

    Google Scholar 

  4. de Oliveira Branco M: Distributed Data Management for Large Scale Applications. 2009, Southampton – United Kingdom: University of Southampton

    Google Scholar 

  5. Raghupathi W, Raghupathi V: Big data analytics in healthcare: promise and potential. Health Inform Sci Syst. 2014, 2 (1): 3-10.1186/2047-2501-2-3.

    Article  Google Scholar 

  6. Bell DE, Raiffa H, Tversky A: Descriptive, normative, and prescriptive interactions in decision making. Decis Mak. 1988, 1: 9-32.

    Article  Google Scholar 

  7. Foster I, Kesselman C: The Grid 2: Blueprint for a new Computing Infrastructure. 2003, Houston – USA: Elsevier

    Google Scholar 

  8. Owens JD, Houston M, Luebke D, Green S, Stone JE, Phillips JC: GPU computing. Proc IEEE. 2008, 96 (5): 879-899.

    Article  Google Scholar 

  9. Satish N, Harris M, Garland M: Designing efficient sorting algorithms for manycore GPUs. In Parallel & DistributedProcessing, 2009 IPDPS 2009 IEEE International Symposium on: 2009,IEEE; 2009:1–10.

    Chapter  Google Scholar 

  10. He B, Fang W, Luo Q, Govindaraju NK, Wang T: Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques: 2008. 2008, 260-269. Mars: a MapReduce framework on graphics processors, ACM;

    Chapter  Google Scholar 

  11. Dean J, Ghemawat S: MapReduce: simplified data processing on large clusters. Commun ACM. 2008, 51 (1): 107-113. 10.1145/1327452.1327492.

    Article  Google Scholar 

  12. Peyton Jones SL: The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science). 1987, New Jersey – USA: Prentice-Hall, Inc

    Google Scholar 

  13. Bryant RE: Data-intensive supercomputing: The case for DISC. 2007, Pittsburgh, PA – USA: School of Computer Science, Carnegie Mellon University, 1-20.

    Google Scholar 

  14. White T: Hadoop: The Definitive Guide. 2012, Sebastopol – USA: “ O’Reilly Media, Inc.”

    Google Scholar 

  15. Shvachko K, Kuang H, Radia S, Chansler R: Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on: 2010. 2010, 1-10. The hadoop distributed file system, IEEE,

    Chapter  Google Scholar 

  16. The Apache Software Foundation. [http://apache.org/]

  17. Olson M: Hadoop: Scalable, flexible data storage and analysis. IQT Quart. 2010, 1 (3): 14-18.

    Google Scholar 

  18. Xiaojing J: Google Cloud Computing Platform Technology Architecture and the Impact of Its Cost. 2010 Second WRI World Congress on Software Engineering: 2010. 2010, 17-20.

    Chapter  Google Scholar 

  19. Thusoo A, Sarma JS, Jain N, Shao Z, Chakka P, Anthony S, Liu H, Wyckoff P, Murthy R: Hive: a warehousing solution over a map-reduce framework. Proc VLDB Endowment. 2009, 2 (2): 1626-1629. 10.14778/1687553.1687609.

    Article  Google Scholar 

  20. Olston C, Reed B, Srivastava U, Kumar R, Tomkins A: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data: 2008. 2008, 1099-1110. Pig latin: a not-so-foreign language for data processing, ACM,

    Chapter  Google Scholar 

  21. The Platform for Big Data and the Leading Solution for Apache Hadoop in the Enterprise - Cloudera. [http://www.cloudera.com/content/cloudera/en/home.html]

  22. DataStax. [http://www.datastax.com/]

  23. Hortonworks. [http://hortonworks.com/]

  24. MAPR. [http://www.mapr.com/products/m3]

  25. Top 14 Hadoop Technology Companies. [http://www.technavio.com/blog/top-14-hadoop-technology-companies]

  26. Taylor RC: An overview of the Hadoop/MapReduce/HBase framework and its current applications in bioinformatics. BMC Bioinformatics. 2010, 11 (Suppl 12): S1-10.1186/1471-2105-11-S12-S1.

    Article  PubMed  PubMed Central  Google Scholar 

  27. Dai L, Gao X, Guo Y, Xiao J, Zhang Z: Bioinformatics clouds for big data manipulation. Biol Direct. 2012, 7 (1): 43-10.1186/1745-6150-7-43.

    Article  PubMed  PubMed Central  Google Scholar 

  28. Microsoft Excel 2013: Spreadsheet software. [http://office.microsoft.com/en-ca/excel/]

  29. Jonas M, Solangasenathirajan S, Hett D: Patient Identification, A Review of the Use of Biometrics in the ICU. Annual Update in Intensive Care and Emergency Medicine 2014. 2014, New York – USA: Springer, 679-688.

    Google Scholar 

  30. Wang W, Haerian K, Salmasian H, Harpaz R, Chase H, Friedman C: A drug-adverse event extraction algorithm to support pharmacovigilance knowledge mining from PubMed citations. AMIA Annual Symposium Proceedings: 2011. 2011, Bethesda, Maryland – USA: American Medical Informatics Association, 1464-

    Google Scholar 

  31. Aphinyanaphongs Y, Fu LD, Aliferis CF: Identifying unproven cancer treatments on the health web: addressing accuracy, generalizability and scalability. Stud Health Technol Inform. 2012, 192: 667-671.

    Google Scholar 

  32. Yaramakala S, Margaritis D: Data Mining, Fifth IEEE International Conference on: 2005. 2005, 4- Speculative Markov blanket discovery for optimal feature selectio, IEEE,

    Google Scholar 

  33. Horiguchi H, Yasunaga H, Hashimoto H, Ohe K: A user-friendly tool to transform large scale administrative data into wide table format using a mapreduce program with a pig latin based script. BMC Med Inform Decis Mak. 2012, 12 (1): 151-10.1186/1472-6947-12-151.

    Article  PubMed  PubMed Central  Google Scholar 

  34. Kohlwey E, Sussman A, Trost J, Maurer A: Services (SERVICES), 2011 IEEE World Congress on: 2011. 2011, 597-601. Leveraging the cloud for big data biometrics: Meeting the performance requirements of the next generation biometric systems,IEEE,

    Chapter  Google Scholar 

  35. Raghava N: Cloud Computing and Intelligence Systems (CCIS), 2011 IEEE International Conference on: 2011. 2011, 482-485. Iris recognition on hadoop: A biometrics system implementation on cloud computing,IEEE,

    Google Scholar 

  36. Omri F, Hamila R, Foufou S, Jarraya M: Cloud-Ready Biometric System for Mobile Security Access. Networked Digital Technologies. 2012, New York – USA: Springer, 192-200.

    Chapter  Google Scholar 

  37. Chen W-P, Hung C-L, Tsai S-JJ, Lin Y-L: Novel and efficient tag SNPs selection algorithms. Biomed Mater Eng. 2014, 24 (1): 1383-1389.

    PubMed  Google Scholar 

  38. Zhang K, Sun F, Waterman MS, Chen T: Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology: 2003. 2003, 332-340. Dynamic programming algorithms for haplotype block partitioning: applications to human chromosome 21 haplotype data,ACM,

    Google Scholar 

  39. Nguyen AV, Wynden R, Sun Y: HBase, MapReduce, and Integrated Data Visualization for Processing Clinical Signal Data. AAAI Spring Symposium: Computational Physiology: 2011. 2011

    Google Scholar 

  40. Nordberg H, Bhatia K, Wang K, Wang Z: BioPig: a Hadoop-based analytic toolkit for large-scale sequence data. Bioinformatics. 2013, 29 (23): 3014-3019. 10.1093/bioinformatics/btt528.

    Article  CAS  PubMed  Google Scholar 

  41. Cloud Computing at NERSC. [http://www.nersc.gov/research-and-development/cloud-computing/]

  42. AWS | Amazon Elastic Compute Cloud (EC2) - Scalable Cloud Hosting. [http://aws.amazon.com/ec2/]

  43. Chang Y-J, Chen C-C, Ho J-M, Chen C-L: Cloud Computing (CLOUD), 2012 IEEE 5th International Conference on: 2012. 2012, 155-161. De Novo Assembly of High-Throughput Sequencing Data with Cloud Computing and New Operations on String Graphs,IEEE,

    Chapter  Google Scholar 

  44. McKenna A, Hanna M, Banks E, Sivachenko A, Cibulskis K, Kernytsky A, Garimella K, Altshuler D, Gabriel S, Daly M: The Genome Analysis Toolkit: a MapReduce framework for analyzing next-generation DNA sequencing data. Genome Res. 2010, 20 (9): 1297-1303. 10.1101/gr.107524.110.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  45. MacLean B, Eng JK, Beavis RC, McIntosh M: General framework for developing and evaluating database scoring algorithms using the TANDEM search engine. Bioinformatics. 2006, 22 (22): 2830-2832. 10.1093/bioinformatics/btl379.

    Article  CAS  PubMed  Google Scholar 

  46. Lin Y-L: Implementation of a parallel protein structure alignment service on cloud. Int J Genomics. 2013, 2013: 1-8.

    Article  Google Scholar 

  47. Huang H, Tata S, Prill RJ: BlueSNP: R package for highly scalable genome-wide association studies using Hadoop clusters. Bioinformatics. 2013, 29 (1): 135-136. 10.1093/bioinformatics/bts647.

    Article  CAS  PubMed  Google Scholar 

  48. Xu B, Gao J, Li C: An efficient algorithm for DNA fragment assembly in MapReduce. Biochem Biophys Res Commun. 2012, 426 (3): 395-398. 10.1016/j.bbrc.2012.08.101.

    Article  CAS  PubMed  Google Scholar 

  49. Bean DR: Recursive Euler and Hamilton paths. Proc Am Math Soc. 1976, 55 (2): 385-394. 10.1090/S0002-9939-1976-0416888-0.

    Article  Google Scholar 

  50. Schatz MC: CloudBurst: highly sensitive read mapping with MapReduce. Bioinformatics. 2009, 25 (11): 1363-1369. 10.1093/bioinformatics/btp236.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  51. Gropp W, Lusk E, Skjellum A: Using MPI: Portable Parallel Programming With the Message-Passing Interface. 1999, Cambridge, Massachusetts – USA: MIT press, 1:

    Google Scholar 

  52. Isard M, Budiu M, Yu Y, Birrell A, Fetterly D: Dryad: distributed data-parallel programs from sequential building blocks. ACM SIGOPS Oper Syst Rev. 2007, 41 (3): 59-72. 10.1145/1272998.1273005.

    Article  Google Scholar 

  53. Qiu X, Ekanayake J, Beason S, Gunarathne T, Fox G, Barga R, Gannon D: Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers: 2009. 2009, 6-Cloud technologies for bioinformatics applications,ACM,

    Google Scholar 

  54. Gaggero M, Leo S, Manca S, Santoni F, Schiaratura O, Zanetti G, CRS E, Ricerche S: Parallelizing bioinformatics applications with MapReduce. Cloud Computing and Its Applications. 2008

    Google Scholar 

  55. Matsunaga A, Tsugawa M, Fortes J: eScience, 2008 eScience’08 IEEE Fourth International Conference on: 2008. 2008, 222-229. Cloudblast: Combining mapreduce and virtualization on distributed resources for bioinformatics applications,IEEE,

    Chapter  Google Scholar 

  56. Tatusova TA, Madden TL: BLAST 2 Sequences, a new tool for comparing protein and nucleotide sequences. FEMS Microbiol Lett. 1999, 174 (2): 247-250. 10.1111/j.1574-6968.1999.tb13575.x.

    Article  CAS  PubMed  Google Scholar 

  57. Darling A, Carey L, Feng W-c: The design, implementation, and evaluation of mpiBLAST. Proc Cluster World. 2003, 2003: 1-14.

    Google Scholar 

  58. Sadasivam GS, Baktavatchalam G: Proceedings of the 2010 Workshop on Massive Data Analytics on the Cloud: 2010. 2010, 2-A novel approach to multiple sequence alignment using hadoop data grids,ACM,

    Google Scholar 

  59. Schönherr S, Forer L, Weißensteiner H, Kronenberg F, Specht G, Kloss-Brandstätter A: Cloudgene: A graphical execution platform for MapReduce programs on private and public clouds. BMC Bioinformatics. 2012, 13 (1): 200-10.1186/1471-2105-13-200.

    Article  PubMed  PubMed Central  Google Scholar 

  60. Lewis S, Csordas A, Killcoyne S, Hermjakob H, Hoopmann MR, Moritz RL, Deutsch EW, Boyle J: Hydra: a scalable proteomic search engine which utilizes the Hadoop distributed computing framework. BMC Bioinformatics. 2012, 13 (1): 324-10.1186/1471-2105-13-324.

    Article  PubMed  PubMed Central  Google Scholar 

  61. Díaz-Uriarte R, De Andres SA: Gene selection and classification of microarray data using random forest. BMC Bioinformatics. 2006, 7 (1): 3-10.1186/1471-2105-7-3.

    Article  PubMed  PubMed Central  Google Scholar 

  62. Wang Y, Goh W, Wong L, Montana G: Random forests on Hadoop for genome-wide association studies of multivariate neuroimaging phenotypes. BMC Bioinformatics. 2013, 14 (16): 1-15.

    Article  Google Scholar 

  63. Almeida JS, Grüneberg A, Maass W, Vinga S: Fractal MapReduce decomposition of sequence alignment. Algorithms Mol Biol. 2012, 7 (1): 12-10.1186/1748-7188-7-12.

    Article  PubMed  PubMed Central  Google Scholar 

  64. Colosimo ME, Peterson MW, Mardis SA, Hirschman L: Nephele: genotyping via complete composition vectors and MapReduce. Source Code Biol Med. 2011, 6: 13-10.1186/1751-0473-6-13.

    Article  PubMed  PubMed Central  Google Scholar 

  65. Gao L, Qi J: Whole genome molecular phylogeny of large dsDNA viruses using composition vector method. BMC Evol Biol. 2007, 7 (1): 41-10.1186/1471-2148-7-41.

    Article  PubMed  PubMed Central  Google Scholar 

  66. Lee W-P, Hsiao Y-T, Hwang W-C: Designing a parallel evolutionary algorithm for inferring gene networks on the cloud computing environment. BMC Syst Biol. 2014, 8 (1): 5-10.1186/1752-0509-8-5.

    Article  PubMed  PubMed Central  Google Scholar 

  67. Juang C-F: A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. Syst Man Cybern B Cybern IEEE Trans on. 2004, 34 (2): 997-1006. 10.1109/TSMCB.2003.818557.

    Article  Google Scholar 

  68. Zhang B, Yehdego DT, Johnson KL, Leung M-Y, Taufer M: Enhancement of accuracy and efficiency for RNA secondary structure prediction by sequence segmentation and MapReduce. BMC Struct Biol. 2013, 13 (Suppl 1): S3-10.1186/1472-6807-13-S1-S3.

    Article  PubMed  PubMed Central  Google Scholar 

  69. Zhao S, Prenger K, Smith L, Messina T, Fan H, Jaeger E, Stephens S: Rainbow: a tool for large-scale whole-genome sequencing data analysis using cloud computing. BMC Genomics. 2013, 14 (1): 425-10.1186/1471-2164-14-425.

    Article  PubMed  PubMed Central  Google Scholar 

  70. Gurtowski J, Schatz MC, Langmead B: Genotyping in the cloud with crossbow. Curr Protoc Bioinformatics. 2012, 15.13: 11-15.

    Google Scholar 

  71. Reid JG, Carroll A, Veeraraghavan N, Dahdouli M, Sundquist A, English A, Bainbridge M, White S, Salerno W, Buhay C: Launching genomics into the cloud: deployment of Mercury, a next generation sequence analysis pipeline. BMC Bioinformatics. 2014, 15 (1): 30-10.1186/1471-2105-15-30.

    Article  PubMed  PubMed Central  Google Scholar 

  72. Wu Z, Huang NE: Ensemble empirical mode decomposition: a noise-assisted data analysis method. Adv Adapt Data Anal. 2009, 1 (01): 1-41. 10.1142/S1793536909000047.

    Article  Google Scholar 

  73. Wang L, Chen D, Ranjan R, Khan SU, KolOdziej J, Wang J: Parallel Processing of Massive EEG Data with MapReduce. ICPADS: 2012. 2012, 164-171.

    Google Scholar 

  74. Wang F, Lee R, Liu Q, Aji A, Zhang X, Saltz J: Hadoop-gis: A high performance query system for analytical medical imaging with mapreduce. 2011, Atlanta – USA: Technical report, Emory University, 1-13.

    Google Scholar 

  75. Markonis D, Schaer R, Eggel I, Müller H, Depeursinge A: Using MapReduce for Large-Scale Medical Image Analysis. HISB: 2012. 2012, 1-

    Google Scholar 

  76. Meng B, Pratx G, Xing L: Ultrafast and scalable cone-beam CT reconstruction using MapReduce in a cloud computing environment. Med Phys. 2011, 38 (12): 6603-6609. 10.1118/1.3660200.

    Article  PubMed  PubMed Central  Google Scholar 

  77. Feldkamp L, Davis L, Kress J: Practical cone-beam algorithm. JOSA A. 1984, 1 (6): 612-619. 10.1364/JOSAA.1.000612.

    Article  Google Scholar 

  78. Kaplan RS, Porter ME: How to solve the cost crisis in health care. Harv Bus Rev. 2011, 89 (9): 46-52.

    PubMed  Google Scholar 

  79. Musen MA, Middleton B, Greenes RA: Clinical decision-support systems. Biomedical Informatics. 2014, New York – USA: Springer, 643-674.

    Chapter  Google Scholar 

  80. Devaraj S, Ow TT, Kohli R: Examining the impact of information technology and patient flow on healthcare performance: A Theory of Swift and Even Flow (TSEF) perspective. J Oper Manage. 2013, 31 (4): 181-192. 10.1016/j.jom.2013.03.001.

    Article  Google Scholar 

  81. Friedman AB: Preparing for responsible sharing of clinical trial data. N Engl J Med. 2014, 370 (5): 484-484.

    Article  CAS  PubMed  Google Scholar 

  82. Mazurek M: Applying NoSQL Databases for Operationalizing Clinical Data Mining Models. Beyond Databases, Architectures, and Structures. 2014, New York – USA: Springer, 527-536.

    Chapter  Google Scholar 

  83. Chawla NV, Davis DA: Bringing big data to personalized healthcare: A patient-centered framework. J Gen Intern Med. 2013, 28 (3): 660-665.

    Article  PubMed Central  Google Scholar 

  84. Cusack CM, Hripcsak G, Bloomrosen M, Rosenbloom ST, Weaver CA, Wright A, Vawdrey DK, Walker J, Mamykina L: The future state of clinical data capture and documentation: a report from AMIA’s 2011 Policy Meeting. J Am Med Inform Assoc. 2013, 20 (1): 134-140. 10.1136/amiajnl-2012-001093.

    Article  PubMed  Google Scholar 

  85. Brodie MJ, Schachter SC, Kwan PKL: Fast Facts: Epilepsy. 2012, Albuquerque, New Mexico – USA: Health Press

    Google Scholar 

  86. Fabene PF, Bramanti P, Constantin G: The emerging role for chemokines in epilepsy. J Neuroimmunol. 2010, 224 (1): 22-27.

    Article  CAS  PubMed  Google Scholar 

  87. Shepherd GM, Mirsky JS, Healy MD, Singer MS, Skoufos E, Hines MS, Nadkarni PM, Miller PL: The Human Brain Project: neuroinformatics tools for integrating, searching and modeling multidisciplinary neuroscience data. Trends Neurosci. 1998, 21 (11): 460-468. 10.1016/S0166-2236(98)01300-9.

    Article  CAS  PubMed  Google Scholar 

  88. Purves D: Body and Brain: A Trophic Theory of Neural Connections. 1990, Cambridge, Massachusetts – USA: Harvard University Press

    Google Scholar 

  89. Hämäläinen M, Hari R, Ilmoniemi RJ, Knuutila J, Lounasmaa OV: Magnetoencephalography—theory, instrumentation, and applications to noninvasive studies of the working human brain. Rev Mod Phys. 1993, 65 (2): 413-10.1103/RevModPhys.65.413.

    Article  Google Scholar 

  90. Braak H, Braak E: Neuropathological stageing of Alzheimer-related changes. Acta Neuropathol. 1991, 82 (4): 239-259. 10.1007/BF00308809.

    Article  CAS  PubMed  Google Scholar 

  91. Herculano-Houzel S: The human brain in numbers: a linearly scaled-up primate brain. Front Hum Neurosci. 2009, 3: 1-11.

    Article  Google Scholar 

  92. Kumar G, Taneja A, Majumdar T, Jacobs ER, Whittle J, Nanchal R: The association of lacking insurance with outcomes of severe sepsis: retrospective analysis of an administrative database*. Crit Care Med. 2014, 42 (3): 583-591. 10.1097/01.ccm.0000435667.15070.9c.

    Article  PubMed  Google Scholar 

  93. Youssef AE: A framework for secure healthcare systems based on Big data analytics in mobile cloud computing environments. Int J Ambient Syst Appl. 2014, 2 (2): 1-11.

    Google Scholar 

Download references

Author information

Author notes

    Authors and Affiliations

    1. Department of Electrical and Computer Engineering, Schulich School of Engineering, University of Calgary, Calgary, AB, Canada

      Emad A Mohammed & Behrouz H Far

    2. Department of Pathology and Laboratory Medicine, University of Calgary and Calgary Laboratory Services, Calgary, AB, Canada

      Christopher Naugler

    Authors
    1. Emad A Mohammed
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Behrouz H Far
      View author publications

      You can also search for this author in PubMed Google Scholar

    3. Christopher Naugler
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding author

    Correspondence to Christopher Naugler.

    Additional information

    Competing interests

    The authors declare that they have no competing interests.

    Authors’ contributions

    EAM, CTN: collection, organizing, and review of the literature; preparing the manuscript. EAM, BHF and CTN: manuscript review, modification, editing, and revision. All authors read and approved the final manuscript.

    Emad A Mohammed, Behrouz H Far and Christopher Naugler contributed equally to this work.

    Authors’ original submitted files for images

    Below are the links to the authors’ original submitted files for images.

    Authors’ original file for figure 1

    Authors’ original file for figure 2

    Authors’ original file for figure 3

    Rights and permissions

    Open Access  This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.

    The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

    To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.

    The Creative Commons Public Domain Dedication waiver (https://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.

    Reprints and Permissions

    About this article

    Verify currency and authenticity via CrossMark

    Cite this article

    Mohammed, E.A., Far, B.H. & Naugler, C. Applications of the MapReduce programming framework to clinical big data analysis: current landscape and future trends. BioData Mining 7, 22 (2014). https://doi.org/10.1186/1756-0381-7-22

    Download citation

    • Received:

    • Accepted:

    • Published:

    • DOI: https://doi.org/10.1186/1756-0381-7-22

    Keywords

    • MapReduce
    • Hadoop
    • Big data
    • Clinical big data analysis
    • Clinical data analysis
    • Bioinformatics
    • Distributed programming

    BioData Mining

    ISSN: 1756-0381