Scalable Transaction Processing through Data-oriented Execution

Salvato in:
Dettagli Bibliografici
Pubblicato in:ProQuest Dissertations and Theses (2012)
Autore principale: Pandis, Ippokratis
Pubblicazione:
ProQuest Dissertations & Theses
Soggetti:
Accesso online:Citation/Abstract
Full Text - PDF
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!

MARC

LEADER 00000nab a2200000uu 4500
001 1032803410
003 UK-CbPIL
020 |a 978-1-267-51476-9 
035 |a 1032803410 
045 0 |b d20120101 
084 |a 66569  |2 nlm 
100 1 |a Pandis, Ippokratis 
245 1 |a Scalable Transaction Processing through Data-oriented Execution 
260 |b ProQuest Dissertations & Theses  |c 2012 
513 |a Dissertation/Thesis 
520 3 |a Data management technology changes the world we live in by providing efficient access to huge volumes of constantly changing data and by enabling sophisticated analysis of those data. Recently there has been an unprecedented increase in the demand for data management services. In parallel, we have witnessed a tremendous shift in the underlying hardware technology toward highly parallel multicore processors. In order to cope with the increased demand and user expectations, data management systems need to fully exploit abundantly available hardware parallelism. Transaction processing is one of the most important and challenging database workloads and this dissertation contributes to the quest for scalable transaction processing software. Our research shows that in a highly parallel multicore landscape, rather than improving single-thread performance, system designers should prioritize the reduction of critical sections where hardware parallelism increases contention unbounded. In addition, this thesis describes solid improvements in conventional transaction processing technology. New transaction processing mechanisms show gains by avoiding the execution of unbounded critical sections in the lock manager through caching, and in the log manager by downgrading the critical sections to composable ones. More importantly, this dissertation shows that conventional transaction processing has inherent scalability limitations due to the unpredictable access patterns caused by the request-oriented execution model it follows. Instead, it proposes adopting a data-oriented execution model, and shows that transaction processing systems designed around data-oriented execution break the inherent limitations of conventional execution. The data-oriented design paves the way for transaction processing systems to maintain scalability as parallelism increases for the foreseeable future; as hardware parallelism increases, the benefits will only increase. In addition, the principles used to achieve scalability can be generally applied to other software systems facing similar scalability challenges as the shift to multicore hardware continues. 
653 |a Computer engineering 
773 0 |t ProQuest Dissertations and Theses  |g (2012) 
786 0 |d ProQuest  |t ProQuest Dissertations & Theses Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/1032803410/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/1032803410/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch