1 A Cost-Benefit Analysis of Indexing Big Data with Map-Reduce Dimitrios Siafarikas Argyrios Samourkasidis Avi Arampatzis Department of Electrical and Computer Engineering Democritus University of Thrace University Campus, Kimmeria, Xanthi 67100, Greece Abstract We reflect upon the challenge a Big Data analyst faces when dealing with the complex problem of considering the approximate amount of nodes needed for a computation to be completed within a given time. We develop a formula which allows anyone, with the job of designing clusters for massive data sets, to do so. We consider the problem of Inverted Index construction which is widely used in Information Retrieval. We present the various aspects and the challenges of this problem along with details on how the system we developed works. Keywords: Information Retrieval, Big Data, Data Mining, Cluster, Inverted Index, Hadoop, Map-Reduce I. INTRODUCTION Conventional databases systems have proved their usefulness throughout the years because of their great potential as systems that provide an organized and structured place for data. The new era of information technology, however, requires advanced analytic capabilities. Difficulties in scalability have emerged during the recent years. Companies like Facebook and Google are capable of creating Gigabytes of data per second. These enormous amounts of datasets spawn various problems and set challenges for the community. The challenges include capture, curation, storage, search, sharing, transfer, analysis and visualization of the so-called Big Data . Big Data refers to a collection of data that is so large and complex, it becomes difficult to process using traditional database management tools or data processing applications. Another example to grasp the size of Big Data is the volume of data that is produced from the Large Hadron Collider (LHC) experiments at CERN. By 2012, more than 300 trillion collisions had been analyzed. The project generated approximately 27 Terabytes of raw data per day and 25 Petabytes per year. Currently, the most popular operational approach to Big Data storage and processing is Horizontal Scalability, that is the ability to connect multiple hardware and software entities so that they work as a single logical unit. One of the popular such frameworks is Apache's Hadoop  which implements the Map-Reduce programming model . In this paper, we purpose a way of building an Inverted Index using the Map-Reduce programming model. Firstly, we program an algorithm in Python in order to comprehend and grasp the idea of Inverted Indices. Then, we modify the algorithm to work on the Map-Reduce programming framework. Hadoop uses Java as the default programming language. Besides that, there is a library, called Hadoop Streaming that allows to develop algorithms in any programming language. This provides an environment for rapid algorithm development in any language the user likes. The rest of this paper is organized as follows. Next we elaborate on inverted indices and how these are classically built. In Section III we give a short introduction to the Map- Reduce programming framework. Section IV presents our proposed implementation of inverted index construction using Map-Reduce. In Section V we attempt a cost-benefit analysis of our proposed implementation in comparison to the classical serially-implemented approach. Conclusions and directions for further research are summarized in Section VI. II. INVERTED INDEX A. Information Retrieval Information retrieval is the activity of obtaining information relevant to an information need from a collection of information resources . Searches can be based on metadata or on full-text (or other content-based) indexing. An information retrieval process begins when a user enters a query into the system. Queries are formal statements of information needs, for example search strings in web search engines. In information retrieval a query does not uniquely identify a single object in the collection. Instead, several objects may match the query, perhaps with different degrees of relevancy. For effectively retrieving relevant documents, the documents are typically transformed into a suitable representation. One of those is the inverted index, which we elaborate on next. B. Inverted Index An inverted index is a data structure storing a mapping from content (such as words) to its location in a database file
2 or in a document or in a set of documents. The purpose of an inverted index is to allow fast full-text searches, at a cost of increased processing when a document is added to the database. It is the most popular data structure used in document retrieval systems. C. Building an Inverted Index To gain the speed benefits of indexing at retrieval time, we have to build the index in advance. The major steps in this are : 1) Collect the documents to be indexed. 2) Tokenize the text, turning each document into a list of tokens. 3) Do linguistic preprocessing (e.g. stemming or lemmatization), producing a list of normalized tokens, which are the indexing terms. 4) Index the documents that each term occurs in by creating an inverted index, consisting of a dictionary and postings. The procedure is depicted in Figure 1. Figure 1. Postings are lists of DocIDs III. MAP-REDUCE Map-Reduce is a programming model for processing large datasets with a parallel, distributed algorithm on a cluster. The most popular open-source implementation is Apache s Hadoop cluster system . A Map-Reduce program mainly consists of two functions: a Map function and a Reduce function. In fact the only thing one has to do is write those two functions, while the system manages the parallel execution in a fault-tolerant way, meaning that it also deals with the possibility of failures on nodes hardware or network s infrastructure upon execution. The tasks that process those functions are called Map Task and Reduce Task, respectively. Hadoop is actively collaborated with Hadoop Distributed File System (HDFS), a distributed file system specifically designed to store massive datasets distributed along multiple servers on a cluster. HDFS is based on the Google File System . HDFS is highly fault-tolerant and can be deployed on lowcost hardware. Specifically, small portions, called chunks, of the data are spread across different nodes and maybe different racks of a cluster. Each of those chunks is replicated among the nodes at a factor of 3, by default. In the event of a single node failure, no data are lost; there are two other copies of those chunks at a different node. The system then perceives that a node is down and then replicates to another node the data to match the replication factor of three. The administrator can increase this factor to get a more redundant deployment. A. Map Tasks The input files for the Map task can be any type; a tuple or a document for example. These inputs are called elements. A chunk is a collection of elements and no element is stored across two chunks. The Map task takes an element as an input argument and as an output produces a number of key-value pairs. The output of the task could be zero pairs, too. Keys do not have to be unique. A Map task can produce several keyvalue pairs with the same key, even from the same input element. Summarizing, the Map function takes a series of key-value pairs, processes each, and generates zero or more output keyvalue pairs. The input and output types of the map can be (and often are) different from each other. For example, if the application is doing a word count, the map function would break the line into words and output a key/value pair for each word. Each output pair would contain the word as the key and the number of instances of that word in the line as the value. B. Reduce Tasks The framework calls the application's Reduce function once for each unique key in the sorted order. The Reduce function takes as an input a pair of a key and its list of associated values. The output of the Reduce function is a sequence of zero or more key-value pairs. These key-value pairs can be of any type from those sent from Map tasks but it is usually the same type. A Reduce task receives one or more keys and their associated value lists. The output of all the Reduce tasks are merged into a single file. In the word count example, the Reduce function takes the input values, sums them and generates a single output of the word and the final sum. C. Execution In brief, a map-reduce job is executed as follows:
3 1) A number of Map tasks are assigned to one or more chunks of data from the distributed file system. These chunks are converted to a sequence of key-value pairs. The way the pairs are produced is up to the developer of the Map function. 2) The key-value pairs that come out of the Map tasks are then collected by a master controller and sorted by key. Then, each batch of key-value pairs with the same key, is given to a Reduce task. 3) The Reduce tasks then, combine all the values associated with that key in some way determined by the developer of the Reduce function. The execution flow is showed in Figure 2. Figure 2. Execution Diagram IV. BUILDING A NON-POSITIONAL INVERTED INDEX WITH MAP-REDUCE A. Map function In our implementation, we feed each Map task with one line of data at a time. Specifically, each word of the line that is separated with a space, is transformed to a new string in the format word \t DocId, where \t is the Tab character and DocID is the name of the file that this particular word was found in. Also the Map function eliminates all unnecessary characters, etc., for the purposes of the Inverted Index. B. Combiners Without any combiners, the output of the Map tasks input directly to the Reduce tasks. Because of the Map functions taking as an input more than one line, coming from multiple files, we are able to reduce the amount of data that have to be transferred across nodes of the network. This is done as follows. When the same word appears in more than one line, then the Combiner function combines the result to the string with the format: word \t DocId1:WordFreq1 DocId2:WordFreq2 where DocFreq, the occurrence frequency of the particular word. To sum up, the Combiner scans for identical words coming from the same Map task. C. Reduce function The output of each Combiner constitutes a small subset of the final Inverted Index. Therefore, our goal is to aggregate all those subsets to a final set. So, this function takes as an input the combined data and as an output, makes a final record i.e. the final Inverted Index. The format of the output is the following: Word \t DocID1:WordFreq1 DocID2:WordFreq2 Figure 3 summarizes the whole procedure of building an Inverted Index in Map-Reduce.
4 Figure 3. Data Flow V. COST ANALYSIS In this section, we attempt to come up with a formula that estimates the total amount of time needed for an indexing job to complete on a cluster of nodes. For the sake of simplicity, a few assumptions must be made first, otherwise the problem becomes too complex and difficult to handle. First of all, we assume that each computing node has one central processing unit (CPU). All the nodes are connected to the same switch in order to avoid further calculations regarding connections via different routers and switches. Also, each node spawns one Map task and the total number of Reduce tasks is less than then number of total Map tasks. Furthermore, we do not take into account the size of the main memory on each node. This size could make a huge difference on the amount of time needed for a job to execute. That is because, the more data are stored in the main memory (multiple times faster than secondary memory), the less data are requested from the secondary (slow) drive. Hence the execution is faster. For our scenario, we assume having at our disposal: Since, in our implementation, Combiners essentially do the same processing as Reducers, we can safely assume that this processing is all done in either of the two, in this case, in the Reducer. A cluster that consists of m nodes with the aforementioned configuration. m and r correspond to the total number of Map and Reduce tasks, respectively. The data at each node is read and processed serially. The dataset is considered already stored in a single disk in the single node setup, and in HDFS in the multi-node setup. We would like to estimate the total amount of time needed to complete a job, given the time needed for a single node to run the same job, t s, and the number of nodes, m, present in the cluster. During execution, the Hadoop framework breaks the whole dataset in smaller portions of data. Each portion is assigned to a Map node and is being processed. All the Map tasks (one per node) are executed in parallel, hence the total time for Map tasks to complete equals to the execution time of one Map task. The amount of the parallel execution of the Map tasks is A single computer, that is able to build an Inverted Index for the whole dataset. This can be seen as equivalent to executing one Map followed by one Reduce (at least the functionality of those) in a single node. The total time needed to complete is t S. In particular, the equivalent of the Map function should take t M, and the equivalent of the Reduce function should complete in time t R. Namely: t S = tm + t R Upon completion of each Map task, the output becomes an input for the Combiner that is associated with the Map on the same node. As we said earlier, we use Combiners to reduce the data transferred across the network. For the purpose of our scenario we consider the processing time of the Combiners as negligible; as we said earlier, it is some amount of processing that has to be done in either the Combiner or the Reducer, and we can assume we load it up to the Reducer. What makes a huge difference is the amount of data that have to be transferred over the network from the Map tasks to the Reduce tasks, and here is where Combiners come into play.
5 The output of each Map task has to be transferred to the Reduce tasks. Next we try to get a rough estimate of the amount of data per chunk, K, that have to be transferred over the network with and without Combiners. We can assume that for a large number of Mappers it is safe to consider that almost all data coming out of each Map will have to get to a Reducer somewhere else on the net. Let us assume that each chunk has the default size of 64Mbytes. We take the length of the average English word as 5.1 characters . We should at least add spaces between words. Therefore, the length equals to = 6.1 bytes per word. Also, we presume what we have pure text (no html or other mark-up in between) and the text is in 8-bit ASCII, too. So, if we divide the chunk size with the average size per word, we get around 11,001,453 non-unique words per chunk. Without Combiners we have to transfer Word \t DocId approximately 11 million times. Specifically, Word is around 5.1 bytes, the tab character is 1 byte and the DocID takes 4 bytes assuming it is a Long Integer. Thus, the length per string is 10.1 bytes, and the total transfer is K= Mbytes per chunk. With Combiners we need to transfer Word \t DocID1:WordFreq1 DocID2:WordFreq2 per unique word in a chunk. Word is again 5.1 bytes. Each posting is 10 bytes, assuming 4 bytes for docids and 4 for frequency (both Long Integers) plus 2 bytes for the delimiters (`\t' and `:' for the first posting and ` ' and `:' for all the others.) To complete the calculation, we need to estimate the number of unique words per chunk and the average number of postings per unique word. We assume that no stop-list, stemmer or any other pre-processing that reduces the length or the number of words/tokens are used. In linguistics, the number of unique words, N, in a text as a function of text length (in words) is given by the empirical law of Heaps . According to Heaps Law and assuming beta=0.5 (a widely-known empirically found value), k=31.6 (we take the middle of the logarithmic range [10,100] using a base of 10---this is the suggested range for k in the literature, for English text) and n=11,001,453, we estimate N=104,812 unique words per chunk. Zipf's law states that given some corpus of natural language utterances, the frequency of any word is inversely proportional to its rank in the frequency table , i.e. the distribution of frequencies follows a power-law with an exponent of 1. It is also known that the distribution of document frequencies (DF, i.e. the number of documents a word occurs in) also follows a power-law, albeit with a higher exponent (steeper curve). Empirical data show that the exponent is around s=2 . This means that the ith largest DF is, where c is some constant. The average document length is around 1,000,000 characters , i.e Mbytes. So, we have 64 Mbytes/ Mbytes = documents per chunk. We assume that the most common word (i=1) appears in all chunk's documents, so c must be Now the average DF is Thus, empirical laws produce a very small number meaning that each unique word has almost zero postings; empirically the average is just above 1, which makes sense since most unique words occur in a single document. Consequently, with Combiners, we have to transfer 104,812 unique words of 6.1 bytes each associated on average with 1 posting of 10 bytes, that is K=1.61 Mbytes in total per chunk. Thus, using Combiners reduces the network load by an impressive 98.5%. At first sight, we see that the data transferred for a single chunk, when we do not use the Combiner, is around twice the size of data without the use of it. The benefit comes when we take into account the number of the unique and the non-unique words in a chunk. As we calculated earlier, the total data need to be transferred when we use Combiners is K = 1.61 Mbytes = Gbytes = Gigabits. are: To sum up, the total data that need to be transferred Now, even if we interconnect the nodes with an Ethernet network of one Gigabit per second, the amount of time needed to move the data across the nodes is significantly more than the time needed to process the same data. This equals to:
6 As with the case of the Map tasks, the time needed for all the parallel Reduce tasks to complete is: To determine the total time for completion of the cluster job, we use the following equation: The above equation could be an asset on the process of determining the approximate number of nodes of a cluster, given the execution time on a single node that processes the data serially. We have to underline here, the tradeoff for the benefits of parallelization, is the big communication cost between the nodes. I. CONCLUSIONS REFERENCES  Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University Press,  Wikipedia, the free encyclopedia, Big Data, [Online]. Available:  Wikipedia, the free encyclopedia, Apache Hadoop, [Online]. Available:  Sanjay Ghemawat, Howard Gobioff and Shunk-Tak Leung, The Google File System, Proceedings of the 19th ACM Symposium on Operating Systems Pinciples 2003 (SOSP 2003), Bolton Landing, NY, USA, October 19-22,  Wolfram Alpha, computational knowledge engine, Average English word length [Online]. Available:  Tom White, Hadoop: The definitive guide 2nd editions, O Reilly  Christopher D. Manning, Prabhakar Raghavan and Hinrich Schutze, Introduction to Information Retrieval, Cambridge University Press,  Heaps, Harold Stanley, Information Retrieval: Computational and Theoretical Aspects, Academic Press, Section 7.5, pp  Wentian Li, Random Texts Exhibit Zipf s-law-like Word Frequency Distribution, IEEE Transactions on Information Theory 38 (6): Doi: /  Jeffrey Dean, Sanjay Ghemawat, MapReduce: Simplified Data Processing on Large Clusters, 6th Symposium on Operating System Design and Implementation (OSDI 2004), San Francisco, California, December 6-8,  Jimmy Lin. The Curse of Zipf and Limits to Parallelization: A Look at the Stragglers Problem in MapReduce, Proceedings of the 7 th Workshop on Large-Scale Distributed Systems for Information Retrieval (LSDS-IR 09) at SIGIR 2009, July 2009, Boston, Massachusetts. Map-Reduce is the state of the art for processing Big Data sets. Indexing is a parallelizable problem, so that Map-Reduce is an ideal framework for information retrieval. Since parallelization comes with an amount of overhead, it is crucial to specify when the Big Data are "big" enough in order to use a cluster for the process. Equally important is to be able to determine the approximate number of nodes that consist a cluster, in order to process Big Data at a given time.
Big Data Technology Map-Reduce Motivation: Indexing in Search Engines Edward Bortnikov & Ronny Lempel Yahoo Labs, Haifa Indexing in Search Engines Information Retrieval s two main stages: Indexing process
Introduction to Hadoop 1 What is Hadoop? the big data revolution extracting value from data cloud computing 2 Understanding MapReduce the word count problem more examples MCS 572 Lecture 24 Introduction
Comparison of Different Implementation of Inverted Indexes in Hadoop Hediyeh Baban, S. Kami Makki, and Stefan Andrei Department of Computer Science Lamar University Beaumont, Texas (hbaban, kami.makki,
Big Data and Apache Hadoop s MapReduce Michael Hahsler Computer Science and Engineering Southern Methodist University January 23, 2012 Michael Hahsler (SMU/CSE) Hadoop/MapReduce January 23, 2012 1 / 23
Chapter 11 Map-Reduce, Hadoop, HDFS, Hbase, MongoDB, Apache HIVE, and Related Summary Xiangzhe Li Nowadays, there are more and more data everyday about everything. For instance, here are some of the astonishing
Comparative analysis of mapreduce job by keeping data constant and varying cluster size technique Mahesh Maurya a, Sunita Mahajan b * a Research Scholar, JJT University, MPSTME, Mumbai, India,email@example.com
Volume 2, Issue 8, August 2014 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
Journal of Computational Information Systems 7: 16 (2011) 5956-5963 Available at http://www.jofcis.com Large-Scale Data Sets Clustering Based on MapReduce and Hadoop Ping ZHOU, Jingsheng LEI, Wenjun YE
CSE 590: Special Topics Course ( Supercomputing ) Lecture 10 ( MapReduce& Hadoop) Rezaul A. Chowdhury Department of Computer Science SUNY Stony Brook Spring 2016 MapReduce MapReduce is a programming model
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK A REVIEW ON HIGH PERFORMANCE DATA STORAGE ARCHITECTURE OF BIGDATA USING HDFS MS.
CSE-E5430 Scalable Cloud Computing Lecture 2 Keijo Heljanko Department of Computer Science School of Science Aalto University firstname.lastname@example.org 14.9-2015 1/36 Google MapReduce A scalable batch processing
Hadoop and Map-reduce computing 1 Introduction This activity contains a great deal of background information and detailed instructions so that you can refer to it later for further activities and homework.
Log Mining Based on Hadoop s Map and Reduce Technique ABSTRACT: Anuja Pandit Department of Computer Science, email@example.com Amruta Deshpande Department of Computer Science, firstname.lastname@example.org
The Hadoop Framework Nils Braden University of Applied Sciences Gießen-Friedberg Wiesenstraße 14 35390 Gießen email@example.com Abstract. The Hadoop Framework offers an approach to large-scale
Chapter 7 Using Hadoop Cluster and MapReduce Modeling and Prototyping of RMS for QoS Oriented Grid Page 152 7. Using Hadoop Cluster and MapReduce for Big Data Problems The size of the databases used in
Hadoop Architecture Part 1 Node, Rack and Cluster: A node is simply a computer, typically non-enterprise, commodity hardware for nodes that contain data. Consider we have Node 1.Then we can add more nodes,
Enhancing Dataset Processing in Hadoop YARN Performance for Big Data Applications Ahmed Abdulhakim Al-Absi, Dae-Ki Kang and Myong-Jong Kim Abstract In Hadoop MapReduce distributed file system, as the input
marlabs driving digital agility WHITEPAPER Big Data and Hadoop Abstract This paper explains the significance of Hadoop, an emerging yet rapidly growing technology. The prime goal of this paper is to unveil
Distributed computing: index building and use Distributed computing Goals Distributing computation across several machines to Do one computation faster - latency Do more computations in given time - throughput
A STUDY ON HADOOP ARCHITECTURE FOR BIG DATA ANALYTICS Dr. Ananthi Sheshasayee 1, J V N Lakshmi 2 1 Head Department of Computer Science & Research, Quaid-E-Millath Govt College for Women, Chennai, (India)
The Performance Characteristics of MapReduce Applications on Scalable Clusters Kenneth Wottrich Denison University Granville, OH 43023 firstname.lastname@example.org ABSTRACT Many cluster owners and operators have
MapReduce MapReduce and SQL Injections CS 3200 Final Lecture Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. OSDI'04: Sixth Symposium on Operating System Design
Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Configuration Tuning
Big Data Analytics Hadoop and Spark Shelly Garion, Ph.D. IBM Research Haifa 1 What is Big Data? 2 What is Big Data? Big data usually includes data sets with sizes beyond the ability of commonly used software
Introduction to Hadoop HDFS and Ecosystems ANSHUL MITTAL Slides credits: Cloudera Academic Partners Program & Prof. De Liu, MSBA 6330 Harvesting Big Data Topics The goal of this presentation is to give
BIG, MAPREDUCE & HADOOP LARGE SCALE DISTRIBUTED SYSTEMS By Jean-Pierre Lozi A tutorial for the LSDS class LARGE SCALE DISTRIBUTED SYSTEMS BIG, MAPREDUCE & HADOOP 1 OBJECTIVES OF THIS LAB SESSION The LSDS
A Study on Workload Imbalance Issues in Data Intensive Distributed Computing Sven Groot 1, Kazuo Goda 1, and Masaru Kitsuregawa 1 University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505, Japan Abstract.
Journal of Computational Information Systems 7: 6 () 5769-5775 Available at http://www.jofcis.com Research on Job Scheduling Algorithm in Hadoop Yang XIA, Lei WANG, Qiang ZHAO, Gongxuan ZHANG School of
, pp. 177-186 http://dx.doi.org/10.14257/ijseia.2015.9.12.16 Efficient Data Replication Scheme based on Hadoop Distributed File System Jungha Lee 1, Jaehwa Chung 2 and Daewon Lee 3* 1 Division of Supercomputing,
A Brief Outline on Bigdata Hadoop Twinkle Gupta 1, Shruti Dixit 2 RGPV, Department of Computer Science and Engineering, Acropolis Institute of Technology and Research, Indore, India Abstract- Bigdata is
Processing of Hadoop using Highly Available NameNode 1 Akash Deshpande, 2 Shrikant Badwaik, 3 Sailee Nalawade, 4 Anjali Bote, 5 Prof. S. P. Kosbatwar Department of computer Engineering Smt. Kashibai Navale
CS2510 Computer Operating Systems HADOOP Distributed File System Dr. Taieb Znati Computer Science Department University of Pittsburgh Outline HDF Design Issues HDFS Application Profile Block Abstraction
CS2510 Computer Operating Systems HADOOP Distributed File System Dr. Taieb Znati Computer Science Department University of Pittsburgh Outline HDF Design Issues HDFS Application Profile Block Abstraction
Distributed Computing and Big Data: Hadoop and MapReduce Bill Keenan, Director Terry Heinze, Architect Thomson Reuters Research & Development Agenda R&D Overview Hadoop and MapReduce Overview Use Case:
SEMINAR: COLUMNAR DATABASES 1 MapReduce With Columnar Storage Peitsa Lähteenmäki Abstract The MapReduce programming paradigm has achieved more popularity over the last few years as an option to distributed
RESEARCH ARTICLE OPEN ACCESS Distributed Framework for Data Mining As a Service on Private Cloud Shraddha Masih *, Sanjay Tanwani** *Research Scholar & Associate Professor, School of Computer Science &
Hadoop IST 734 SS CHUNG Introduction What is Big Data?? Bulk Amount Unstructured Lots of Applications which need to handle huge amount of data (in terms of 500+ TB per day) If a regular machine need to
Tutorial: Big Data Algorithms and Applications Under Hadoop KUNPENG ZHANG SIDDHARTHA BHATTACHARYYA http://kzhang6.people.uic.edu/tutorial/amcis2014.html August 7, 2014 Schedule I. Introduction to big data
Designing Algorithms for MapReduce MapReduce: Algorithm Design Patterns Need to adapt to a restricted model of computation Goals Scalability: adding machines will make the algo run faster Efficiency: resources
What is Analytic Infrastructure and Why Should You Care? Robert L Grossman University of Illinois at Chicago and Open Data Group email@example.com ABSTRACT We define analytic infrastructure to be the services,
Recognization of Satellite Images of Large Scale Data Based On Map- Reduce Framework Vidya Dhondiba Jadhav, Harshada Jayant Nazirkar, Sneha Manik Idekar Dept. of Information Technology, JSPM s BSIOTR (W),
Open source software framework designed for storage and processing of large scale data on clusters of commodity hardware Created by Doug Cutting and Mike Carafella in 2005. Cutting named the program after
Parallel Processing of cluster by Map Reduce Abstract Madhavi Vaidya, Department of Computer Science Vivekanand College, Chembur, Mumbai firstname.lastname@example.org MapReduce is a parallel programming model
IMPROVED FAIR SCHEDULING ALGORITHM FOR TASKTRACKER IN HADOOP MAP-REDUCE Mr. Santhosh S 1, Mr. Hemanth Kumar G 2 1 PG Scholor, 2 Asst. Professor, Dept. Of Computer Science & Engg, NMAMIT, (India) ABSTRACT
CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu 2 CPU Memory Machine Learning, Statistics Classical Data Mining Disk 3 20+ billion web pages x 20KB = 400+ TB
Hadoop http://hadoop.apache.org/ What Is Apache Hadoop? The Apache Hadoop software library is a framework that allows for the distributed processing of large data sets across clusters of computers using
A REVIEW PAPER ON THE HADOOP DISTRIBUTED FILE SYSTEM Sneha D.Borkar 1, Prof.Chaitali S.Surtakar 2 Student of B.E., Information Technology, J.D.I.E.T, email@example.com Assistant Professor, Information
Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com Image
Distributed File Systems Paul Krzyzanowski Rutgers University October 28, 2012 1 Introduction The classic network file systems we examined, NFS, CIFS, AFS, Coda, were designed as client-server applications.
4 Overview A very short Intro to Hadoop photo by: exfordy, flickr 5 How to Crunch a Petabyte? Lots of disks, spinning all the time Redundancy, since disks die Lots of CPU cores, working all the time Retry,
Mobile Cloud Computing for Data-Intensive Applications Senior Thesis Final Report Vincent Teo, firstname.lastname@example.org Advisor: Professor Priya Narasimhan, email@example.com Abstract The computational and storage
With Saurabh Singh firstname.lastname@example.org The Ohio State University February 11, 2016 Overview 1 2 3 Requirements Ecosystem Resilient Distributed Datasets (RDDs) Example Code vs Mapreduce 4 5 Source: [Tutorials
Hadoop and other distributed systems are increasingly the solution of choice for next generation data volumes. A high capacity, any to any, easily manageable networking layer is critical for peak Hadoop
Introduction to Big Data! with Apache Spark" UC#BERKELEY# This Lecture" The Big Data Problem" Hardware for Big Data" Distributing Work" Handling Failures and Slow Machines" Map Reduce and Complex Jobs"
Outline High Performance Computing (HPC) Towards exascale computing: a brief history Challenges in the exascale era Big Data meets HPC Some facts about Big Data Technologies HPC and Big Data converging
Data-Intensive Computing with Map-Reduce and Hadoop Shamil Humbetov Department of Computer Engineering Qafqaz University Baku, Azerbaijan email@example.com Abstract Every day, we create 2.5 quintillion
Bringing Big Data Modelling into the Hands of Domain Experts David Willingham Senior Application Engineer MathWorks firstname.lastname@example.org 2015 The MathWorks, Inc. 1 Data is the sword of the
Abstract- Today data is increasing in volume, variety and velocity. To manage this data, we have to use databases with massively parallel software running on tens, hundreds, or more than thousands of servers.
Zihang Yin Introduction R is commonly used as an open share statistical software platform that enables analysts to do complex statistical analysis with limited computing knowledge. Frequently these analytical
Welcome to the unit of Hadoop Fundamentals on Hadoop architecture. I will begin with a terminology review and then cover the major components of Hadoop. We will see what types of nodes can exist in a Hadoop
Governors State University OPUS Open Portal to University Scholarship All Capstone Projects Student Capstone Projects Spring 2015 Big Data Analytics by Using Hadoop Chaitanya Arava Governors State University
Department of Computer Science University of Cyprus EPL646 Advanced Topics in Databases Lecture 14 Big Data Management IV: Big-data Infrastructures (Background, IO, From NFS to HFDS) Chapter 14-15: Abideboul
CS 2510 COMPUTER OPERATING SYSTEMS Cloud Computing MAPREDUCE Dr. Taieb Znati Computer Science Department University of Pittsburgh MAPREDUCE Programming Model Scaling Data Intensive Application MapReduce
GraySort and at Yahoo on Hadoop.23 Thomas Graves Yahoo! May, 213 The Apache Hadoop software library is an open source framework that allows for the distributed processing of large data sets across clusters
L1: Introduction to Hadoop Feng Li email@example.com School of Statistics and Mathematics Central University of Finance and Economics Revision: December 1, 2014 Today we are going to learn... 1 General
Introduction to Hadoop and MapReduce THE CONTRACTOR IS ACTING UNDER A FRAMEWORK CONTRACT CONCLUDED WITH THE COMMISSION Large-scale Computation Traditional solutions for computing large quantities of data
American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629
Apriori-Map/Reduce Algorithm Jongwook Woo Computer Information Systems Department California State University Los Angeles, CA Abstract Map/Reduce algorithm has received highlights as cloud computing services
Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit
SCALEOUT SOFTWARE How In-Memory Data Grids Can Analyze Fast-Changing Data in Real Time by Dr. William Bain and Dr. Mikhail Sobolev, ScaleOut Software, Inc. 2012 ScaleOut Software, Inc. 12/27/2012 T wenty-first
An Oracle White Paper June 2012 High Performance Connectors for Load and Access of Data from Hadoop to Oracle Database Executive Overview... 1 Introduction... 1 Oracle Loader for Hadoop... 2 Oracle Direct
Information Retrieval Elasticsearch IR Information retrieval (IR) is the activity of obtaining information resources relevant to an information need from a collection of information resources. Searches
NoSQL and Hadoop Technologies On Oracle Cloud Vatika Sharma 1, Meenu Dave 2 1 M.Tech. Scholar, Department of CSE, Jagan Nath University, Jaipur, India 2 Assistant Professor, Department of CSE, Jagan Nath
Big Data Challenges in Bioinformatics BARCELONA SUPERCOMPUTING CENTER COMPUTER SCIENCE DEPARTMENT Autonomic Systems and ebusiness Pla?orms Jordi Torres Jordi.Torres@bsc.es Talk outline! We talk about Petabyte?