Brahms Medha Presentation 0918 Joshua Taylor Question 1

Question is for the Presentation: Brahms Medha Presentation 0918
Question is asked by: Joshua Taylor
The Question is: The authors seem to have built an RDF store for the sole purpose of discovering semantic associations (paths connecting resources), and their store does seem to be effective. However, their motivation stems from the difficulties that other, more general RDF stores had in achieving this task. Yet no pre-processing seems to have been performed on the RDF graphs. In their Future Work section, the authors state their intention "to experiment with a variety of semantic association discovery algorithsm, utilizing a language for defining regular paths … . The regular expressions defined over the RDF resources and types … will enable us to define the association paths of interesting patterns and significantly restrict the search space of the semantic association discovery." If only certain bits of the graph are interesting, and BRAHMs isn't a general-purpose RDF store, why not just throw out uninteresting triples? And if this approach can be taken, why not ease the burden of the other systems by only asking them to store the interesting triples. Perhaps graphs might then be small enough for them to store.

Question asked	The authors seem to have built an RDF stor … The authors seem to have built an RDF store for the sole purpose of discovering semantic associations (paths connecting resources), and their store does seem to be effective. However, their motivation stems from the difficulties that other, more general RDF stores had in achieving this task. Yet no pre-processing seems to have been performed on the RDF graphs. In their Future Work section, the authors state their intention "to experiment with a variety of semantic association discovery algorithsm, utilizing a language for defining regular paths … . The regular expressions defined over the RDF resources and types … will enable us to define the association paths of interesting patterns and significantly restrict the search space of the semantic association discovery." If only certain bits of the graph are interesting, and BRAHMs isn't a general-purpose RDF store, why not just throw out uninteresting triples? And if this approach can be taken, why not ease the burden of the other systems by only asking them to store the interesting triples. Perhaps graphs might then be small enough for them to store. ht then be small enough for them to store.
Question asked by	Joshua Taylor +
Question for the Presentation	Brahms Medha Presentation 0918 +