Publication:
Easy Freshness with Pequod Cache Joins

Thumbnail Image

Date

2014

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

USENIX
The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Kate, Bryan, Eddie Kohler, Michael S. Kester, Neha Narula, Yandong Mao, and Robert Morris. 2014. "Easy Freshness with Pequod Cache Joins." In Proceedings of 11th USENIX Symposium on Networked Systems Design & Implementation (NSDI '14), Seattle, WA, April 2-4, 2014: 415-428.

Research Data

Abstract

Pequod is a distributed application-level key-value cache that supports declaratively defined, incrementally maintained, dynamic, partially-materialized views. These views, which we call cache joins, can simplify application development by shifting the burden of view maintenance onto the cache. Cache joins define relationships among key ranges; using cache joins, Pequod calculates views on demand, incrementally updates them as required, and in many cases improves performance by reducing client communication. To build Pequod, we had to design a view abstraction for volatile, relationless key-value caches and make it work across servers in a distributed system. Pequod performs as well as other inmemory key-value caches and, like those caches, outperforms databases with view support.

Description

Keywords

Terms of Use

This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Referenced By

Related Stories