Sciweavers

Share
8 search results - page 1 / 2
» SPARQL beyond Subgraph Matching
Sort
View
SEMWEB
2010
Springer
9 years 5 months ago
SPARQL beyond Subgraph Matching
We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS,
Birte Glimm, Markus Krötzsch
EDBT
2016
ACM
40views Database» more  EDBT 2016»
4 years 3 months ago
Querying RDF Data Using A Multigraph-based Approach
RDF is a standard for the conceptual description of knowledge, and SPARQL is the query language conceived to query RDF data. The RDF data is cherished and exploited by various dom...
VLDB
2016
ACM
68views Database» more  VLDB 2016»
4 years 3 months ago
Processing SPARQL queries over distributed RDF graphs
We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a “partial evaluation and assembly” framework. Answering a SPA...
Peng Peng, Lei Zou, M. Tamer Özsu, Lei Chen 0...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
10 years 1 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
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...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
SEMWEB
2009
Springer
9 years 11 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
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...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
books