Federation and Navigation in SPARQL 1.1

DOI10.1007/978-3-642-33158-9_3zbMath1251.68085OpenAlexW146656899MaRDI QIDQ4647814

No author found.

Publication date: 8 November 2012

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-33158-9_3

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Internet topics (68M11)

Related Items (1)

SPARQL

Uses Software

• Jena
• nSPARQL
• XPath
• SPARQ2L

Cites Work

• The complexity of computing the permanent
• Rewriting of regular expressions and regular path queries
• More complicated questions about maxima and minima, and some closures of NP
• A very hard log-space counting class
• A taxonomy of complexity classes of functions
• Transition graphs and the star-height of regular events
• Finding Regular Simple Paths in Graph Databases
• Unnamed Item

This page was built for publication: Federation and Navigation in SPARQL 1.1