Tag Info

New answers tagged

0

The first thing to do is to look at the query cost and in particular what parts of it are costly. You may not have access to this information and getting it depends on the RDBMS. In the absence of that data try the following:- I'm guessing "personal" is your scratch area so the first obvious step is to index personal.New_HHS HHID. You should be able to ...


10

Combining resources is one way to potentially improve performance for a web site. Let's look, though, at what happens when we take this to the extreme hypothetical you pose. Size Savings? We can Base64 encode images and put them directly into an HTML document. The first problem, though, is that Base64 encoding a binary object increases its size by a factor ...


1

When the requirements or the market specifically asks for it. For example performance is a requirement in most financial applications because low latency is crucial. Depending on the nature of the traded instrument, optimization can go from using non-locking algorithms in a high-level language to using a low-level language and the even the extreme - ...


0

Most people would call optimization premature, if you're optimizing something that isn't resulting in a "soft failure" (it works but it's still useless) of the system due to performance. Real world examples. If my bubble sort takes 20ms to run, optimizing it to 1ms quicksort is not going to enhance the overall utility in any meaningful way despite being a ...


0

Writing a tiny C compiler is easy, if you don't care about the performance of the generated code. TinyCC (originally by F.Bellard, now here) is such a compiler: it compiles quite quickly C programs (perhaps with a compilation time 5 to 10 times faster than GCC ...) but the produced executable is very slow (often more than 3 times slower than what gcc -O2 ...



Top 50 recent answers are included