Graph-based Regular Expression Pattern
(Redirected from Graph Regular Expression)
Jump to navigation
Jump to search
A Graph-based Regular Expression Pattern is a Regular Expression Pattern that can accept a graph.
References
2009
- (Alkhateeb et al., 2009) ⇒ Faisal Alkhateeb, Jean-François Baget, and Jérôme Euzenat. (2009). “Extending SPARQL with Regular Expression Patterns (for Querying RDF).” In: Web Semantics: Science, Services and Agents on the World Wide Web. doi:10.1016/j.websem.2009.02.002
- QUOTE: RDF is a knowledge representation language dedicated to the annotation of resources within the framework of the semantic web. Among the query languages for RDF, SPARQL allows querying RDF through graph patterns, i.e., RDF graphs involving variables. Other languages, inspired by the work in databases, use regular expressions for searching paths in RDF graphs.