Featured post

3 Top Books Every Analytics Engineer to Read

Many of the analytics jobs nowadays are for the financial domain. The top financial domains are Banking, Payments, and credit cards. 
The Best Books are on:

The skills you need to work in data analytics are SAS, UNIX, Python, and JavaScript.  I have selected three books for beginners of data analysts. 

1. SAS best book 
I found one best book that is little SAS. This post covers almost all examples and critical macros you need for your job.

The best-selling Little SAS Book just got even better. Readers worldwide study this easy-to-follow book to help them learn the basics of SAS programming.

Now Rebecca Ottesen has teamed up with the original authors, Lora Delwiche, and Susan Slaughter, to provide a new way to challenge and improve your SAS skills through thought-provoking questions, exercises, and projects.
2. UNIX best book
The basic commands you will get everywhere. The way of executing Macros or shell scripts is really you need. This is a good book so that you can automate…

Oracle 12C 'Bitmap Index' benefits over B-tree Index

Oracle 12C 'Bitmap Index' benefits over B-tree Index
#Oracle 12C 'Bitmap Index' benefits over B-tree Index:
A bitmap index has a significantly different structure from a B-tree index in the leaf node of the index. It stores one string of bits for each possible value (the cardinality) of the column being indexed.

Note: One string of BITs means -Each tupple of possible value it assigns '1' bit in a string.So, all the BITs become a string ( This is an example, on which column you created BIT map index)

The length of the string of bits is the same as the number of rows in the table being indexed.

In addition to saving a tremendous amount of space compared to traditional indexes, a bitmap index can provide dramatic improvements in response time because Oracle can quickly remove potential rows from a query containing multiple WHERE clauses long before the table itself needs to be accessed.

Multiple bitmaps can use logical AND and OR operations to determine which rows to access from the table.

Although you can use a bitmap index on any column in a table, it is most efficient when the column being indexed has a low cardinality, or number of distinct values.

For example, the GENDER column in the PERS table will be either NULL, M, or F. The bitmap index on the GENDER column will have only three bitmaps stored in the index. On the other hand, a bitmap index on the LAST_NAME column will have close to the same number of bitmap strings as rows in the table itself. The queries looking for a particular last name will most likely take less time if a full table scan is performed instead of using an index. In this case, a traditional B-tree non-unique index makes more sense.

A variation of bitmap indexes called bitmap join indexes creates a bitmap index on a table column that is frequently joined with one or more other tables on the same column. This provides tremendous benefits in a data warehouse environment where a bitmap join index is created on a fact table and one or more dimension tables, essentially pre-joining those tables and saving CPU and I/O resources when an actual join is performed.


Popular posts from this blog

Quick Comparison AWS Vs Azure Load Balancer

Hyperledger Fabric: 20 Real Interview Questions

10 Best Visualization Charts to Present data

JavaScript Vs JSON Top Differences