Results 1 - 10 of 1,193

Materialized Views and Key-Value Pairs in a Cache Augmented SQL System: Similarities and Differences

by Shahram Gh, Jason Yap , 2012
"... In the era of no “one-size-fits-all”, organizations extend a relational database management system (RDBMS) with a key-value store (KVS) to enhance the velocity of big data applications with a high read to write ratio. A popular in-memory KVS is memcached in use by well known Internet destinations su ..."
Abstract - Add to MetaCart
such as YouTube and Wikipedia. Its simple interface provides put, get, and delete of key-value pairs computed using tabular data. A key question is how do these key-value pairs compare with materialized views in a RDBMS. This paper provides an answer to this question. A

Protecting Privacy in Key-Value Search Systems

by Yinglian Xie, Michael K. Reiter, Server Pool , 2003
"... This paper investigates the general problem of performing key-value search at untrusted servers without loss of user privacy. Specifically, given key-value pairs from multiple owners that are stored across untrusted servers, how can a client search these pairs such that no server, on its own, can re ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper investigates the general problem of performing key-value search at untrusted servers without loss of user privacy. Specifically, given key-value pairs from multiple owners that are stored across untrusted servers, how can a client search these pairs such that no server, on its own, can

ABSTRACT Protecting Privacy in Key-Value Search Systems

by Yinglian Xie, Michael K. Reiter
"... This paper investigates the general problem of performing key-value search at untrusted servers without loss of user privacy. Specifically, given key-value pairs from multiple owners that are stored across untrusted servers, how can a client search these pairs such that no server, on its own, can re ..."
Abstract - Add to MetaCart
This paper investigates the general problem of performing key-value search at untrusted servers without loss of user privacy. Specifically, given key-value pairs from multiple owners that are stored across untrusted servers, how can a client search these pairs such that no server, on its own, can

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores ∗†

by Shahram Gh, Y Irani, Jenny Lam, Jason Yap , 2014
"... Cost Adaptive Multi-queue eviction Policy (CAMP) is an algorithm for a general purpose key-value store (KVS) that manages key-value pairs computed by applications with different access patterns, key-value sizes, and varying costs for each key-value pair. CAMP is an approximation of the Greedy Dual S ..."
Abstract - Add to MetaCart
Cost Adaptive Multi-queue eviction Policy (CAMP) is an algorithm for a general purpose key-value store (KVS) that manages key-value pairs computed by applications with different access patterns, key-value sizes, and varying costs for each key-value pair. CAMP is an approximation of the Greedy Dual

FlashStore: High Throughput Persistent KeyValue Store

by Biplob Debnath, Sudipta Sengupta, Jin Li
"... We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the working set of key-value pairs on flash and use one flash read per key lookup. As the working set changes over time, space ..."
Abstract - Cited by 36 (2 self) - Add to MetaCart
We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the working set of key-value pairs on flash and use one flash read per key lookup. As the working set changes over time

Word Count (cont.)

by J. Dean, S. Ghemawat, Presented Luna Xu, Mapreduce Key Contribution
"... ● A programming model for processing large data sets ○ Map and reduce operations on key/value pairs ● An interface addresses details: ○ Parallelization ○ Fault-tolerance ..."
Abstract - Add to MetaCart
● A programming model for processing large data sets ○ Map and reduce operations on key/value pairs ● An interface addresses details: ○ Parallelization ○ Fault-tolerance

Optimizing Flash-based Key-value Cache Systems

by Zhaoyan Shen , Feng Chen , Yichen Jia , Zili Shao
"... Abstract Flash-based key-value cache systems, such as Facebook's McDipper [1] and Twitter's Fatcache [2], provide a cost-efficient solution for high-speed key-value caching. These cache solutions typically take commercial SSDs and adopt a Memcached-like scheme to store and manage key-valu ..."
Abstract - Add to MetaCart
pairs in flash. Such a practice, though simple, is inefficient. We advocate to reconsider the hardware/software architecture design by directly opening device-level details to key-value cache systems. This co-design approach can effectively bridge the semantic gap and closely connect the two layers

SILT: A Memory-Efficient, High-Performance Key-Value Store

by Hyeontaek Lim, David G. Andersen, Bin Fan, Michael Kaminsky, Bufferhash Flashstore - In Proc. 23rd ACM SOSP, Cascias , 2011
"... SILT (Small Index Large Table) is a memory-efficient, high-performance key-value store system based on flash storage that scales to serve billions of key-value items on a single node. It requires only 0.7 bytes of DRAM per entry and retrieves key/value pairs using on average 1.01 flash reads each. S ..."
Abstract - Cited by 56 (14 self) - Add to MetaCart
SILT (Small Index Large Table) is a memory-efficient, high-performance key-value store system based on flash storage that scales to serve billions of key-value items on a single node. It requires only 0.7 bytes of DRAM per entry and retrieves key/value pairs using on average 1.01 flash reads each

CAA-> 1,1

by Michael Schatz, Critical Computational, Challenges Alignment, Assembly Huge , 2010
"... Application developers focus on 2 (+1 internal) functions – Map: input � key, value pairs – Shuffle: Group together pairs with same key ..."
Abstract - Add to MetaCart
Application developers focus on 2 (+1 internal) functions – Map: input � key, value pairs – Shuffle: Group together pairs with same key

Bigsecret: A secure data management framework for key-value stores,”

by Erman Pattuk , Murat Kantarcioglu , Vaibhav Khadilkar , Huseyin Ulusoy , Sharad Mehrotra , 2013
"... Abstract-Data storage is one of the most popular cloud services, and is therefore offered by most service providers. Among the various cloud based data storage services, keyvalue stores has emerged as a popular option for storing and retrieving billions of key-value pairs. Although using such cloud ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract-Data storage is one of the most popular cloud services, and is therefore offered by most service providers. Among the various cloud based data storage services, keyvalue stores has emerged as a popular option for storing and retrieving billions of key-value pairs. Although using
Results 1 - 10 of 1,193