Home/ Questions/Q 54703
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-10T17:15:42+00:00

I have a tree of active record objects, something like: class Part < ActiveRecord::Base

  • 0

I have a tree of active record objects, something like:

class Part < ActiveRecord::Base   has_many :sub_parts, :class_name => 'Part'    def complicated_calculation     if sub_parts.size > 0       return self.sub_parts.inject(0){ |sum, current| sum + current.complicated_calculation }     else       sleep(1)       return rand(10000)     end   end  end

It is too costly to recalculate the complicated_calculation each time. So, I need a way to cache the value. However, if any part is changed, it needs to invalidate its cache and the cache of its parent, and grandparent, etc.

As a rough draft, I created a column to hold the cached calculation in the ‘parts’ table, but this smells a little rotten. It seems like there should be a cleaner way to cache the calculated values without stuffing them along side the ‘real’ columns.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

    1. You can stuff the actually cached values in the Rails cache (use memcached if you require that it be distributed).

    2. The tough bit is cache expiry, but cache expiry is uncommon, right? In that case, we can just loop over each of the parent objects in turn and zap its cache, too. I added some ActiveRecord magic to your class to make getting the parent objects simplicity itself — and you don’t even need to touch your database. Remember to call Part.sweep_complicated_cache(some_part) as appropriate in your code — you can put this in callbacks, etc, but I can’t add it for you because I don’t understand when complicated_calculation is changing.

      class Part < ActiveRecord::Base   has_many :sub_parts, :class_name => 'Part'   belongs_to :parent_part, :class_name => 'Part', :foreign_key => :part_id    @@MAX_PART_NESTING = 25 #pick any sanity-saving value    def complicated_calculation (...)     if cache.contains? [id, :complicated_calculation]       cache[ [id, :complicated_calculation] ]     else       cache[ [id, :complicated_calculation] ] = complicated_calculation_helper (...)     end   end    def complicated_calculation_helper     #your implementation goes here   end    def Part.sweep_complicated_cache(start_part)     level = 1  # keep track to prevent infinite loop in event there is a cycle in parts     current_part = self      cache[ [current_part.id, :complicated_calculation] ].delete     while ( (level <= 1 < @@MAX_PART_NESTING) && (current_part.parent_part)) {      current_part = current_part.parent_part)      cache[ [current_part.id, :complicated_calculation] ].delete     end   end end
    • 0