unwind neo4j

當(dāng)Neo4j 2.1發(fā)布時(shí)，我們將擁有UNWIND子句，該子句使處理事物集合變得更加容易。

在我的有關(guān)創(chuàng)建鄰接矩陣的博客文章中，我們想要顯示按字母順序排列的前5個(gè)見(jiàn)面組中有多少人，然后檢查其他各組中有多少人。

沒(méi)有UNWIND子句，我們必須這樣做：

MATCH (g:Group) WITH g ORDER BY g.name LIMIT 5WITH COLLECT(id(g)) AS groupsMATCH (g1) WHERE id(g1) IN groups MATCH (g2) WHERE id(g2) IN groupsOPTIONAL MATCH path = (g1)<-[:MEMBER_OF]-()-[:MEMBER_OF]->(g2)RETURN g1.name, g2.name, CASE WHEN path is null THEN 0 ELSE COUNT(path) END AS overlap

在這里，我們獲得前5個(gè)組，將其ID放入集合中，然后通過(guò)背對(duì)背具有節(jié)點(diǎn)ID查找的MATCH來(lái)創(chuàng)建組的笛卡爾積。

如果不是在“組”中傳遞節(jié)點(diǎn)ID，而是傳遞節(jié)點(diǎn)，然后在MATCH步驟中使用節(jié)點(diǎn)ID，那么我們將進(jìn)行完整的節(jié)點(diǎn)掃描，隨著存儲(chǔ)的增長(zhǎng)，它變得非常慢。

例如，這個(gè)版本會(huì)很慢：

MATCH (g:Group) WITH g ORDER BY g.name LIMIT 5WITH COLLECT(g) AS groupsMATCH (g1) WHERE g1 IN groups MATCH (g2) WHERE g2 IN groupsOPTIONAL MATCH path = (g1)<-[:MEMBER_OF]-()-[:MEMBER_OF]->(g2)RETURN g1.name, g2.name, CASE WHEN path is null THEN 0 ELSE COUNT(path) END AS overlap

這是原始查詢的輸出：

+-------------------------------------------------------------------------------------------------------------+ | g1.name | g2.name | overlap | +-------------------------------------------------------------------------------------------------------------+ | "Big Data Developers in London" | "Big Data / Data Science / Data Analytics Jobs" | 17 | | "Big Data Jobs in London" | "Big Data London" | 190 | | "Big Data London" | "Big Data Developers in London" | 244 | | "Cassandra London" | "Big Data / Data Science / Data Analytics Jobs" | 16 | | "Big Data Jobs in London" | "Big Data Developers in London" | 52 | | "Cassandra London" | "Cassandra London" | 0 | | "Big Data London" | "Big Data / Data Science / Data Analytics Jobs" | 36 | | "Big Data London" | "Cassandra London" | 422 | | "Big Data Jobs in London" | "Big Data Jobs in London" | 0 | | "Big Data / Data Science / Data Analytics Jobs" | "Big Data / Data Science / Data Analytics Jobs" | 0 | | "Big Data Jobs in London" | "Cassandra London" | 74 | | "Big Data Developers in London" | "Big Data London" | 244 | | "Cassandra London" | "Big Data Jobs in London" | 74 | | "Cassandra London" | "Big Data London" | 422 | | "Big Data / Data Science / Data Analytics Jobs" | "Big Data London" | 36 | | "Big Data Jobs in London" | "Big Data / Data Science / Data Analytics Jobs" | 20 | | "Big Data Developers in London" | "Big Data Jobs in London" | 52 | | "Cassandra London" | "Big Data Developers in London" | 69 | | "Big Data / Data Science / Data Analytics Jobs" | "Big Data Jobs in London" | 20 | | "Big Data Developers in London" | "Big Data Developers in London" | 0 | | "Big Data Developers in London" | "Cassandra London" | 69 | | "Big Data / Data Science / Data Analytics Jobs" | "Big Data Developers in London" | 17 | | "Big Data London" | "Big Data Jobs in London" | 190 | | "Big Data / Data Science / Data Analytics Jobs" | "Cassandra London" | 16 | | "Big Data London" | "Big Data London" | 0 | +-------------------------------------------------------------------------------------------------------------+ 25 rows

如果使用UNWIND，則不再需要傳遞節(jié)點(diǎn)ID，而是可以將節(jié)點(diǎn)收集到一個(gè)集合中，然后將其分解為笛卡爾積：

MATCH (g:Group) WITH g ORDER BY g.name LIMIT 5WITH COLLECT(g) AS groupsUNWIND groups AS g1 UNWIND groups AS g2OPTIONAL MATCH path = (g1)<-[:MEMBER_OF]-()-[:MEMBER_OF]->(g2)RETURN g1.name, g2.name, CASE WHEN path is null THEN 0 ELSE COUNT(path) END AS overlap

沒(méi)有明顯更少的代碼，但是我認(rèn)為使用UNWIND可以使查詢的意圖更加清晰。

我很期待看到2.1是GA時(shí)UNWIND人員的創(chuàng)新用途。

翻譯自: https://www.javacodegeeks.com/2014/06/neo4j-2-1-passing-around-node-ids-vs-unwind.html

unwind neo4j

總結(jié)

以上是生活随笔為你收集整理的unwind neo4j_Neo4j 2.1：传递节点ID与UNWIND的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。