HBase Vs RDBMS

-

HBase and RDBMS

HBaseRDBMS
HBase is schema-less, it doesn't have the concept of fixed columns schema; defines only column families.An RDBMS is governed by its schema, which describes the whole structure of tables.
It is built for wide tables. HBase is horizontally scalable.It is thin and built for small tables. Hard to scale.
No transactions are there in HBase.RDBMS is transactional.
It has de-normalized data.It will have normalized data.
It is good for semi-structured as well as structured data.It is good for structured data.

Comments

Post a Comment

Popular posts from this blog

Hadoop Comand

-
Syntax     :   hadoop fsck / COMMAND_OPTION Description path Start checking from this path. -delete Delete corrupted files. -files Print out files being checked. -files   -blocks Print out the block report -files   -blocks   -locations Print out locations for every block. -files   -blocks   -racks Print out network topology for data-node locations. -includeSnapshots Include snapshot data if the given path indicates a snapshottable directory or there are snapshottable directories under it. -list-corruptfileblocks Print out list of missing blocks and files they belong to. -move Move corrupted files to /lost+found. -openforwrite Print out files opened for write.   HDFS support...
Read more

Find the largest sum contiguous subarray.

-
Given an array of positive and negative integer s, find a contiguous subarray whose sum (sum of elements) is maximized. · Maximum subarray in an array is found in a single scan. We keep track of global maximum sum so far and the maximum sum, which include the current element. · When we find global maximum value so far is less than the maximum value containing current value we update the global maximum value. · Finally return the global maximum value.Concept of Stack A stack is a memory in which values are stored and retrieved in “last in firs import java.util.*; class SumOfArray { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println("enter size of Array"); int a=s.nextInt(); int[] arr=new int[a]; System.out.println("enter element of Array"); for(int i=0;i<a;i++) {                 arr[i]=s.nextInt(); }         System.out.println("Max sub...
Read more

Hive Vs Pig

-
Differences between Hive and Pig: Hive Pig 1.Hive is declarative language works on HiveQL(HQL) which is similar to SQL. 1.Pig is procedural language. Works on Pig Latin 2.Used by data analytics people 2.Used by Researchers, and programmers. 3.Works only on structured data. 3.Works on structured, semi structured and unstructured data . 4.Hive operates on server side of the cluster. 4.Pig operates on Client side of the cluster. 5.Supports partitioning of data. 5.Doesnot support partitioning. 6.Doesnot load the data quickly   but executes quickly 6.Loads the data quickly and effectively 7.Has separate metadata database on HDFS. 7.Doesnot have separate metadata database.Uses HDFS as its database. 8.Hive    was first developed by facebook 8.Pig was first developed by ...
Read more