Foundations of semantic web databases
From MaRDI portal
Publication:532369
DOI10.1016/j.jcss.2010.04.009zbMath1215.68091OpenAlexW4213246264MaRDI QIDQ532369
Publication date: 4 May 2011
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.04.009
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Internet topics (68M11)
Related Items (6)
Querying incomplete information in RDF with SPARQL ⋮ Querying Regular Graph Patterns ⋮ Constraints in RDF ⋮ Foundations of RDF Databases ⋮ Calculi for symmetric queries ⋮ A formal model of semantic computing
Uses Software
Cites Work
- The core of a graph
- Conjunctive query containment revisited
- Data exchange: getting to the core
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- When is the evaluation of conjunctive queries tractable?
- The Transitive Reduction of a Directed Graph
- Normal forms for connectedness in categories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Foundations of semantic web databases