English

Palpatine: Mining Frequent Sequences for Data Prefetching in NoSQL Distributed Key-Value Stores

Distributed, Parallel, and Cluster Computing 2020-04-24 v2 Databases

Abstract

This paper presents PALPATINE, the first in-memory application-level cache for Distributed Key-Value (DKV) data stores, capable of prefetching data that is likely to be accessed in an immediate future. To predict data accesses, PALPATINE continuously captures frequent access patterns to the back store by means of data mining techniques. With these patterns, PALPATINE builds a stochastic graph of accessed items, and makes prefetching decisions based on it. Experimental evaluation indicates that PALPATINE can improve the latency of a specific DKV store by more that an order of magnitude.

Cite

@article{arxiv.2002.00215,
  title  = {Palpatine: Mining Frequent Sequences for Data Prefetching in NoSQL Distributed Key-Value Stores},
  author = {Sergio Esteves and Joao Nuno Silva and Luis Veiga},
  journal= {arXiv preprint arXiv:2002.00215},
  year   = {2020}
}

Comments

14 pages, 27 figures

R2 v1 2026-06-23T13:27:41.231Z