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!
Assuming you're using the
Category
model the same way it's being used on the page you referenced, it would seem that a category 'TV' would be aCategory
instance with a nullparent
, and 'Plasma' & 'LCD' would beCategory
instances with the 'TV' category as a parent.Create some items
Get the Item queryset
or
Does this look like it's in the ballpark of what you need?
If you are using django-categories, which uses MPTT then you can do the following:
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:
Now your queryset will look like
items=Item.objects.filter(tag='TV')