Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • HBase High Performance Cookbook
  • Toc
  • feedback
HBase High Performance Cookbook

HBase High Performance Cookbook

By : Ruchir Choudhry
2.5 (2)
close
HBase High Performance Cookbook

HBase High Performance Cookbook

2.5 (2)
By: Ruchir Choudhry

Overview of this book

Apache HBase is a non-relational NoSQL database management system that runs on top of HDFS. It is an open source, disturbed, versioned, column-oriented store and is written in Java to provide random real-time access to big Data. We’ll start off by ensuring you have a solid understanding the basics of HBase, followed by giving you a thorough explanation of architecting a HBase cluster as per our project specifications. Next, we will explore the scalable structure of tables and we will be able to communicate with the HBase client. After this, we’ll show you the intricacies of MapReduce and the art of performance tuning with HBase. Following this, we’ll explain the concepts pertaining to scaling with HBase. Finally, you will get an understanding of how to integrate HBase with other tools such as ElasticSearch. By the end of this book, you will have learned enough to exploit HBase for boost system performance.
Table of Contents (13 chapters)
close
7
7. Large-Scale MapReduce
12
Index

Introduction

As you know Hbase is a database, which essentially takes all the advantage of using the core foundation of HDFS and MapReduce. This allows it to scale in a distributed architecture. Its schemaless design allows us to bring in a unique ability and flexibility to make design decisions based on the way the data needs to be stored at a very large scale. It also allows fast scans, growth at a rate of petabytes and still gives cell level transaction flexibility to the application. As in any efficient database, Hbase I/O is designed to perform at high concurrency and I/O. The internal design incorporates an ordered write log and a log-structured merge-tree algorithm, which allows us to do this. It's very important to understand these fundamental blocks, which will enable us to make the right choice of design for scalability.

We will discuss some of the core concepts by the individual recipes, as follows:

  • Seek versus transfer
  • Storage
  • Write Path
  • Read Path
  • Replication
  • WAL(Write Ahead...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete