Name
Abstract | ||
|---|---|---|
Query containment is a fundamental problem in database research, which is relevant for many tasks such as query optimisation, view maintenance and query rewriting. For example, recent SPARQL engines built on Big Data frameworks that precompute solutions to frequently requested query patterns, are conceptually an application of query containment. We present an approach for solving the query containment problem for SPARQL queries – the W3C standard query language for RDF datasets. Solving the query containment problem can be reduced to the problem of deciding whether a sub graph isomorphism exists between the normalized algebra expressions of two queries. |
Year | Venue | Field |
|---|---|---|
2018 | ICWE | Query Rewriting,Data mining,Standard query language,Expression (mathematics),Graph isomorphism,Information retrieval,Computer science,View maintenance,SPARQL,Big data,RDF |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claus Stadler | 1 | 363 | 26.65 |
| Muhammad Saleem | 2 | 194 | 21.78 |
| Axel-Cyrille Ngonga Ngomo | 3 | 1775 | 139.40 |
| Jens Lehmann | 4 | 5375 | 355.08 |