Home > Articles > Data

Introduction to HBase, the NoSQL Database for Hadoop

  • Print
  • + Share This
HBase is called the Hadoop database because it is a NoSQL database that runs on top of Hadoop. It combines the scalability of Hadoop by running on the Hadoop Distributed File System (HDFS), with real-time data access as a key/value store and deep analytic capabilities of Map Reduce. This article introduces HBase and describes how it organizes and manages data and then demonstrates how to set up a local HBase environment and interact with data using the HBase shell.
Like this article? We recommend

Apache HBase is a NoSQL database that runs on top of Hadoop as a distributed and scalable big data store. This means that HBase can leverage the distributed processing paradigm of the Hadoop Distributed File System (HDFS) and benefit from Hadoop’s MapReduce programming model. It is meant to host large tables with billions of rows with potentially millions of columns and run across a cluster of commodity hardware. But beyond its Hadoop roots, HBase is a powerful database in its own right that blends real-time query capabilities with the speed of a key/value store and offline or batch processing via MapReduce. In short, HBase allows you to query for individual records as well as derive aggregate analytic reports across a massive amount of data.

As a little bit of history, Google was faced with a challenging problem: How could it provide timely search results across the entire Internet? The answer was that it essentially needed to cache the Internet and define a new way to search that enormous cache quickly. It defined the following technologies for this purpose:

  • Google File System: A scalable distributed file system for large distributed data-intensive applications
  • BigTable: A distributed storage system for managing structured data that is designed to scale to a large size: petabytes of data across thousands of commodity servers
  • MapReduce: A programming model and an associated implementation for processing and generating large data sets

It was not too long after Google published these documents that we started seeing open source implementations of them, and in 2007, Mike Cafarella released code for an open source BigTable implementation that he called HBase. Since then HBase has become a top-level Apache project that runs in Facebook, Twitter, and Adobe, just to name a few.

HBase is not a relational database and requires a different approach to modeling your data. HBase actually defines a four-dimensional data model and the following four coordinates define each cell (see Figure 1):

  • Row Key: Each row has a unique row key; the row key does not have a data type and is treated internally as a byte array.
  • Column Family: Data inside a row is organized into column families; each row has the same set of column families, but across rows, the same column families do not need the same column qualifiers. Under-the-hood, HBase stores column families in their own data files, so they need to be defined upfront, and changes to column families are difficult to make.
  • Column Qualifier: Column families define actual columns, which are called column qualifiers. You can think of column qualifiers as the columns themselves.
  • Version: Each column can have a configurable number of versions, and you can access the data for a specific version of a column qualifier.

Figure 1. HBase Four-Dimensional Data Model

As shown in Figure 1, an individual row is accessible through its row key and is composed of one or more column families. Each column family has one or more column qualifiers (called “column” in Figure 1) and each column can have one or more versions. To access an individual piece of data, you need to know its row key, column family, column qualifier, and version.

When designing an HBase data model, it is helpful to think about how the data is going to be accessed. You can access HBase data in two ways:

  • Through their row key or via a table scan for a range of row keys
  • In a batch manner using map-reduce

This dual-approach to data access is something that makes HBase particularly powerful. Typically, storing data in Hadoop means that it is good for offline or batch analysis (and it is very, very good at batch analysis) but not necessarily for real-time access. HBase addresses this by being both a key/value store for real-time analysis and supporting map-reduce for batch analysis.

Let’s first look at the real-time access. As a key/value store, the key is the row key, and the value is the collection of column families, as shown in Figure 2.

Figure 2. HBase as a Key/Value Store

As you can see in Figure 2, the key is the row key we have been talking about, and the value is the collection of column families (that have their associated columns that have versions of the data). You can retrieve the value associated with a key; or in other words, you can “get” the row associated with a row key, or you can retrieve a set of rows by giving the starting row key and ending row key, which is referred to as a table scan. You cannot query for values contained in columns in a real-time query, which leads to an important topic: row key design.

The design of the row key is important for two reasons:

  • Table scans operate against the row key, so the design of the row key controls how much real-time/direct access you can perform against HBase.
  • When running HBase in a production environment, it runs on top of the Hadoop Distributed File System (HDFS) and the data is distributed across the HDFS based on the row key. If all your row keys start with “user-” then most likely the majority of your data will be isolated to a single node (which defeats the purpose of distributing the data in the first place). Your row keys, therefore, should be different enough to be distributed across the entire deployment/

The manner in which you design your row keys depends on how you intend to access those rows. If you store data on a per user basis, then one strategy is to leverage the fact that row keys are ultimately stored as byte arrays in HBase, so we can create a hash (such as an MD5 or SHA-1 hash code) of the user ID and then append the time (as a long) to hash. The importance in using a hash is two-fold: (1) it distributes values so that the data can be distributed across the cluster and (2) it ensures that the length (in bytes) of the key is consistent and hence easier to use in table scans.

Enough with theory; the next section shows you how to set up an HBase environment and start using it via its shell.

Setting Up an HBase Environment

You can download HBase from the Apache website; at the time of this writing, the latest version is 0.98.5. The HBase team recommends that you install HBase on a UNIX/Linux environment, so if you run Windows, you might want to download and install Cygwin and run HBase from there. After you have the file downloaded, decompress it to your hard drive. You need to have Java installed to launch HBase, so if you have not already done so, download and install Java from Oracle’s website. Define an environment variable named “HBASE_HOME” that points to the root directory of where you decompressed HBase, and then execute the start-hbase.sh script from HBase’s bin directory. It will log output to the following directory:

$HBASE_HOME/logs/

You can test your installation by opening a browser to the following URL:

http://localhost:60010

You should see a screen similar to Figure 3.

Figure 3. HBase Management Screen

Let’s begin by interacting with HBase using its command shell. Execute the following command from HBase’s bin directory:

./hbase shell

You should see output similar to the following:

HBase Shell; enter 'help<RETURN>' for list of supported commands.
Type "exit<RETURN>" to leave the HBase Shell
Version 0.98.5-hadoop2, rUnknown, Mon Aug  4 23:58:06 PDT 2014
hbase(main):001:0>

Let’s create a new table named 'PageViews' with a column family named 'info':

hbase(main):002:0> create 'PageViews', 'info'
0 row(s) in 5.3160 seconds
=> Hbase::Table - PageViews

Every table needs to have at least one column family, so we created one named 'info'. Now let’s look at our table. Execute the following command to list all tables:

hbase(main):002:0> list
TABLE                                                                                                                                                                                                                                
PageViews                                                                                                                                                                                                                            
1 row(s) in 0.0350 seconds
=> ["PageViews"]

As you can see, the list command returns a single table, namely 'PageViews'. We can get more information about the table by executing the describe command:

hbase(main):003:0> describe 'PageViews'
DESCRIPTION                                                                                                                                         ENABLED                                                                          
 'PageViews', {NAME => 'info', DATA_BLOCK_ENCODING => 'NONE', BLOOMFILTER => 'ROW',
 REPLICATION_SCOPE => '0', VERSIONS => '1', COMPRESSION => 'NONE true                                                                             
 ', MIN_VERSIONS => '0', TTL => 'FOREVER', KEEP_DELETED_CELLS => 'false',
 BLOCKSIZE => '65536', IN_MEMORY => 'false', BLOCKCACHE => 'true'}                                                                                          
1 row(s) in 0.0480 seconds

The describe command returns details about the table, including a list of all column families, which in our case is one: info. Now let's add some data to our table. The following command inserts a new row into the info column family:

hbase(main):004:0> put 'PageViews', 'rowkey1', 'info:page', '/mypage' 
0 row(s) in 0.0850 seconds

The put command inserts a new record into the row with row key “rowkey1”. We specify that we are adding the value “/mypage” into the page column in the info column family. We can then retrieve the column families and their values for rowkey1 with the get command:

hbase(main):005:0> get 'PageViews', 'rowkey1'
COLUMN                                                     CELL                                                                                                                                                                      
 info:page                                                 timestamp=1410374788088, value=/mypage                                                                                                                                    
1 row(s) in 0.0250 seconds

You can see that column “info:page”, or more specifically the page column qualifier in the info column family, has the value “/mypage” and the specified time stamp for when it was inserted. Let's add another row before we do a table scan:

hbase(main):006:0> put 'PageViews', 'rowkey2', 'info:page', '/myotherpage' 
0 row(s) in 0.0050 seconds

Now that we have two rows, let's query for all rows in the PageViews table:

hbase(main):007:0> scan 'PageViews'
ROW                                                        COLUMN+CELL                                                                                                                                                               
 rowkey1                                                   column=info:page, timestamp=1410374788088, value=/mypage                                                                                                                  
 rowkey2                                                   column=info:page, timestamp=1410374823590, value=/myotherpage                                                                                                             
2 row(s) in 0.0350 seconds

As mentioned in the previous section, we cannot query per se, but rather we can scan the table. If you execute a scan with the table name, it returns all rows in the table, which is probably not what you want to do. Instead you can send it a start row and an end row to limit the returned value. Let's insert a row with a row key that start with “s”:

hbase(main):012:0> put 'PageViews', 'srowkey2', 'info:page', '/myotherpage' 

Now if we add in the constraints that we want to see rows with a row key greater than 'r' and less than 's', we can construct the following table scan:

hbase(main):014:0> scan 'PageViews', { STARTROW => 'r', ENDROW => 's' }
ROW                                                        COLUMN+CELL                                                                                                                                                               
 rowkey1                                                   column=info:page, timestamp=1410374788088, value=/mypage                                                                                                                  
 rowkey2                                                   column=info:page, timestamp=1410374823590, value=/myotherpage                                                                                                             
2 row(s) in 0.0080 seconds

This scan returned back only the row keys that started with 'r'. The comparison is based on the full row key, so 'rowkey1' is greater than 'r' so it was returned. The scan includes rows that match the STARTROW value but excludes rows that match the ENDROW value. Note that the ENDROW value is actually optional, so if we execute the same query with just the STARTROW, then we'll receive every row greater than 'r':

hbase(main):013:0> scan 'PageViews', { STARTROW => 'r' }
ROW                                                        COLUMN+CELL                                                                                                                                                               
 rowkey1                                                   column=info:page, timestamp=1410374788088, value=/mypage                                                                                                                  
 rowkey2                                                   column=info:page, timestamp=1410374823590, value=/myotherpage                                                                                                             
 srowkey2                                                  column=info:page, timestamp=1410375975965, value=/myotherpage                                                                                                             
3 row(s) in 0.0120 seconds

Summary

HBase is a NoSQL database commonly referred to as the Hadoop Database, which is open-source and is based on Google's Big Table white paper. HBase runs on top of the Hadoop Distributed File System (HDFS), which allows it to be highly scalable, and it supports Hadoop's map-reduce programming model. HBase permits two types of access: random access of rows through their row keys and offline or batch access through map-reduce queries.

This article presented HBase, described its features and benefits, and briefly reviewed the importance of HBase row key design. And it concluded by showing you how to set up a local HBase environment, use the shell to create a table, insert data into that table, retrieve a specific row, and finally how to perform a table scan.

The next article, “Programming HBase with Java,” presents the programmatic interface to HBase and demonstrates how to interact with HBase using Java. The final article, “HBase Data Analysis with MapReduce,” in this three-part series reviews how to use map-reduce and programmatically interact with HBase in an offline/batch manner.

  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020