Foundations of semantic web databases

By Claudio Gutiérrez, Carlos A. Hurtado, Alberto O. Mendelzon, Jorge Pérez. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

342 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Introducing Time into RDF (2007, methodology): “Formal work in RDF from a database point of view includes the study of formal aspects of RDF data and query languages [14], [15], [27], considering RDF features like the entailment, presence of blank nodes, reification, premises in queries, and the RDFS vocabulary with predefined semantics.”
C-SPARQL: a Continuous Query Language for RDF Data Streams (2010, background): “Pervasive Computing is normally applied either to homogeneous large scale areas (e.g., forests, reefs, and glaciers) or, on the other hand, in small-scale ones (e.g., smart rooms and houses).”
Foundations of SPARQL query optimization (2008, methodology): “An engine that builds upon an RDFS inference engine thus may evaluate Qopt in place of Q. 0 Lemma 9 states only soundness of the SQO scheme for ANDonly queries.”
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary (2005, background): “In [6] it is also stated, without proof, that a simplified variant of RDFS entailment, which ignores the semantic conditions leading to infinite closures, is NP-complete.”
Binary RDF representation for publication and exchange (HDT) (2013, background): “We follow [47, 29] for graph notation, with”