Search: (WFRF:(Ali M)) mspu:(conferencepaper) pers:(Ghodsi Ali)
> (2013) >
HAT, not CAP :
HAT, not CAP : Towards highly available transactions
- Article/chapterEnglish2013
Publisher, publication year, extent ...
-
USENIX Association,2013
-
printrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:kth-306494
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-306494URI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
QC 20211217
-
While the CAP Theorem is often interpreted to preclude the availability of transactions in a partition-prone environment, we show that highly available systems can provide useful transactional semantics, often matching those of today's ACID databases. We propose Highly Available Transactions (HATs) that are available in the presence of partitions. HATs support many desirable ACID guarantees for arbitrary transactional sequences of read and write operations and permit low-latency operation.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Fekete, A.
(author)
-
Ghodsi, AliKTH(Swepub:kth)u1oux2k2
(author)
-
Hellerstein, J. M.
(author)
-
Stoica, I.
(author)
-
KTH
(creator_code:org_t)
Related titles
-
In:14th Workshop on Hot Topics in Operating Systems, HotOS 2013: USENIX Association
Internet link
To the university's database