{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:20Z","timestamp":1740169100178,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"MIST (Ministry of Science and ICT), South Korea, through the National Program for Excellence in SW"},{"DOI":"10.13039\/501100010418","name":"IITP (Institute for Information & communications Technology Promotion)","doi-asserted-by":"crossref","award":["2017-0-00093"],"award-info":[{"award-number":["2017-0-00093"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ITRC (Information Technology Research Center) Support Program","award":["IITP-2017-0-01629","2017-0-00655"],"award-info":[{"award-number":["IITP-2017-0-01629","2017-0-00655"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2016H1D3A1938039"],"award-info":[{"award-number":["NRF-2016H1D3A1938039"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2871511","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T18:47:28Z","timestamp":1537469248000},"page":"65862-65873","source":"Crossref","is-referenced-by-count":3,"title":["Change-Aware Scheduling for Effectively Updating Linked Open Data Caches"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4553-0550","authenticated-orcid":false,"given":"Usman","family":"Akhtar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0061-8834","authenticated-orcid":false,"given":"Muhammad Asif","family":"Razzaq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ubaid","family":"Ur Rehman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Bilal","family":"Amin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4118-7855","authenticated-orcid":false,"given":"Wajahat Ali","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eui-Nam","family":"Huh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0501-34"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371960"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18818-8_18"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/978-3-642-33876-2_31","article-title":"LODStats—An extensible framework for high-performance dataset analytics","author":"auer","year":"2012","journal-title":"Proc Int'l Conf Knowledge Eng and Knowledge Management"},{"key":"ref31","first-page":"780","article-title":"Scheduling refresh queries for keeping results from a SPARQL endpoint up-to-date (short paper)","author":"knuth","year":"2016","journal-title":"On the Move to Meaningful Internet Systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16438-5_10"},{"key":"ref37","first-page":"200","article-title":"The evolution of the Web and implications for an incremental crawler","author":"cho","year":"2000","journal-title":"Proc 26th Int Conf Very Large Data Bases"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00108-1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1852102.1852103"},{"key":"ref34","article-title":"Towards dataset dynamics: Change frequency of linked open data sources","author":"umbrich","year":"2010","journal-title":"Proc 3rd Int Workshop Linked Data Web (LDOW WWW)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.06.002"},{"article-title":"Information management: A proposal","year":"1990","author":"berners-lee","key":"ref40"},{"journal-title":"Measuring the accuracy of linked data indices","year":"2016","author":"gottron","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07443-6_12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38288-8_15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/363095.363141"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/TC.2001.970573","article-title":"LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies","volume":"50","author":"lee","year":"2001","journal-title":"IEEE Trans Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3106426.3106463"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25010-6_24"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.02.001"},{"key":"ref4","first-page":"304","article-title":"Improving the performance of semantic Web applications with SPARQL query caching","author":"martin","year":"2010","journal-title":"Extended Semantic Web Conf"},{"key":"ref27","first-page":"2","article-title":"Which of the following SPARQL queries are similar? why?","author":"dividino","year":"2013","journal-title":"Proc ISWC"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41242-4_5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-014-7143-0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772768"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/2993318.2993333","article-title":"Evaluating query and storage strategies for RDF archives","author":"fern\u00e1ndez","year":"2016","journal-title":"Proc 12th Int Conf Semantic Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/APNOMS.2017.8094122"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/857166.857170"},{"key":"ref2","first-page":"608","article-title":"Hybrid SPARQL queries: Fresh vs. Fast results","author":"umbrich","year":"2012","journal-title":"Proc Int Semantic Web Conf"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.4018\/978-1-60960-593-3.ch008","article-title":"Linked data-the story so far","author":"bizer","year":"2011","journal-title":"Semantic Services Interoperability and Web Applications Emerging Concepts"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2012.6224296"},{"article-title":"The pagerank citation ranking: Bringing order to the Web","year":"1999","author":"page","key":"ref46"},{"key":"ref20","first-page":"87","article-title":"Change-a-LOD: Does the schema on the linked data cloud change or not?","volume":"1034","author":"dividino","year":"2013","journal-title":"Proc 4th Int Conf Consuming Linked Data"},{"key":"ref45","first-page":"258","article-title":"Multicrawler: A pipelined architecture for crawling and indexing semantic Web data","author":"harth","year":"2006","journal-title":"Proc Int Semantic Web Conf"},{"key":"ref48","first-page":"261","article-title":"LSQ: The linked SPARQL queries dataset","author":"saleem","year":"2015","journal-title":"Proc Int Semantic Web Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2815833.2816948"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50052-4"},{"journal-title":"Scheduling refresh queries for keeping results from a SPARQL endpoint up-to-date (extended version)","year":"2016","author":"knuth","key":"ref21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.65"},{"key":"ref24","first-page":"199","article-title":"An investigation of HTTP header information for detecting changes of linked open data sources","author":"dividino","year":"2014","journal-title":"Proc 3rd European Semantic Web Conf"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"ref23","first-page":"492","article-title":"On the diversity and availability of temporal information in linked open data","author":"rula","year":"2012","journal-title":"Proc 1st Int l Semantic Web Conf (ISWC)"},{"key":"ref44","first-page":"213","article-title":"Towards a dynamic linked data observatory","author":"k\u00e4fer","year":"2012","journal-title":"Proc LDOW WWW"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762486"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983201"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335391"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08468969.pdf?arnumber=8468969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T05:21:39Z","timestamp":1643260899000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8468969\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2871511","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}