我有一个类别模型是MPTT模型。这是M2M,以集团和我需要序列树与相关罪名,想象我的类别树是这样的:Django MPTT高效地将关系数据序列化为DRF
Root (related to 1 group)
- Branch (related to 2 groups)
- Leaf (related to 3 groups)
...
所以串行输出应该是这样的:
{
id: 1,
name: 'root1',
full_name: 'root1',
group_count: 6,
children: [
{
id: 2,
name: 'branch1',
full_name: 'root1 - branch1',
group_count: 5,
children: [
{
id: 3,
name: 'leaf1',
full_name: 'root1 - branch1 - leaf1',
group_count: 3,
children: []
}]
}]
}
这是我现在的超级低效的实现:
型号
class Category(MPTTModel):
name = ...
parent = ... (related_name='children')
def get_full_name(self):
names = self.get_ancestors(include_self=True).values('name')
full_name = ' - '.join(map(lambda x: x['name'], names))
return full_name
def get_group_count(self):
cats = self.get_descendants(include_self=True)
return Group.objects.filter(categories__in=cats).count()
查看
class CategoryViewSet(ModelViewSet):
def list(self, request):
tree = cache_tree_children(Category.objects.filter(level=0))
serializer = CategorySerializer(tree, many=True)
return Response(serializer.data)
串行
class RecursiveField(serializers.Serializer):
def to_native(self, value):
return self.parent.to_native(value)
class CategorySerializer(serializers.ModelSerializer):
children = RecursiveField(many=True, required=False)
full_name = serializers.Field(source='get_full_name')
group_count = serializers.Field(source='get_group_count')
class Meta:
model = Category
fields = ('id', 'name', 'children', 'full_name', 'group_count')
这工作,但也碰到DB与查询的疯狂数量,也有更多的关系,不只是集团。有没有办法让这个效率更高?我如何编写我自己的序列化程序?
谢谢详细的序列化方法!我希望那些制作MPTT的巫师在N + 1问题上有一个解决方案来计算:( – WBC 2014-11-24 17:41:30