There's so much information about graph structures in this lil wikipedia snippet https://en.wikipedia.org/wiki/Semantic_triple …
Graph structures are the coolest; TIL a good way to store triples in KV is to have 6 indexes on your data. Which indexes? No clue yet.
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
not yet, but reading up on it we need a better model for choo
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
There is much wisdom in the old RDF work. Too bad it rushed headlong into the Dream That Was XML, and got smothered to death.
-
:( :( :( didn't know this, super sad buuu
- 4 more replies
New conversation -
-
-
3! = 6 indexes, ie all possible orderings of the triples
-
ie indexes are (src, typ) -> dst (typ, src) -> dst (src, dst) -> typ (dst, src) -> typ (dst, typ) -> src (typ, dst) -> src
End of conversation
New conversation -
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.