Sciweavers

477 search results - page 32 / 96
» Storing RDF as a Graph
Sort
View
SEMWEB
2009
Springer
14 years 4 months ago
Scalable Distributed Reasoning Using MapReduce
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...
ASUNAM
2011
IEEE
12 years 10 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—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...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
CADE
2012
Springer
12 years 8 days ago
SPARQL Query Containment under RDFS Entailment Regime
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...
Melisachew Wudage Chekol, Jérôme Euze...
WWW
2008
ACM
14 years 10 months ago
SPARQL basic graph pattern optimization using selectivity estimation
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, ...
HICSS
1995
IEEE
82views Biometrics» more  HICSS 1995»
14 years 1 months ago
A graph-theoretic data model for genome mapping databases
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...