Implementation of SPARQL Query Language Based on Graph Homomorphism
Overview & Synopsis
The sparql query language is a W3C candidate recommendation for asking and answering queries against RDF data. It offers capabilities for querying by graph patterns and retrieval of solutions is based on graph pattern matching. This paper is dedicated to the implementation of the sparql query language and its pattern matching mechanism which is reformulated into a graph homomorphism checking constrained by filter evaluation.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Implementation of SPARQL Query Language Based on Graph Homomorphism |
|---|---|
| Author / Organization | Olivier Corby, Catherine Faron Zucker |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2007 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-9881 |
| Original Source Link | Visit Source Page on hal.science » |