以我曲线图中,用户连接到许多项目,每个项目都被递归地分割成许多子项。由于我的项目有一个特定的顺序,我考虑这两个选项,我的数据模型:想法提高我AQL查询
现在我想创建一个查询检索中的两个级别定UserID。这AQL是我第一次尝试:
for itemId in (for b in board filter b._from == @_from sort b.order return b._to)
for item1 in (for t in item filter t._id == itemId return keep(t, '_id', 'title'))
return merge(item1, {board: (
for itemId2 in (for b in board filter b._from == item1._id sort b.order return b._to)
for t in item filter t._id == itemId2 return keep(t, '_id', 'title')
)})
的查询工作,它输出这样的结果:
[
{
"title": "item 1",
"_id": "item/41260117498",
"board": [
{
"title": "item 4",
"_id": "item/42205736442"
},
{
"title": "item 5",
"_id": "item/42208423418"
}
]
},
{
"title": "item 2",
"_id": "item/41260772858",
"board": []
},
{
"title": "item 3",
"_id": "item/41883233786",
"board": []
}
]
这很好,但我觉得我的查询是这样一个简单的穿越不必要的复杂性。请有人帮助我创造一个更好的吗?