Explain the storage mechanisms of HBase. Differentiate HBase with RDBMS.

 STORAGE MECHANISM IN HBASE

HBase is a column-oriented database, with tables ordered by row. Only column families, which are key-value pairs, are defined in the table structure. A table contains many columns families, each of which can include any number of columns. Subsequent column values are saved on the disk in a logical order. A timestamp is associated with each cell value in the table.

In a nutshell, in an HBase:

  • The table is a collection of rows.
  • The row is a collection of column families.
  • A Column family is a collection of columns. 
  • The column is a collection of key-value pairs.


An example schema of a table in HBase is provided below.



Difference between HBase and RDBMS.

HBase

  • HBase is schema-less, it does not have the concept of fixed columns schema; defines only column families.
  • It is built for wide tables. HBase is horizontally scalable.
  • No transactions are there in HBase.
  • It has de-normalized data.
  • It is good for semi-structured as well as structured data.


RDBMS

  • An RDBMS is governed by its schema, which describes the whole structure of tables.
  • It is thin and built for small tables. Hard to scale.
  • RDBMS is transactional.
  • It will have normalized data.
  • It is good for structured data.

Comments

Popular posts from this blog

Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?

Suppose that a data warehouse consists of the four dimensions; date, spectator, location, and game, and the two measures, count and charge, where charge is the fee that a spectator pays when watching a game on a given date. Spectators may be students, adults, or seniors, with each category having its own charge rate. a) Draw a star schema diagram for the data b) Starting with the base cuboid [date; spectator; location; game], what specific OLAP operations should perform in order to list the total charge paid by student spectators at GM Place in 2004?

Explain network topology .Explain tis types with its advantages and disadvantges.