Question

I’m attempting to use a similar Category implementation to this one in the Django Wiki. I’m wondering what the Django way of doing a search to pull all objects associated with a parent category. For example, if I have a category “TV” and it has subcategories “LED”, “LCD”, and “Plasma”, how would I be able to easily query for all TV’s without recursively going through all subcategories and subsubcategories (if there are any).

Code wise I was thinking something like:

class Item(models.Model):
   name = ...
   ...
   category = models.ForeignKey(Category, null=True, blank=True)

so with this type of implementation is there any easy way to do what I need, or is there any other better solution?

Thank you!

Answer 1

If you want to enforce strict categories and subcategories but also have the ability to perform fast searches with results like you describe, you may want to make a “tag” table where you don’t actually allow users to tag items themselves, but rather as soon as you assign a category to an item you fill in the tag table for that item with all the parent categories up to the root node of the category tree.

For example, if you have the following:
alt text http://img509.yfrog.com/img509/9845/photoho.jpg

The tag table would look something like:

   id   |   tag_name   |   tv_id
   1    |     "tv"     |     1
   2    |     "sd"     |     1    
   3    |     "crt"    |     1  
   4    |     "tv"     |     2  
   5    |     "HD"     |     2  
   6    |     "LCD"    |     2  
   7    |     "tv"     |     3  
   8    |     "HD"     |     3  
   9    |   "plasma"   |     3

Now your queryset will look like items=Item.objects.filter(tag='TV')