| Question asked
|
How good is O(G) complexity (w.r.t. large … How good is O(G) complexity (w.r.t. large amount of data)? What could the average case complexity be?
Casually: Can nSPARQL have a better representation? Isn't SPARQL (& SQL) very intuitive?
A thought: Some large repositories prefer performing reasoning and storing inferred data to speed up query answering. If NSPARQL works well we can avoid some redundancy such as storing: Tom is Human, when data contains Tom is Boy. m is Human, when data contains Tom is Boy.
|
