NDLI: Replica parallelism to utilize the granularity of data

Please wait, while we are loading the content...

A cooperative method for processing range-skyline queries in mobile wireless sensor networks

A smart-device news recommendation technology based on the user click behavior

After the boom no one tweets: microblog-based influenza detection incorporating indirect information

Medical examination data prediction using simple recurrent network and long short-term memory

Replica parallelism to utilize the granularity of data

$SP^{2}:$ spanner construction for shortest path computation on streaming graph

Spammer detection for real-time big data graphs

A comparative analysis of iterative MapReduce systems

AGAR: an attribute-based graph refining method for community search

Big data compression paradigms for supporting efficient and scalable data-intensive IoT frameworks

Block storage scheduling based on SLA in cloud storage systems

Design and implementation of a data-driven simulation service system

Effectiveness of reverse edges and uncertainty in PIN-TRUST for trust prediction

Knock knock: who's there? package delivery at the right address

Locality aware management on NAND flash-based main memory for in-memory database systems

Maximizing information through multiple kernel-based heterogeneous data integration and applications to ovarian cancer

Performance improvement plan for MySQL insert buffer

Processing a continuous range query in mobile P2P network environments

SNS data visualization for analyzing spatial-temporal distribution of social anxiety

Top-k frequent induced subgraph mining using sampling

A ballet posture education using IT techniques: a comparative study

Design and development of visualization tool for movie review and sentiment analysis

Efficient and secure top-k query processing algorithm using garbled circuit based secure protocols on outsourced databases

Exploring correlation for fast skyline computation

I/O characteristics of MongoDB and trim-based optimization in flash SSDs

Improving real-time interoperation of national defense M&S system using distributed DBMS

Recommend alternative drugs to minimize side-effect using generic name of drug

Search result diversification using data envelopment analysis

Sentiment analysis at sentence level for heterogeneous datasets

Replica parallelism to utilize the granularity of data

Content Provider	ACM Digital Library
Author	Choi, Won Gi Park, Sanghyun
Abstract	As the volume of relational data is increased significantly, big data technologies have been noticed for recent years. Hadoop File System (HDFS) [14] is a basis of several big data systems and enables large data sets to be stored across the big data environment which is composed of many computers. HDFS divides large data into several blocks and each block is distributed and stored in a computer. To support reliability of data, HDFS replicates the data block. Generally, HDFS provides high-throughput when a client accesses to data. However, the architecture of HDFS is mainly designed to process data whose pattern is large and sequential. A data input whose pattern is small and random is not appropriate for applying HDFS. The data can result in several weak points of HDFS in terms of performance. HBase [2], one of Hadoop eco-systems, is a distributed data store which can process random, small read/write data efficiently. HBase utilizes HDFS structure but the block size of HBase is smaller than one of HDFS and a file of HBase is composed by blocks which is arranged by index structure. As many softwares which are related with big data science have emerged, many researches improving the system performance also have emerged steadily. Because a read workload is dominant in most big data workloads, read performance in the big data systems is crucial. To improve the read performance of HBase, we propose a replica parallelism algorithm utilizing the fact that block size of HDFS and HBase are different. When a read I/O is requested, HDFS generally selects a best node which is closest to client and I/O tend to converge on the specific node. We suggest distributing I/O jobs to replicas of HDFS based on sub-region of file to reduce a seek time and utilize the full bandwidth of all replicas. We analyzed the performance results of original Hbase using YCSB benchmark known as a well-known benchmark for distributed data store. In additional, we predict the performance of the replica parallelism comparing with original Hbase. According to predicted result of experiment, the replica parallelism can improve the read performance up to 1.5x ∼ 2.5x comparing with the conventional Hbase. Additionally, highly random read requests can intensify the effectiveness of the replica parallelism.
Starting Page	35
Ending Page	42
Page Count	8
File Format	PDF
ISBN	9781450347549
DOI	10.1145/3007818.3007835
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-17
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Distributed store Big data platform Hadoop Hbase Storage technology
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The research for storage scheme based on Hadoop

An Analysis of Deployment Models of HBase-based Hadoop Platform in Virtualized Computing Environment

Distributed storage of network measurement data on HBase

HB+tree: use hadoop and HBase even your data isn't that big

Hadoop-HBase for large-scale data

Implementation of Data Transform Method into NoSQL Database for Healthcare Data

Azure Data Lake Store: A Hyperscale Distributed File Service for Big Data Analytics

A GPS Trajectory Map-Matching Mechanism with DTG Big Data on the HBase System

Effectiveness Assessment of Solid-State Drive Used in Big Data Services

Replica parallelism to utilize the granularity of data

Similar Documents

The research for storage scheme based on Hadoop

An Analysis of Deployment Models of HBase-based Hadoop Platform in Virtualized Computing Environment

Distributed storage of network measurement data on HBase

HB+tree: use hadoop and HBase even your data isn't that big

Hadoop-HBase for large-scale data

Implementation of Data Transform Method into NoSQL Database for Healthcare Data

Azure Data Lake Store: A Hyperscale Distributed File Service for Big Data Analytics

A GPS Trajectory Map-Matching Mechanism with DTG Big Data on the HBase System

Effectiveness Assessment of Solid-State Drive Used in Big Data Services

Replica parallelism to utilize the granularity of data