Skip to content

Graph exploration - #1926

Draft
apognu wants to merge 11 commits into
mainfrom
feat/graph-walking-v2
Draft

Graph exploration#1926
apognu wants to merge 11 commits into
mainfrom
feat/graph-walking-v2

Conversation

@apognu

@apognu apognu commented Aug 11, 2026

Copy link
Copy Markdown
Collaborator

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.

@apognu apognu self-assigned this Aug 11, 2026
@apognu apognu added enhancement New feature or request WIP go Pull requests that update Go code do-not-merge labels Aug 11, 2026
@apognu
apognu force-pushed the feat/graph-walking-v2 branch from 8e2a93f to 0ca59e4 Compare August 11, 2026 09:23
@apognu apognu changed the title Feat/graph walking v2 Graph exploration Aug 11, 2026
@apognu
apognu force-pushed the feat/graph-walking-v2 branch 8 times, most recently from cf72a15 to 556c396 Compare August 18, 2026 17:23
@apognu
apognu force-pushed the feat/graph-walking-v2 branch from 33cbe88 to 77b9eda Compare August 26, 2026 10:58
apognu added 10 commits August 27, 2026 14:39
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
apognu force-pushed the feat/graph-walking-v2 branch from 77b9eda to df23724 Compare August 27, 2026 12:39
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

do-not-merge enhancement New feature or request go Pull requests that update Go code WIP

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant