so I wouldn't have to touch the disk. Am I right about
that?
On 3/31/11 8:29 AM, Gregory Magarshak wrote:
Thanks for your insight! But I'm still worried about the performance
of IN ( big list of values ). Can you tell me how it is implemented?
Suppose I have SELECT a FROM b WHERE c I
ta.
A severe & unfortunate constraint. Can't help you there.
PB
-
On 3/29/2011 1:27 PM, Gregory Magarshak wrote:
Yes, this would be fine. But often, the list of friends is obtained
from a social network like facebook, and is not stored internally.
Basically, I obtain the frien
E binary search, because the
entries have been sorted in ascending order.
Does MySQL have something like this? And if not, perhaps you can
add it in the next version? It would really boost MySQL's support for
social networking apps tremendously. Alternative, how can I add this
to my MySQL? Any
have been
sorted in ascending order.
Does MySQL have something like this? And if not, perhaps you can
add it in the next version? It would really boost MySQL's support for
social networking apps tremendously. Alternative, how can I add this to
my MySQL? Any advice would be appreciat
