A Queue-oriented Transaction Processing Paradigm
Gorde:
| Argitaratua izan da: | arXiv.org (Oct 23, 2019), p. n/a |
|---|---|
| Egile nagusia: | |
| Argitaratua: |
Cornell University Library, arXiv.org
|
| Gaiak: | |
| Sarrera elektronikoa: | Citation/Abstract Full text outside of ProQuest |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2308329128 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2308329128 | ||
| 045 | 0 | |b d20191023 | |
| 100 | 1 | |a Qadah, Thamir M | |
| 245 | 1 | |a A Queue-oriented Transaction Processing Paradigm | |
| 260 | |b Cornell University Library, arXiv.org |c Oct 23, 2019 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Transaction processing has been an active area of research for several decades. A fundamental characteristic of classical transaction processing protocols is non-determinism, which causes them to suffer from performance issues on modern computing environments such as main-memory databases using many-core, and multi-socket CPUs and distributed environments. Recent proposals of deterministic transaction processing techniques have shown great potential in addressing these performance issues. In this position paper, I argue for a queue-oriented transaction processing paradigm that leads to better design and implementation of deterministic transaction processing protocols. I support my approach with extensive experimental evaluations and demonstrate significant performance gains. | |
| 653 | |a Transaction processing | ||
| 653 | |a Queues | ||
| 773 | 0 | |t arXiv.org |g (Oct 23, 2019), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2308329128/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1910.10350 |