## Storing Images in DB – Yea or Nay?

I’m in charge of some applications that manage many TB of images. We’ve found that storing file paths in the database to be best. There are a couple of issues: database storage is usually more expensive than file system storage you can super-accelerate file system access with standard off the shelf products for example, many web servers …

## Difference between user-level and kernel-supported threads?

Edit: The question was a little confusing, so I’m answering it two different ways. OS-level threads vs Green Threads For clarity, I usually say “OS-level threads” or “native threads” instead of “Kernel-level threads” (which I confused with “kernel threads” in my original answer below.) OS-level threads are created and managed by the OS. Most languages …

## Naive Bayes vs. SVM for classifying text data

The biggest difference between the models you’re building from a “features” point of view is that Naive Bayes treats them as independent, whereas SVM looks at the interactions between them to a certain degree, as long as you’re using a non-linear kernel (Gaussian, rbf, poly etc.). So if you have interactions, and, given your problem, …

## Asymptotic Notation – does n (log n) (log n) simplify?

Here’s a proof by contradiction: Let’s say that a function f(n) = n(log n)(log n). Assume that we think it’s also Θ(n log n), theta(n log n), so in other words there is an a for which f(n) <= a * n log n holds for large n. Now consider f(2^(a+1)): f(2^(a+1)) = 2^(a+1) * log(2^(a+1)) * log(2^(a+1)) = 2^(a+1) * log(2^(a+1)) * (a+1), …

## what does driver program mean?

In this context a driver program is just a program that uses the class or algorithm that you’re developing. It’s primarily used for testing your code while you develop it.

## What is a database transaction?

Can someone provide a straightforward (but not simpler than possible) explanation of a transaction as applied to computing (even if copied from Wikipedia)?

## What is Turing Complete?

Here’s the briefest explanation: A Turing Complete system means a system in which a program can be written that will find an answer (although with no guarantees regarding runtime or memory). So, if somebody says “my new thing is Turing Complete” that means in principle (although often not in practice) it could be used to …