English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Multicore CPUs and large memories are increasingly becoming the norm inmodern computer systems. However, current database management systems (DBMSs)are generally ineffective in exploiting the parallelism of such systems. Inparticular, contention can lead to a dramatic fall in performance. In thispaper, we propose a new concurrency control protocol called DGCC (DependencyGraph based Concurrency Control) that separates concurrency control fromexecution. DGCC builds dependency graphs for batched transactions beforeexecuting them. Using these graphs, contentions within the same batch oftransactions are resolved before execution. As a result, the execution of thetransactions does not need to deal with contention while maintaining fullequivalence to that of serialized execution. This better exploits multicorehardware and achieves higher level of parallelism. To facilitate DGCC, we havealso proposed a system architecture that does not have certain centralizedcontrol components yielding better scalability, as well as supports a moreefficient recovery mechanism. Our extensive experimental study shows that DGCCachieves up to four times higher throughput compared to that ofstate-of-the-art concurrency control protocols for high contention workloads.

DGCC:A New Dependency Graph based Concurrency Control Protocol for Multicore Database Systems