KIT | KIT-Bibliothek | Impressum
Open Access Logo
§
Volltext
URN: urn:nbn:de:swb:90-35195

OCTP. An optimistic transactional cache protocol with low abort rates

Pfeifer, Daniel

Abstract:

Since the early nineties transactional cache protocols have been
intensively studied in the context of client-server database
systems.
Research has developed a variety of
protocols and compared different aspects of their quality.

In this paper, we present a new transactional cache protocol, called
"Optimistic Caching Timestamp Protocol" (OCTP). OCTP is a pure
optimistic
protocol and represents a strong improvement over OCC - a classical
optimistic transactional cache protocol. OCC is known to have
very low
message overhead
but suffers from high transaction abort rates. In contrast, OCTP's
message overhead is the same as that of OCC but its abort rates are
considerably
lower. OCTP does not require locks to coordinate concurrent
transactions but
uses a
backward validating timestamp-based approach instead. As opposed
to all
other known transactional cache protocols, it can allow
transactions to
commit which have read stale cached data elements while
still asserting serializability. Its computational complexity is
moderate
and in particular, it does apply a potentially costly
serializability graph
test.
We also present an ex ... mehr


Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Forschungsbericht
Jahr 2005
Sprache Englisch
Identifikator ISSN: 1432-7864
URN: urn:nbn:de:swb:90-35195
KITopen ID: 1000003519
Verlag Karlsruhe
Serie Interner Bericht. Fakultät für Informatik, Universität Karlsruhe ; 2005,23
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page