Re: Limitations of PostgreSQL

I have to admit, my thoughts on it were to build a query with case
statements in it and execute it. That sounds about like you're
proposing, right?

On Thu, 2005-10-13 at 11:30, Dean Gibson (DB Administrator) wrote:
> What's the point of a binary search if the list is small enough to fit
> on a line or two? And if a query can be substituted for N1-NN, you have
> to read all the values anyway, and then the function is trivially
> expressed as a normal query with no decrease in speed.
>
> -- Dean
> > On Wed, 2005-10-12 at 20:08, Michael Fuhr wrote:
> >
> >> Here's an excerpt from the MySQL documentation:
> >> INTERVAL(N,N1,N2,N3,...)
> >> Returns 0 if N < N1, 1 if N < N2 and so on or -1 if N is
> >> NULL. All arguments are treated as integers. It is required
> >> that N1 < N2 < N3 < ... < Nn for this function to work
> >> correctly. This is because a binary search is used (very fast).
> >>
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 1: if posting/reading through Usenet, please send an appropriate
> subscribe-nomail command to majordomo(at)postgresql(dot)org so that your
> message can get through to the mailing list cleanly