Sciweavers

14 search results - page 1 / 3
» Graph-based Optimistic Transaction Management
Sort
View
JOT
2007
89views more  JOT 2007»
13 years 5 months ago
Graph-based Optimistic Transaction Management
In this paper, we introduce and describe directed dependency graph-based transaction and concurrency control (DCC) for persistent (stable, single-level) object-based bulk data man...
Frans A. Henskens, Maurice G. Ashton
TKDE
1998
139views more  TKDE 1998»
13 years 5 months ago
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
Alexander Thomasian
OTM
2009
Springer
13 years 12 months ago
TMBean: Optimistic Concurrency in Application Servers Using Transactional Memory
Abstract. In this experience report, we present an evaluation of different techniques to manage concurrency in the context of application servers. Traditionally, using entity beans...
Lucas Charles, Pascal Felber, Christophe Gêt...
CIDR
2011
252views Algorithms» more  CIDR 2011»
12 years 9 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
DRM
2003
Springer
13 years 10 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin