Foundations of RDF Databases

DOI10.1007/978-3-642-03754-2_4zbMath1254.68104OpenAlexW1618147311MaRDI QIDQ3638999

No author found.

Publication date: 28 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03754-2_4

Mathematics Subject Classification ID

Database theory (68P15) Internet topics (68M11)

Related Items (5)

What about Constraints in RDF? ⋮ Evaluation of RDF queries via equivalence ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ Fuzzy data modeling and algebraic operations in RDF ⋮ Answer Set Programming: A Primer

Uses Software

• foaf
• SPARQL
• nSPARQL
• XPath
• SPARQ2L

Cites Work

• Foundations of semantic web databases
• Rewriting of regular expressions and regular path queries
• Database relations with null values
• Incomplete Information in Relational Databases
• Reachability logic: an efficient fragment of transitive closure logic
• Finding Regular Simple Paths in Graph Databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Foundations of RDF Databases