Processing streams rather than static files of Linked Data has gained increasing importance in the web of data. When processing datastreams system builders are faced with the conundrum of guaranteeing a constant maximum response time with limited resources and, possibly, no prior information on the data arrival frequency. One approach to address this issue is to delete data from a cache during processing - a process we call eviction. The goal of this paper is to show that datadriven eviction outperforms today's dominant data-agnostic approaches such as first-in-first-out or random deletion. Specifically, we first introduce a method called Clock that evicts data from a join cache based on the likelihood estimate of contributing to a join in the future. Second, using the well-established SR-Bench benchmark as well as a data set from the IPTV domain, we show that Clock outperforms data-agnostic approaches indicating its usefulness for resource-limited linked data stream processing. © 2014 Springer International Publishing.
CITATION STYLE
Gao, S., Scharrenbach, T., & Bernstein, A. (2014). The CLOCK data-aware eviction approach: Towards processing linked data streams with limited resources. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8465 LNCS, pp. 6–20). Springer Verlag. https://doi.org/10.1007/978-3-319-07443-6_2
Mendeley helps you to discover research relevant for your work.