Brahms GregoryToddWilliams Question1

From Semantic Portal Wiki

Jump to: navigation, search
  • Question is for the Presentation: Brahms Medha Presentation 0918
  • Question is asked by: Gregory Todd Williams
  • The Question is: Is the Brahms system meant only to answer association queries, or to answer association queries in conjunction with more general graph patterns? The comparison of Brahms to three systems implemented, in part, for general query answering (with the expressive power of SPARQL) seems a bit unfair. Brahms is implemented in a way so as to speed association queries while ignoring features of more general query languages. In contrast, the three systems it is compared to use techniques that speed SPARQL query execution, but dramatically slow down association queries. While this point of difference is legitimately made, a fairer comparison might have been made by, for example, removing the default compound indexes in Redland (which are never used in the association discover algorithms) at the same time as adding the new association-specific index. Such removal would have a direct affect on the memory usage tests presented in section 6.2 in which the "Redland, IDX" variant ran out of memory.
Facts about Brahms GregoryToddWilliams Question1RDF feed
Question askedIs the Brahms system meant only to answer Is the Brahms system meant only to answer association queries, or to answer association queries in conjunction with more general graph patterns? The comparison of Brahms to three systems implemented, in part, for general query answering (with the expressive power of SPARQL) seems a bit unfair. Brahms is implemented in a way so as to speed association queries while ignoring features of more general query languages. In contrast, the three systems it is compared to use techniques that speed SPARQL query execution, but dramatically slow down association queries. While this point of difference is legitimately made, a fairer comparison might have been made by, for example, removing the default compound indexes in Redland (which are never used in the association discover algorithms) at the same time as adding the new association-specific index. Such removal would have a direct affect on the memory usage tests presented in section 6.2 in which the "Redland, IDX" variant ran out of memory. "Redland, IDX" variant ran out of memory.
Question asked byGregory Todd Williams  +
Question for the PresentationBrahms Medha Presentation 0918  +
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance