We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
Jacopo Urbani, Spyros Kotoulas, Eyal Oren, Frank v...
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
Graphs are a natural foundation for genome map databases. Mapping and other genomic data can be clearly represented by graphs, and graphs can be stored in a database. Graphs are d...
Mark Graves, Ellen R. Bergeman, Charles B. Lawrenc...