Graph exploration - #1926
Draft
apognu wants to merge 11 commits into
Draft
Conversation
apognu
force-pushed
the
feat/graph-walking-v2
branch
from
August 11, 2026 09:23
8e2a93f to
0ca59e4
Compare
apognu
force-pushed
the
feat/graph-walking-v2
branch
8 times, most recently
from
August 18, 2026 17:23
cf72a15 to
556c396
Compare
apognu
force-pushed
the
feat/graph-walking-v2
branch
from
August 26, 2026 10:58
33cbe88 to
77b9eda
Compare
Same-field relation traversal can now be completely disabled (useful for a simple graph) or configured to only walk specific configurations.
Labels are not added to regular nodes to reduce round-trips with the frontend. Also, edges now carry details on what they represent: - For node-to-node edges, it shows which tables were traversed and contracted connect the two nodes. - For match connectors, it shows which tables were followed through link, as well as the field that matched.
apognu
force-pushed
the
feat/graph-walking-v2
branch
from
August 27, 2026 12:39
77b9eda to
df23724
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This adds the ability to explore the network of connections around a party, account, or transaction — across all of an organization's ingested data — without manually cross-referencing tables by hand.
Same-field relations (new configuration). Organizations can now declare that two fields on two different tables represent the same real-world value, even when there's no formal link between them — for example, two accounts sharing an IBAN, or two logins sharing an IP address. This is pure configuration; it doesn't touch or move any data, it just tells the system which shared values are meaningful.
Adjacency index (background worker). A periodic per-organization job rebuilds an internal index of which records share which values, combining the data model's existing relationships with the newly configured same-field relations. The index is rebuilt in the background and swapped in atomically, so live queries are never blocked or slowed down during a rebuild.
Graph walk. Starting from a chosen record, the system explores outward for a configurable number of degrees (2 by default, up to 5, a degree usually covers multiple hops), following both existing relationships and same-field matches in either direction. Instead of dumping every intermediate record it passes through, it collapses the result down to the meaningful end points (parties, by default) and explains why they're connected — e.g. "these two parties share the same IBAN" or "this party's account sent money to that one." If a shared value turns out to be extremely common (e.g. a generic identifier shared by thousands of records), it's reported as a capped, approximate count instead of being expanded in full, to keep results fast and readable.