For NSPARQL Jesse Weaver 20080911 1
From Semantic Portal Wiki
- Question is for the Presentation: NSPARQL Jesse Weaver 20080911
- Question is asked by: Ankesh Khandelwal
- The Question is: 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.
Facts about For NSPARQL Jesse Weaver 20080911 1RDF feed
| 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. |
| Question asked by | Ankesh Khandelwal + |
| Question for the Presentation | NSPARQL Jesse Weaver 20080911 + |
