6 search results - page 1 / 2 » SPARQL beyond Subgraph Matching |
SEMWEB
2010
Springer
13 years 2 months ago
2010
Springer
We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS,
ISAAC
2007
Springer
13 years 10 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
SEMWEB
2009
Springer
13 years 9 months ago
2009
Springer
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
KDD
2006
ACM
14 years 4 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
CIKM
2011
Springer
12 years 4 months ago
2011
Springer
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...