We have an algorithm that compare ruby objects coming from MongoDB. The majority of the time spent, it taking the results (~1000), assigning a weight to them, and comparing them to a base object. This process takes ~2 sec for 1000 objects. Afterwards, we order the objects by the weight, and take the top 10.
Given that the number of initial matches will continue to grow, I’m looking for more efficient ways to compare and sort matches in Ruby.
I know this is kind of vague, but let’s assume they are User objects that have arrays of data about the person and we’re comparing them to a single user to find the best match for that user.
Have you considered storing/caching the weight? This works well if the weight depends only on the attributes of each user and not on values external to that user.
Also, how complex is the calculation involving the weight associated with a user and the “base” user? If it’s complex you may want to consider using a graph database, which can store data that is specific to the relation between 2 nodes/objects.