| Smalyshev added a comment. |
Or do clients just request any patterns they are interested in, and we generate and cache the response on the fly
Yes. Just as with SPARQL queries, only triple pattern queries are really really basic.
we would either need to cache a huge number of fragments to allow efficient queries.
Triple pattern queries should be very fast since they go directly against indexes and aren't supposed to require any calculations. We'll see of course if any performance issues arise.
I also don't quite see how fragments can be paged in the absence of a unique key
I'm not sure how paging is implemented internally. But again, since triple patterns are pretty much reading the index, I don't think it should be too problematic.
Cc: daniel, gerritbot, Aklapper, Zppix, Smalyshev, Ramalepe, Liugev6, EBjune, mschwarzer, Avner, Lewizho99, Maathavan, debt, Gehel, D3r1ck01, Jonas, FloNight, Xmlizer, Izno, jkroll, Wikidata-bugs, Jdouglas, aude, Deskana, Manybubbles, Mbch331
_______________________________________________ Wikidata-bugs mailing list [email protected] https://lists.wikimedia.org/mailman/listinfo/wikidata-bugs
