the problem I have is that userid's are not just sequential from
1:n_users. if they were, of course I'd have made a big matrix that was
n_users x n_fields and that would be that. but, I think what I cando is
just use the hash to store the index into the result matrix, nothing
more. then the rest
i wish it were that simple. unfortunately the logic i have to do on
each transaction is substantially more complicated, and involves
referencing the existing values of the user table through a number of
conditions.
any other thoughts on how to get better-than-linear performance time?
is
__
R-help@stat.math.ethz.ch mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
