Relatree
Ego-Centric Indian Kinship Graph Engine with Graph-Relational EdgeDB
01.The Problem & Why Naive Implementations Fail
Indian family nomenclature (chacha, tau, mausi, bua, bhanja) cannot be calculated using flat generational math—it depends on birth order, gender of sibling links, and maternal vs. paternal routes.
02.Architectural Solution & Engineering Decisions
Built a graph-traversal algorithm computing exact cultural kinship titles from relationship paths. Enforced acyclicity (DAG) at the database layer with Gel 7 EdgeQL, implemented zero-SDK Argon2id auth, and reduced mobile animation tasks by 70%.
Key Architectural Highlights
Kinship Path Route Traversal
Algorithmic graph solver translating multi-hop relationship edges into accurate regional nomenclature based on generational steps and relative sibling birth orders.
DAG Acyclicity Mutation Guards
Database-level constraints preventing biological ancestry paradoxes and multi-parent cycles.
Mobile Island Boundary Profiling
Restructured island DOM boundaries and memoized layout geometry, slashing long animation tasks from 610ms to 179ms on low-power mobile devices.