• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 198
Next 10 →

MICA: A Holistic Approach to Fast In-Memory Key-Value Storage

by Hyeontaek Lim, Dongsu Han, David G. Andersen, Michael Kaminsky
"... MICA is a scalable in-memory key-value store that han-dles 65.6 to 76.9 million key-value operations per second using a single general-purpose multi-core system. MICA is over 4–13.5x faster than current state-of-the-art sys-tems, while providing consistently high throughput over a variety of mixed r ..."
Abstract - Cited by 20 (5 self) - Add to MetaCart
MICA is a scalable in-memory key-value store that han-dles 65.6 to 76.9 million key-value operations per second using a single general-purpose multi-core system. MICA is over 4–13.5x faster than current state-of-the-art sys-tems, while providing consistently high throughput over a variety of mixed

Scalaris: Reliable Transactional P2P Key/Value Store Web 2.0 Hosting with Erlang and Java

by Florian Schintke Alex, Er Reinefeld
"... We present Scalaris, an Erlang implementation of a distributed key/value store. It uses, on top of a structured overlay network, replication for data availability and majority based distributed transactions for data consistency. In combination, this implements the ACID properties on a scalable struc ..."
Abstract - Add to MetaCart
We present Scalaris, an Erlang implementation of a distributed key/value store. It uses, on top of a structured overlay network, replication for data availability and majority based distributed transactions for data consistency. In combination, this implements the ACID properties on a scalable

In-place update with linear types or How to compile functional programs into malloc()-free C

by Martin Hofmann
"... this paper is to show that by imposing mild extra annotations one can have the best of both worlds: easy to write code which is amenable to equational reasoning, yet modifies its arguments in place and does not allocate heap space unless explicitly told to do so. An aside: a critic may argue that a ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
this paper is to show that by imposing mild extra annotations one can have the best of both worlds: easy to write code which is amenable to equational reasoning, yet modifies its arguments in place and does not allocate heap space unless explicitly told to do so. An aside: a critic may argue that a

Scalable and accurate causality tracking for eventually consistent stores

by Paulo Sérgio Almeida, Carlos Baquero, Ricardo Gonçalves, Nuno Preguiça, Victor Fonte, Inesc Tec - in 14th International Conference on Distributed Applications and Interoperable Systems
"... Abstract. In cloud computing environments, data storage systems often rely on optimistic replication to provide good performance and availability even in the presence of failures or network partitions. In this scenario, it is important to be able to accurately and efficiently identify updates execut ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
causality, either by removing entries from client-id based version vectors or using server-id based version vectors, which cause false con-flicts. We propose a new logical clock mechanism and a logical clock framework that together support a traditional key-value store API, while capturing causal-ity

document-oriented store

by Viet-trung Tran, Dushyanth Narayanan, Gabriel Antoniu, Luc Bougé, Viet-trung Tran, Dushyanth Narayanan, Gabriel Antoniu, Luc Bougé
"... Abstract: As a result of continuous innovation in hardware technology, computers are made more and more powerful than their prior models. Modern servers nowadays can possess large main memory capability that can size up to 1 Terabytes (TB) and more. As memory accesses are at least 100 times faster t ..."
Abstract - Add to MetaCart
for performance of analytical processing. Key-words: In-memory, DStore, NoSQL, vertical scaling, document-oriented store, versioning

Materialized Views for Eventually Consistent Record Stores

by Jin Changjiu , Rui #1 , Liu , Kenneth Salem
"... Abstract-Distributed, replicated keyed-record stores are often used by applications that place a premium on high availability and scalability. Such systems provide fast access to stored records given a primary key value, but access without the primary key may be very slow and expensive. This proble ..."
Abstract - Add to MetaCart
Abstract-Distributed, replicated keyed-record stores are often used by applications that place a premium on high availability and scalability. Such systems provide fast access to stored records given a primary key value, but access without the primary key may be very slow and expensive

Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems

by Thomas Neumann, Tobias Mühlbauer, Alfons Kemper, Technische Universität München
"... Multi-Version Concurrency Control (MVCC) is a widely em-ployed concurrency control mechanism, as it allows for exe-cution modes where readers never block writers. However, most systems implement only snapshot isolation (SI) instead of full serializability. Adding serializability guarantees to ex-ist ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
-isting SI implementations tends to be prohibitively expensive. We present a novel MVCC implementation for main-mem-ory database systems that has very little overhead compared to serial execution with single-version concurrency control, even when maintaining serializability guarantees. Updating data in-place

Diff-Index: Differentiated Index in Distributed Log-Structured Data Stores

by Wei Tan, Sandeep Tata, Yuzhe Tang, Liana Fong
"... Log-Structured-Merge (LSM) Tree gains much attention re-cently because of its superior performance in write-intensive workloads. LSM Tree uses an append-only structure in memory to achieve low write latency; at memory capac-ity, in-memory data are flushed to other storage media (e.g. disk). Conseque ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
). Consequently, read access is slower comparing to write. These specific features of LSM, including no in-place update and asymmetric read/write performance raise unique challenges in index maintenance for LSM. The structural difference between LSM and B-Tree also prevents mature B-Tree based approaches from

Multi-Version Range Concurrency Control in Deuteronomy

by Justin Levandoski , David Lomet , Sudipta Sengupta , Ryan Stutsman , Rui Wang
"... ABSTRACT The Deuteronomy transactional key value store executes millions of serializable transactions/second by exploiting multi-version timestamp order concurrency control. However, it has not supported range operations, only individual record operations (e.g., create, read, update, delete). In th ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
ABSTRACT The Deuteronomy transactional key value store executes millions of serializable transactions/second by exploiting multi-version timestamp order concurrency control. However, it has not supported range operations, only individual record operations (e.g., create, read, update, delete

Managing large graphs on multi-cores with graph awareness.

by Vijayan Prabhakaran , Ming Wu , Xuetian Weng , Frank Mcsherry , Lidong Zhou , Maya Haridasan - In USENIX ATC’12, , 2012
"... Abstract Grace is a graph-aware, in-memory, transactional graph management system, specifically built for real-time queries and fast iterative computations. It is designed to run on large multi-cores, taking advantage of the inherent parallelism to improve its performance. Grace contains a number o ..."
Abstract - Cited by 19 (1 self) - Add to MetaCart
vertices) and performs up to two orders of magnitude faster than commercial key-value stores and graph databases.
Next 10 →
Results 1 - 10 of 198
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University