Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SemRank: ranking complex relationship search results on the semantic web
WWW '05 Proceedings of the 14th international conference on World Wide Web
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Proceedings of the 16th international conference on World Wide Web
Survey of graph database models
ACM Computing Surveys (CSUR)
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
SPARQLeR: Extended Sparql for Semantic Association Discovery
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Functions over RDF Language Elements
ISWC '09 Proceedings of the 8th International Semantic Web Conference
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
Query languages for graph databases
ACM SIGMOD Record
Hi-index | 0.00 |
RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet consensus in the Semantic Web community on how to define a query language for RDFS. In this paper, we introduce a language for querying RDFS data. This language is obtained by extending SPARQL with nested regular expressionsthat allow to navigatethrough an RDF graph with RDFS vocabulary. This language is expressive enough to answer SPARQL queries involving RDFS vocabulary, by directly traversing the input graph.