5a2eaacd4d
Previous query chained 6 OPTIONAL MATCH clauses for edges with no
intervening WITH collect(), producing a cartesian product. At 6 pages
(~60 elements, ~300 edges) Neo4j hit 102% CPU and hung > 5min.
Rewritten with one CALL {} subquery per node/edge type: each block
returns a single row with its collected list — no multiplication across
types. 6-page doc now returns in 213ms (was: no return).
Python reshape code (queries.py:137-210) untouched — record keys and
edge map shape preserved.
Refs: https://neo4j.com/developer/kb/using-subqueries-to-control-the-scope-of-aggregations/
|
||
|---|---|---|
| .. | ||
| __init__.py | ||
| chunk_writer.py | ||
| driver.py | ||
| queries.py | ||
| schema.py | ||
| tree_reader.py | ||
| tree_writer.py | ||