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.

Comments

Popular posts from this blog

Listener refused the connection due to NetExcepti​on

I was testing some piece of code for calculation of new date on the basis of a given pattern and the specified date. I wrote a method to automate the test cases to generates those patterns and calculate the new date for each date of the specified date of the range of years. Since there were around 1 million pattern test cases are possible, so I want to insert this data in database for any future reference. After creating a pattern I was inserting data of the pattern and the calculation date along with the calculated date. It was working fine. I was prepare to hit the start button now, after testing different patterns individually. I hit the run button and it started its executions, but in the middle, I got this error. java.sql.SQLException: Listener refused the connection with the following error:ORA-12516, TNS:listener could not find available handler with matching protocol stack       at oracle.jdbc.driver.T4CConnection.logon(T4CConnection.java:4...

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: ·      ...

Hash Natural Join

To perform hash join, Oracle follows these steps: 1.      Oracle chooses the smallest of two tables as the hash table (otherwise called as driving table). Oracle built the hash table in RAM after applying the hash function on the joining column(s) of the driving table. 2.      Oracle chooses the other [big] table as the probe table (otherwise called as driven table or probing table). It traverse through all the records of this probe table, applies the same hash function on the joining column(s) [column(s) used to join these two tables] and will hit the corresponding entry in the hash table. 3.      Oracle returns the output if a record from driving table is already present in the same hash key, else no record will be returned. It may look like Nested loop join & Hash join have the same architecture since both these have the concept of driving & driven tables but they have entirely different design if you closely look a...