3 ms·
How you store your triples affects performance, but, conceptually, is only an implementation detail. But then, why stop at a KV-store? A set with entries “Bob:
by Someone 7y ago
How you store your triples affects performance, but, conceptually, is only an implementation detail.
But then, why stop at a KV-store? A set with entries “Bob:Knows:John” will work just as well, if you ignore performance.
But then, why stop at a set? A string “Bob:Knows:John;Bob:Loves:John;John;Is;vegetarian” works just as well (conceptually!)
IMO, a major real-life use case is as a means to produce PhD’s :-). The concept is enticing and easily grasped, but there are zillions of papers to write on query planning, automatic storage optimization, discovering heuristics, etc. It’s just like the early days of SQL: you don’t have to read decades of papers to move to the front of development.
- kd5bjo 7y agoUnless I’m missing something, the in-memory backend here appears to actually use the set solution: all of the triple fields are concatenated together and used as a dictionary key. Queries iterate through the dictionary entries until a sufficient number of results have been located. On the other hand, I’m not really familiar with Go, so I may be reading it wrong.