I’ve translated the graph database examples given by Stanford’s Jennifer Widom into Prolog on Swish, bringing a series of notes I’ve done while redoing her online course to 3.
This exercise has reinforced my prejudice against the myriad of NoSQL graph database systems hyped by Facebook et all (admittedly rooted in me not bothering to learn any of them) for two reasons:
- Plain vanilla SQL handles graph databases perfectly, though the
with recursive base select case union recursive select casepattern isn’t easy to read or write.
- Prolog shines at these problems – at least I hope my translations of Widom’s SQL examples show that.
As always, suggestions for improvements are welcome.