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

02/01/2020
by   Sérgio Esteves, et al.
0

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.

READ FULL TEXT

page 11

page 12

research
08/11/2021

Parallel algorithms for mining of frequent itemsets

In the recent decade companies started collecting of large amount of dat...
research
08/17/2017

When data mining meets optimization: A case study on the quadratic assignment problem

This paper presents a hybrid approach called frequent pattern based sear...
research
12/01/2020

Applying data mining and machine learning techniques for sentiment shifter identification

Sentiment shifters, as a set of words and expressions that can affect te...
research
06/15/2018

Mining Rank Data

The problem of frequent pattern mining has been studied quite extensivel...
research
11/05/2006

An associative memory for the on-line recognition and prediction of temporal sequences

This paper presents the design of an associative memory with feedback th...
research
08/28/2019

Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining

Recently, hybrid metaheuristics have become a trend in operations resear...
research
10/04/2021

Learning to shortcut and shortlist order fulfillment deciding

With the increase of order fulfillment options and business objectives t...

Please sign up or login with your details

Forgot password? Click here to reset