GRaCe: A Relaxed Approach for Graph Query Caching
Pages 657 - 666
Abstract
SPARQL query optimization is an important issue for RDF data stores that can benefit from the usage of caching frameworks. Most caching approaches rely on a precise match semantics, that limits the number of cache hits and, as a consequence, the potential benefit. Others propose relaxed matches for the entire query, which is precisely executed over the cached result set. In this paper, to overcome these limitations we propose GRaCe, a Graph Relaxed Caching approach for RDF data stores. GRaCe supports relaxed cache matches and a relaxed query semantics, thus increasing the number of cache hits. Experimental results show that a relaxed cache can significantly reduce query execution time in all the scenarios where a relaxed query result is tolerated.
References
[1]
Chekol MW, Euzenat J, Genevès P, and Layaïda N Gramlich B, Miller D, and Sattler U SPARQL query containment under RDFS entailment regime Automated Reasoning 2012 Heidelberg Springer 134-148
[2]
De Fino, F.: Relaxation meets caching: towards smart caching approaches for graph query processing. Ph.D. thesis. University of Genova, Italy (2020, in preparation)
[3]
Fard, A., et al.: Effective caching techniques for accelerating pattern matching queries. In: Big Data 2014, pp. 491–499 (2014)
[4]
Frosini R et al. Flexible query processing for SPARQL Semant. Web 2017 8 4 533-563
[5]
Guo Y, Pan Z, and Heflin J LUBM: a benchmark for OWL knowledge base systems J. Web Semant. 2005 3 2–3 158-182
[6]
Hart PE, Nilsson NJ, and Raphael B A formal basis for the heuristic determination of minimum cost paths IEEE Trans. Syst. Sci. Cybern. 1968 4 2 100-107
[7]
Junttila Tommi and Kaski Petteri Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) 2007 Philadelphia, PA Society for Industrial and Applied Mathematics 135-149
[8]
Lorey J and Naumann F Cimiano P, Fernández M, Lopez V, Schlobach S, and Völker J Caching and prefetching strategies for SPARQL queries The Semantic Web: ESWC 2013 Satellite Events 2013 Heidelberg Springer 46-65
[9]
Mailis, T., et al.: An efficient index for RDF query containment. In: SIGMOD Conference 2019, pp. 1499–1516 (2019)
[10]
Martin M, Unbehauen J, and Auer S Aroyo L, Antoniou G, Hyvönen E, ten Teije A, Stuckenschmidt H, Cabral L, and Tudorache T Improving the performance of semantic web applications with SPARQL query caching The Semantic Web: Research and Applications 2010 Heidelberg Springer 304-318
[11]
Papailiou, N., et al.: Graph-aware, workload-adaptive SPARQL query caching. In: SIGMOD Conference 2015, pp. 1777–1792 (2015)
[12]
Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF, W3C recommendation (2008). https://www.w3.org/TR/rdf-sparql-query/
[13]
Stocker, M., et al.: SPARQL basic graph pattern optimization using selectivity estimation. In: WWW 2008, pp. 595–604 (2008)
[14]
Wang J et al. GC: a graph caching system for subgraph/supergraph queries PVLDB 2018 11 12 2022-2025
Index Terms
- GRaCe: A Relaxed Approach for Graph Query Caching
Index terms have been assigned to the content through auto-classification.
Recommendations
Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches
Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi [1] as an ...
Scalable query result caching for web applications
The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it faces the challenge of maintaining a high cache hit rate while efficiently ...
Cooperative Caching for GPUs
The rise of general-purpose computing on GPUs has influenced architectural innovation on them. The introduction of an on-chip cache hierarchy is one such innovation. High L1 miss rates on GPUs, however, indicate inefficient cache usage due to myriad ...
Comments
Information & Contributors
Information
Published In
Jan 2020
724 pages
ISBN:978-3-030-38918-5
DOI:10.1007/978-3-030-38919-2
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 20 January 2020
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in