{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:58:09Z","timestamp":1759694289518,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:00:00Z","timestamp":1589414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:00:00Z","timestamp":1589414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00607-020-00814-9","type":"journal-article","created":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T21:03:53Z","timestamp":1589490233000},"page":"1743-1763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A cache-based method to improve query performance of linked Open Data cloud"],"prefix":"10.1007","volume":"102","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4553-0550","authenticated-orcid":false,"given":"Usman","family":"Akhtar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Sant\u2019Anna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Ho","family":"Jihn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Asif","family":"Razzaq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaehun","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,14]]},"reference":[{"key":"814_CR1","doi-asserted-by":"crossref","unstructured":"Basu A (2019) Semantic web, ontology, and linked data. In: Web services: concepts, methodologies, tools, and applications, IGI Global, pp 127\u2013148","DOI":"10.4018\/978-1-5225-7501-6.ch008"},{"issue":"5","key":"814_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1038\/scientificamerican0501-34","volume":"284","author":"T Berners-Lee","year":"2001","unstructured":"Berners-Lee T, Hendler J, Lassila O (2001) The semantic web. Sci Am 284(5):34\u201343","journal-title":"Sci Am"},{"issue":"3","key":"814_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009081901","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer C, Heath T, Berners-Lee T (2009) Linked data-the story so far. Int J Semant Web Inf Syst 5(3):1\u201322","journal-title":"Int J Semant Web Inf Syst"},{"key":"814_CR4","doi-asserted-by":"crossref","unstructured":"Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, pp 1247\u20131250","DOI":"10.1145\/1376616.1376746"},{"issue":"3","key":"814_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/857166.857170","volume":"3","author":"J Cho","year":"2003","unstructured":"Cho J, Garcia-Molina H (2003) Estimating frequency of change. ACM Trans Internet Technol 3(3):256\u2013290","journal-title":"ACM Trans Internet Technol"},{"key":"814_CR6","doi-asserted-by":"publisher","first-page":"86226","DOI":"10.1109\/ACCESS.2019.2923414","volume":"7","author":"S Chun","year":"2019","unstructured":"Chun S, Jung J, Lee KH (2019) Proactive policy for efficiently updating join views on continuous queries over data streams and linked data. IEEE Access 7:86226\u201386241","journal-title":"IEEE Access"},{"key":"814_CR7","first-page":"330","volume":"96","author":"S Dar","year":"1996","unstructured":"Dar S, Franklin MJ, Jonsson BT, Srivastava D, Tan M et al (1996) Semantic data caching and replacement. VLDB 96:330\u2013341","journal-title":"VLDB"},{"issue":"5","key":"814_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/363095.363141","volume":"11","author":"PJ Denning","year":"1968","unstructured":"Denning PJ (1968) The working set model for program behavior. Commun ACM 11(5):323\u2013333","journal-title":"Commun ACM"},{"key":"814_CR9","unstructured":"Dividino RQ, Gr\u00f6ner G (2013) Which of the following SPARQL queries are similar? why? In: LD4IE@ ISWC"},{"issue":"2","key":"814_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/SW-180309","volume":"10","author":"JD Fern\u00e1ndez","year":"2019","unstructured":"Fern\u00e1ndez JD, Umbrich J, Polleres A, Knuth M (2019) Evaluating query and storage strategies for RDF archives. Semant Web 10(2):247\u2013291","journal-title":"Semant Web"},{"issue":"4","key":"814_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ijforecast.2006.03.005","volume":"22","author":"ES Gardner Jr","year":"2006","unstructured":"Gardner ES Jr (2006) Exponential smoothing: the state of the art\u2013part ii. Int J Forecast 22(4):637\u2013666","journal-title":"Int J Forecast"},{"key":"814_CR12","doi-asserted-by":"crossref","unstructured":"Godfrey P, Gryz J (1999) Answering queries by semantic caches. In: International conference on database and expert systems applications, Springer, pp 485\u2013498","DOI":"10.1007\/3-540-48309-8_45"},{"key":"814_CR13","unstructured":"Gottron T (2016) Measuring the accuracy of linked data indices. arXiv preprint arXiv:1603.06068"},{"issue":"4","key":"814_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10619-014-7143-0","volume":"33","author":"T Gottron","year":"2015","unstructured":"Gottron T, Knauf M, Scherp A (2015) Analysis of schema structures in the linked open data graph based on unique subject uris, pay-level domains, and vocabulary usage. Distrib Parallel Databases 33(4):515\u2013553","journal-title":"Distrib Parallel Databases"},{"key":"814_CR15","doi-asserted-by":"crossref","unstructured":"Hasan R (2014) Predicting SPARQL query performance and explaining linked data. In: European semantic web conference, Springer, pp 795\u2013805","DOI":"10.1007\/978-3-319-07443-6_53"},{"key":"814_CR16","doi-asserted-by":"crossref","unstructured":"Jelenkovi\u0107 P, Radovanovi\u0107 A (2003) Optimizing the LRU algorithm for web caching. Charzinski J, Lehnert R, Tran-Gia P (eds) Teletraffic science and engineering, vol 5. Elsevier, pp 191\u2013200, ISSN 1388\u20133437, ISBN 9780444514554","DOI":"10.1016\/S1388-3437(03)80164-6"},{"key":"814_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.websem.2012.06.002","volume":"16","author":"M Konrath","year":"2012","unstructured":"Konrath M, Gottron T, Staab S, Scherp A (2012) Schemex\u2013efficient construction of a data catalogue by stream-based indexing of linked data. Web Semant Sci Serv Agents World Wide Web 16:52\u201358","journal-title":"Web Semant Sci Serv Agents World Wide Web"},{"issue":"12","key":"814_CR18","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1109\/TC.2001.970573","volume":"50","author":"D Lee","year":"2001","unstructured":"Lee D, Choi J, Kim JH, Noh SH, Min SL, Cho Y, Kim CS (2001) LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans Comput 50(12):1352\u20131361","journal-title":"IEEE Trans Comput"},{"key":"814_CR19","doi-asserted-by":"crossref","unstructured":"Lehmann J, B\u00fchmann L (2011) Autosparql: let users query your knowledge base. In: Extended semantic web conference, Springer, pp 63\u201379","DOI":"10.1007\/978-3-642-21034-1_5"},{"issue":"2","key":"814_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann J, Isele R, Jakob M, Jentzsch A, Kontokostas D, Mendes PN, Hellmann S, Morsey M, Van Kleef P, Auer S et al (2015) Dbpedia-a large-scale, multilingual knowledge base extracted from wikipedia. Semant Web 6(2):167\u2013195","journal-title":"Semant Web"},{"key":"814_CR21","doi-asserted-by":"crossref","unstructured":"Levandoski JJ, Larson P\u00c5, Stoica R (2013) Identifying hot and cold data in main-memory databases. In: 2013 IEEE 29th international conference on data engineering (ICDE), IEEE, pp 26\u201337","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"814_CR22","doi-asserted-by":"crossref","unstructured":"Lorey J, Naumann F (2013) Caching and prefetching strategies for SPARQL queries. In: Extended semantic web conference, Springer, pp 46\u201365","DOI":"10.1007\/978-3-642-41242-4_5"},{"key":"814_CR23","doi-asserted-by":"crossref","unstructured":"Lorey J, Naumann F (2013) Detecting SPARQL query templates for data prefetching. In: Extended semantic web conference, Springer, pp 124\u2013139","DOI":"10.1007\/978-3-642-38288-8_9"},{"key":"814_CR24","doi-asserted-by":"crossref","unstructured":"Martin M, Unbehauen J, Auer S (2010) Improving the performance of semantic web applications with SPARQL query caching. In: Extended semantic web conference, Springer, pp 304\u2013318","DOI":"10.1007\/978-3-642-13489-0_21"},{"key":"814_CR25","doi-asserted-by":"crossref","unstructured":"Nishioka C, Scherp A (2017) Keeping linked open data caches up-to-date by predicting the life-time of RDF triples. In: Proceedings of the international conference on web intelligence, ACM, pp 73\u201380","DOI":"10.1145\/3106426.3106463"},{"key":"814_CR26","doi-asserted-by":"crossref","unstructured":"Papailiou N, Tsoumakos D, Karras P, Koziris N (2015) Graph-aware, workload-adaptive SPARQL query caching. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, ACM, pp 1777\u20131792","DOI":"10.1145\/2723372.2723714"},{"issue":"2","key":"814_CR27","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park HS, Jun CH (2009) A simple and fast algorithm for k-medoids clustering. Expert Syst Appl 36(2):3336\u20133341","journal-title":"Expert Syst Appl"},{"issue":"4","key":"814_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/954339.954341","volume":"35","author":"S Podlipnig","year":"2003","unstructured":"Podlipnig S, B\u00f6sz\u00f6rmenyi L (2003) A survey of web cache replacement strategies. ACM Comput Surv 35(4):374\u2013398","journal-title":"ACM Comput Surv"},{"issue":"1","key":"814_CR29","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TKDE.2003.1161590","volume":"15","author":"Q Ren","year":"2003","unstructured":"Ren Q, Dunham MH, Kumar V (2003) Semantic caching and query processing. IEEE Trans Knowl Data Eng 15(1):192\u2013210","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"814_CR30","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"3","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern 3:353\u2013362","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"814_CR31","doi-asserted-by":"crossref","unstructured":"Shu Y, Compton M, M\u00fcller H, Taylor K (2013) Towards content-aware SPARQL query caching for semantic web applications. In: International conference on web information systems engineering, Springer, pp 320\u2013329","DOI":"10.1007\/978-3-642-41230-1_27"},{"key":"814_CR32","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum G (2007) YAGO: a core of semantic knowledge. In: Proceedings of the 16th international conference on World Wide Web, ACM, pp 697\u2013706","DOI":"10.1145\/1242572.1242667"},{"key":"814_CR33","doi-asserted-by":"crossref","unstructured":"Umbrich J, Karnstedt M, Hogan A, Parreira JX (2012) Hybrid SPARQL queries: fresh versus fast results. In: International semantic web conference, Springer, pp 608\u2013624","DOI":"10.1007\/978-3-642-35176-1_38"},{"issue":"5","key":"814_CR34","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s00607-017-0554-9","volume":"99","author":"L Yan","year":"2017","unstructured":"Yan L, Ma R, Li D, Cheng J (2017) RDF approximate queries based on semantic similarity. Computing 99(5):481\u2013491","journal-title":"Computing"},{"key":"814_CR35","doi-asserted-by":"crossref","unstructured":"Yang M, Wu G (2011) Caching intermediate result of SPARQL queries. In: Proceedings of the 20th international conference companion on World wide web, ACM, pp 159\u2013160","DOI":"10.1145\/1963192.1963273"},{"key":"814_CR36","doi-asserted-by":"crossref","unstructured":"Zhang WE, Sheng QZ, Qin Y, Yao L, Shemshadi A, Taylor K (2016) SECF: Improving SPARQL querying performance with proactive fetching and caching. In: Proceedings of the 31st annual ACM symposium on applied computing, ACM, pp 362\u2013367","DOI":"10.1145\/2851613.2851846"},{"key":"814_CR37","doi-asserted-by":"crossref","unstructured":"Zhang WE, Sheng QZ, Taylor K, Qin Y (2015) Identifying and caching hot triples for efficient RDF query processing. In: International conference on database systems for advanced applications, Springer, pp 259\u2013274","DOI":"10.1007\/978-3-319-18123-3_16"},{"issue":"3","key":"814_CR38","first-page":"35","volume":"18","author":"WE Zhang","year":"2018","unstructured":"Zhang WE, Sheng QZ, Yao L, Taylor K, Shemshadi A, Qin Y (2018) A learning-based framework for improving querying on web interfaces of curated knowledge bases. ACM Trans Internet Technol 18(3):35","journal-title":"ACM Trans Internet Technol"},{"issue":"11","key":"814_CR39","doi-asserted-by":"publisher","first-page":"840","DOI":"10.14778\/2983200.2983201","volume":"9","author":"W Zheng","year":"2016","unstructured":"Zheng W, Zou L, Peng W, Yan X, Song S, Zhao D (2016) Semantic SPARQL similarity search over RDF knowledge graphs. Proc VLDB Endow 9(11):840\u2013851","journal-title":"Proc VLDB Endow"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00814-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-020-00814-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00814-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T23:42:03Z","timestamp":1620949323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-020-00814-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,14]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["814"],"URL":"https:\/\/doi.org\/10.1007\/s00607-020-00814-9","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2020,5,14]]},"assertion":[{"value":"9 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}