Distributed Graph Database Engine for Fraud Ring Detection
Custom memory-mapped vertex-edge graph store executing fast BFS/DFS traversal to detect cyclic money laundering and mule account clusters.
Project Overview
Engineered in C++ with memory-mapped files (mmap) and lock-free concurrency. Traverses complex financial transaction graphs in milliseconds to expose circular fund transfers, multi-hop shell company networks, and organized financial fraud rings.
Engineered in C++ with memory-mapped files (mmap) and lock-free concurrency. Traverses complex financial transaction graphs in milliseconds to expose circular fund transfers, multi-hop shell company networks, and organized financial fraud rings.
Custom memory-mapped vertex-edge graph store executing fast BFS/DFS traversal to detect cyclic money laundering and mule account clusters.
Core Project Objectives
Capture continuous analog/digital sensor readings with robust noise filtering and hardware calibration.