Proceedings of the 2009 International Database Engineering &Amp; Applications Symposium on - IDEAS '09 2009
DOI: 10.1145/1620432.1620437
|View full text |Cite
|
Sign up to set email alerts
|

A complete translation from SPARQL into efficient SQL

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0
18

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(52 citation statements)
references
References 13 publications
0
34
0
18
Order By: Relevance
“…This algorithm is also generic with respect to the underlying SQL schema. Their evaluation was also on a triple-table style schema on small datasets of 2-5 million triples [30]. While in theory, these two SPARQL to SQL translations approaches should function as a RDB2RDF system on any SQL database, both their evaluations were limited to building a triplestore on top of a relational database.…”
Section: Related Workmentioning
confidence: 99%
“…This algorithm is also generic with respect to the underlying SQL schema. Their evaluation was also on a triple-table style schema on small datasets of 2-5 million triples [30]. While in theory, these two SPARQL to SQL translations approaches should function as a RDB2RDF system on any SQL database, both their evaluations were limited to building a triplestore on top of a relational database.…”
Section: Related Workmentioning
confidence: 99%
“…However, there are RDBMS that need special at tention (e.g., MySQL, PostgreSQL), because the resulting queries contain some properties that affect the capabilities of the database optimizer. For this reason, whenever it is possible, we remove non-correlated subqueries from the re sulting queries by pushing down projections and selections (as advocated by [10]). We also remove self-joins that occur in the rewritten queries such as when the graph patterns con tain alpha mappings coming from the same …”
Section: Query Rewriting Optimizationsmentioning
confidence: 99%
“…In the context of RDF data management, some works [7,10] have focused on using relational databases as the backend for triple stores, with the idea of exploiting the performance provided by relational database systems. They normally work with schema-oblivious layouts (using a triple table layout containing columns corresponding to the triple elements) or vertical partitioned layouts (using different tables to store triples corresponding to the same predicate).…”
Section: Introductionmentioning
confidence: 99%
“…A number of translations of SPARQL queries (under simple entailment) to SQL queries have already been suggested in the literature; see, e.g., [9,13,7,32,27]. However, none of them is suitable for our aims because they do not take into account the three-valued logic used in the OPTIONAL and BOUND constructs of the current SPARQL 1.1 (the semantics of OPTIONAL was not compositional in SPARQL 1.0).…”
Section: Translating Sparql Under Simple Entailment To Sqlmentioning
confidence: 99%