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

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...
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 i...
Post a Comment
Read more

Bitmap index

Bitmap index is one of the index types that is supported by oracle. Unlike B*tree index, this is very compressed index. It means if I create a bitmap index on a column, then the generated index table will be smaller when compared the index table which is generated by the binary index on the same column. The reason is, in bitmap index, ROWIDs won’t be stored in the index table, instead index values will be mapped against bitmaps. Bitmap is nothing but it stores either of this values, 1(Match) or 0(No Match). For each distinct values in the column, a separate index record will be created. Unlike b*tree index, bitmap index can accept NULL and it creates separate index entry for this. Bitmap index will work better if number of distinct values are relatively less when compared to the total number of records. Why is it referred as “relatively less”? this index will work fine if table of 1,000,000,000 records contains 5000 distinct values and if table of 1,000 records contains 5 distinct va...
Post a Comment
Read more