Abstract
With the growing applications of knowledge graphs in diverse domains, the scale of knowledge graphs is dramatically increasing. Based on the fact that a high percentage of queries in practice is similar to previous queries, extensive caching methods have been proposed to accelerate subgraph matching queries by reusing the results of previous queries. However, most existing methods show poor performance when dealing with distributed subgraph matching queries, as numerous intermediate results from the caching should be transmitted to the worker nodes for further validation, leading to extra communication and computation overhead. In this paper, we propose a novel ontology-aware caching method, called OntoCA, which leverages ontology information for efficient distributed queries. Unlike the existing caching methods, our approach fully employs semantic reasoning to filter intermediate results at an early stage, thus improving the query performance. Furthermore, a workload-adaptive prefetching strategy is proposed to increase the hit ratio of OntoCA. The experimental results show that our proposed OntoCA and prefetching strategy outperforms the existing state-of-the-art distributed query method, reducing the query times by 56.16%.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
World Wide Web Consortium et al. RDF 1.1 concepts and abstract syntax (2014)
World Wide Web Consortium et al. SPARQL 1.1 query language (2013)
Ali, W., Saleem, M., Yao, B., Hogan, A., Ngomo, A.-C.N.: A survey of RDF stores & SPARQL engines for querying knowledge graphs. VLDB J. 1–26 (2021)
Brickley, D., Guha, R.V., McBride, B.: RDF schema 1.1. W3C Recommendation 25, 2004–2014 (2014)
Papailiou, N., Tsoumakos, D., Karras, P., Koziris, N.: Graph-aware, workload-adaptive SPARQL query caching. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1777–1792( 2015)
Zhang, Wei Emma, Sheng, Quan Z.., Taylor, Kerry, Qin, Yongrui: Identifying and caching hot triples for efficient RDF query processing. In: Renz, Matthias, Shahabi, Cyrus, Zhou, Xiaofang, Cheema, Muhammad Aamir (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 259–274. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18123-3_16
Yi, J., Li, P., Choi, S.S., Bhowmick, B., Xu, J.: FLAG: towards graph query autocompletion for large graphs. Data Sci. Eng. 7, 175–191 (2022)
Bok, K., Yoo, S., Choi, D., Lim, J., Yoo, J.: In-memory caching for enhancing subgraph accessibility. Appl. Sci. 10(16), 5507 (2020)
Muñoz, Sergio, Pérez, Jorge, Gutierrez, Claudio: Minimal deductive systems for RDF. In: Franconi, Enrico, Kifer, Michael, May, Wolfgang (eds.) ESWC 2007. LNCS, vol. 4519, pp. 53–67. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72667-8_6
Zhao, Y., Yunfei, H., Yuan, P., Jin, H.: Maximizing influence over streaming graphs with query sequence. Data Sci. Eng. 6(3), 339–357 (2021)
Peng, P., Zou, L., Tamer Özsu, M., Chen, L., Zhao, D.: Processing SPARQL queries over distributed RDF graphs. VLDB J. 25(2), 243–268 (2016)
Peng, P., Zou, L.,, Guan, R.: Accelerating partial evaluation in distributed SPARQL query evaluation. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 112–123. IEEE (2019)
Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for owl knowledge base systems. J. Web Semant. 3(2–3), 158–182 (2005)
Acknowledgments
This work is supported by the National Key Research and Development Program of China (2019YFE0198600).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Qin, Y., Wang, X., Hao, W., Liu, P., Song, Y., Zhang, Q. (2023). OntoCA: Ontology-Aware Caching for Distributed Subgraph Matching. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13421. Springer, Cham. https://doi.org/10.1007/978-3-031-25158-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-031-25158-0_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25157-3
Online ISBN: 978-3-031-25158-0
eBook Packages: Computer ScienceComputer Science (R0)