Ruby on Rails

On 2 December 2010 06:28, Fearless Fool <lists@ruby-forum.com> wrote:
> I need to store a set of relatively complex objects in the db -- in my
> case, these are discrete cumulative distribution functions: they take a
> long time to construct, but I want the lookup to be fast.  Since the
> lookup is essentially a binary search, a B-Tree or some variant would be
> a sensible data structure.
>
> Thoughts?

I've an inkling this is out of my comfort zone, but my initial
thoughts (feel free to totally disregard...) are:

a) serialize? or is that what you meant by storing a "YAML'd B-Tree"?
b) if these are complex objects that need to be stored in the DB, can
you not use a DB designed to store complex objects (like Mongo)?
c) Marnen's nested set sounds like a potential good solution too
(given what I think I understand from your description...)

--
You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group.
To post to this group, send email to rubyonrails-talk@googlegroups.com.
To unsubscribe from this group, send email to rubyonrails-talk+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/rubyonrails-talk?hl=en.