v0.6.1

Highlights — performance

Existential and set-membership queries now scale regardless of how the pattern was written (a forward-written NOT EXISTS previously timed out / OOM'd on a large graph). All changes are internal and behavior-preserving.

• Bound-endpoint anchoring. (x)-[:R]->(d) with d bound now traverses from d via the incoming cache instead of scanning every node.
• HashSet-backed DISTINCT and IN. O(n) dedup and O(1) membership, replacing O(n²) / O(n) scans.
• WHERE pushdown. Single-variable predicates prune the candidate scan before expansion.