Skip to main content

Introduction to the world of blogging

Hi all,

This is my first post for the world of blogging, so I like to introduce myself first. I belong to a family of soldiers and farmers, so I am deeply related to the roots of our Indian culture. I love playing with internet, either it is some freaking PC game or world wide web, I always enjoy sitting in front of my laptop.

My laptop is my baby, and best friend of mine, when its connected with the world. I love playing all kind of flash games. Without Google and Yahoo, internet will be nothing. Yeah, Facebook made a considerable growth in the world of internet. Trying to get the business from the Google. But, its none of my business, I still love Google and Internet and enjoy Google tools. Yahoo Messenger is my favorite time pass these days.

Working with Oracle on a Finance Project, don't want to mention much about the project here, as its against the company norms. But love playing with Java and Hibernate, and always keen to implement new ideas which help the banking world to bring some new changes in the current banking world.

Through this blog, I would like to express myself and my views about the technology. But these machines are developed by machines and these machines are ruling the humans, kinda interesting na. New generation will be surely going to be slave of these machines, so we need to utilize them sensibly.

In case, any off my readers don't agree with my views, please raise them. I will think for sure. I opted to write here, because I used to waste whole lot of time in nonsense activities. So, want to make maximum out of the time in which I don't do anything.

Labels:

Comments

Post a Comment

Popular posts from this blog

B*Tree Reverse index

B*Tree Reverse index is one of the index types that is supported by oracle. It more or less behaves like b*tree unique & non-unique index but only difference is the way it constructs the tree. In this index, index value is stored in the reverse direction when compared to the values in the actual data table. This index is used in order to distribute the index data evenly across all the leaf index nodes if table data is skewed very high. Like b*tree index, this index doesn’t understand NULL. This B*Tree Reverse index can be created on a single column or more than one column. More than one B*Tree Reverse index can be created for the same data table. HOW TO VERIFY: How to verify whether the created index is reverse index or not? Fire this query, select index_type from user_indexes where index_name = 'DEPT_ID_INDX' ð   This query would return “ NORMAL/REV ” (it means it is B*Tree index but of “Reverse” type) LITTLE-KNOWN FACTS TO BE REMEMBERED: ·          If this B*Tree Reve
Post a Comment
Read more

Nested Loop Outer Join

Before we go into this topic in detail, first we will understand what outer join is meant by. For an example, take 2 tables which have to be joined, say “Parent” table & “Child” table [I have taken these table names, only to discuss this topic in an easy way]. If Child table is outer joined with Parent table, then you can say, the matching records from both these tables will be retrieved and then the records which are available only in Parent table will also be retrieved though the corresponding matching records are not available in Child table. This is called outer join. [in natural or equi-join, only the matching records from both the tables will be retrieved.] To perform this outer join, 3 different join techniques have been provided by oracle. ·          Nested loop outer join ·          Hash outer join ·          Sort merge outer join In this, we will discuss about nested loop outer join. To perform this nested loop outer join, Oracle follows these steps (assume, child ta
Post a Comment
Read more

Index Fast Full Scan

Index Fast Full Scan is one of the index access methods supported by Oracle. Index Fast Full Scan is otherwise called as Fast Full Index Scan also. Index Fast Full Scan can be imposed by Oracle Optimizer only in the certain scenario. The scenario where this index would be invoked is, Whenever the Oracle SQL optimizer detects that the query is serviceable without touching table rows, Oracle invokes this fast full index scan and quickly reads every block of the index without touching the table itself provided that query doesn’t contain any ORDER BY clause. The definition for this scan is more or less similar to the index full scan but the only difference is that former  will be invoked when ORDER BY clause is not mentioned in the query. It differs from the index full scan in another way where output won’t be in the sorted order since ORDER BY clause is not mentioned. If Oracle detects the query is serviceable without touching the table rows, it means, all the columns mentioned in th
Post a Comment
Read more