Skip to content

docs: add future work section to 0.11.0 release post #819

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
james-willis merged 2 commits into from
Mar 31, 2026
Merged

docs: add future work section to 0.11.0 release post #819

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3ad42c5
docs: add future work section to 0.11.0 release blog post
james-willis Mar 31, 2026
4cb9004
docs: add AggregateNeighbors and random walk variants to future work
james-willis Mar 31, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions docs/src/05-blog/997-graphframes-011-release.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -164,3 +164,10 @@ A new `AggregateNeighbors` class implements multi-hop breadth-first traversal wi
- **Undirected fixed-length patterns**: `(u)-[*2]-(v)`
- **Chaining with fixed-length patterns** now works correctly

## Future work

- **GQL query engine**: `PropertyGraphFrame` already carries full schema information — which vertex groups exist, which edge groups connect them, and how. This is exactly the metadata a query engine needs. A planned next step is to add a [GQL (ISO/IEC 39075)](https://www.iso.org/standard/76120.html) subset query engine on top of PGF that compiles `MATCH` statements into optimized Spark DataFrame join plans.
- **`GraphFrame.reverse()`**: a convenience method to reverse edge directions by swapping `src` and `dst` columns, useful for computing in-degree centralities, reverse reachability, and transpose-based algorithms like Kosaraju's strongly connected components.
- **Aggregate Neighbors algorithms**: new graph algorithms built on top of the `AggregateNeighbors` API, such as all-paths computation.
- **Random walk variants**: additional random walk implementations including weighted random walks and temporal random walks.

Comment thread
SemyonSinchenko marked this conversation as resolved.
Loading