Search: onr:"swepub:oai:DiVA.org:kth-306494" >
HAT, not CAP :
HAT, not CAP : Towards highly available transactions
-
Bailis, P. (author)
-
Fekete, A. (author)
-
- Ghodsi, Ali (author)
- KTH
-
show more...
-
Hellerstein, J. M. (author)
-
Stoica, I. (author)
-
show less...
-
(creator_code:org_t)
- USENIX Association, 2013
- 2013
- English.
-
In: 14th Workshop on Hot Topics in Operating Systems, HotOS 2013. - : USENIX Association.
- Related links:
-
https://urn.kb.se/re...
Abstract
Subject headings
Close
- 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
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
Keyword
- Highly available systems
- Low latency
- Write operations
- Semantics
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database