Suppose you have a huge table which has say 30-40 columns and you want to select all of them or most of them say around 30 columns. It is a tedious job to type each of the column names. Here is a quick way to get a comma separated list of all the column...

Suppose you have a huge table which has say 30-40 columns and you want to select all of them or most of them say around 30 columns. It is a tedious job to type each of the column names. Here is a quick way to get a comma separated list of all the column...

Suppose you have a huge table which has say 30-40 columns and you want to select all of them or most of them say around 30 columns. It is a tedious job to type each of the column names. Here is a quick way to get a comma separated list of all the column...

Suppose you have a huge table which has say 30-40 columns and you want to select all of them or most of them say around 30 columns. It is a tedious job to type each of the column names. Here is a quick way to get a comma separated list of all the column...

Suppose you have a huge table which has say 30-40 columns and you want to select all of them or most of them say around 30 columns. It is a tedious job to type each of the column names. Here is a quick way to get a comma separated list of all the columns w

We all know that, in index seek, it will use B-Tree traversal technique to reach the leaf page. Once it reaches leaf page, if that page has many records, it will not traverse all records and verify. Instead it will use linear regression or binary search...

We all know that, in index seek, it will use B-Tree traversal technique to reach the leaf page. Once it reaches leaf page, if that page has many records, it will not traverse all records and verify. Instead it will use linear regression or binary search...

We all know that, in index seek, it will use B-Tree traversal technique to reach the leaf page. Once it reaches leaf page, if that page has many records, it will not traverse all records and verify. Instead it will use linear regression or binary search...

We all know that, in index seek, it will use B-Tree traversal technique to reach the leaf page. Once it reaches leaf page, if that page has many records, it will not traverse all records and verify. Instead it will use linear regression or binary search...

We all know that, in index seek, it will use B-Tree traversal technique to reach the leaf page. Once it reaches leaf page, if that page has many records, it will not traverse all records and verify. Instead it will use linear regression or binary search te