January 24, 2007

Designing High Performance Stored Procedures

anaging large amounts of data is always a challenge. Several major database vendors claim that their database engines are ready for terabytes of data, which is true to a certain extent. However, when those terabytes are not static data, but live information that people update constantly, search on, report from,

Find Common Denominators in C++

The functions in this tip find the greatest common divisor (GCD) or the least common multiple (LCM) of two given integers. Getting the GCD through recursion: int GCD(int x,int y) { if(y==0) // base case, the programs stops if y reaches 0. return x; //it returns the GCD else return