if you really care about graph like data, geospacial indices within relational systems are probably one of the most interesting methods you could use to scale
i would love to see someone pull off a graph db equivalent using spacial indices in SQL. really wouldn't be that hard, could probs beat neo4j performance on high d recursion pretty easily
the reason this is important is bc mongo isn't particularly difficult to implement and i wouldn't call it a graph. frankly, it's just not that useful for scalable applications imo. i have not looked at urbit's yet implementation though so i can't judge
interesting that it's more like mongo than neo
Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.
1F8LZF7xb8a7aSnGV226bXECALFP9u8gsQ Verified