Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Curious, since you seem to have experience with both graph and relational databases (and I have not really worked much with the former)... if I had a graph where I just want to compute the shortest weighted path between two nodes, which model would suit better and how much difference would it make in terms of performance?


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: