Extensible/rule based query rewrite optimization in Starburst
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The design and implementation of the redland RDF application framework
Proceedings of the 10th international conference on World Wide Web
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
A path-based relational RDF database
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Containment and minimization of RDF/S query patterns
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
The SPARQL Query Graph Model for Query Optimization
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Semantic information retrieval in a distributed environment
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
| Hi-index | 0.00 |
Several query languages for RDF have been proposed before the World Wide Web Consortium started to standardize SPARQL. Due to the declarative nature of the proposed query languages, a query engine is responsible to choose an efficient evaluation strategy. Although all of the RDF repositories provide query capabilities, some of them disregard declarativeness during query evaluation. In this paper, we propose a query graph model (QGM) for SPARQL supporting all phases of query processing. On top of the QGM we defined transformations rules to simplify the query specification as a preliminary step of query execution plan generation. Furthermore, the query graph model can easily be extended to represent new concepts.