Based on the book HBase The Definitive Guide

1. Hbase Key Design

2. Hbase, unlike RDBMS's has;
●
A data model basically a sorted, nested map of
maps
– there is no schema that constrains the list of
keys (relational table keys have fixed schema
and uniform for all rows)
– the value may itself be some complex structure
(can be another map)

3. *Does not store null values, all row keys and
column keys must be set.

5. Tall-Narrow Versus Flat-Wide Tables
●
HBase can only split at row boundaries
●
A single row could outgrow the maximum
file/region size and work against the region split
facility.
●
Better approach would be to divide the data
logically

7. Partial Key Scans
●
Specify start and end key
●
Can use date
●
Powerful mechanism (lexicographic order)
➢
Need to pad the values for fixed length
●
Can utilize Pagination
●
Drawback of composite keys: Atomicity
●
Not optimal for updates

8. Time Series Data

9. ●
Secondary Index(es)
●
Multiple secondary indexes can be emulated
by using multiple column families (not
recommended)

10. ●
Secondary Index(es)
●
Multiple secondary indexes can be emulated
by using multiple column families (not
recommended)