Name
Abstract | ||
|---|---|---|
Navigational graph queries are an important class of queries that can extract implicit binary relations over the nodes of input graphs. Most of the navigational query languages used in the RDF community, e.g. property paths in W3C SPARQL 1.1 and nested regular expressions in nSPARQL, are based on the regular expressions. It is known that regular expressions have limited expressivity; for instance, some natural queries, like same generation-queries, are not expressible with regular expressions. To overcome this limitation, in this paper, we present cfSPARQL, an extension of SPARQL query language equipped with context-ree grammars. The cfSPARQL language is strictly more expressive than property paths and nested expressions. The additional expressivity can be used for modelling graph similarities, graph summarization and ontology alignment. Despite the increasing expressivity, we show that cfSPARQL still enjoys a low computational complexity and can be evaluated efficiently. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-46523-4_38 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Query language,Regular expression,RDF query language,Expression (mathematics),Computer science,Path expression,SPARQL,Theoretical computer science,Spatial query,Database,RDF | Journal | 9981 |
ISSN | Citations | PageRank |
0302-9743 | 10 | 0.60 |
References | Authors | |
23 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaowang Zhang | 1 | 163 | 38.77 |
| Zhiyong Feng | 2 | 794 | 167.21 |
| Xin Wang | 3 | 65 | 24.90 |
| Guozheng Rao | 4 | 30 | 9.79 |