publication . Other literature type . Preprint . Conference object . 2016

Fast Failure Recovery for Main-Memory DBMSs on Multicores

Yingjun Wu; Wentian Guo; Chee-Yong Chan; Kian-Lee Tan;
  • Published: 11 Apr 2016
  • Publisher: Association for Computing Machinery (ACM)
Abstract
Main-memory database management systems (DBMS) can achieve excellent performance when processing massive volume of on-line transactions on modern multi-core machines. But existing durability schemes, namely, tuple-level and transaction-level logging-and-recovery mechanisms, either degrade the performance of transaction processing or slow down the process of failure recovery. In this paper, we show that, by exploiting application semantics, it is possible to achieve speedy failure recovery without introducing any costly logging overhead to the execution of concurrent transactions. We propose PACMAN, a parallel database recovery mechanism that is specifically desi...
Subjects
free text keywords: Computer Science - Databases, Transaction processing, Exploit, Semantics, Stored procedure, Compile time, Durability, Parallel database, Computer science, Degree of parallelism, Database, computer.software_genre, computer
Related Organizations
37 references, page 1 of 3

[1] http://llvm.org/docs/passes.html.

[2] http://oltpbenchmark.com/.

[3] F. E. Allen. Control flow analysis. In ACM SIGPLAN Notices, 1970.

[4] T. M. Austin and G. S. Sohi. Dynamic dependency analysis of ordinary programs. In ISCA, 1992. [OpenAIRE]

[5] A. J. Bernstein, D. S. Gerstl, and P. M. Lewis. Concurrency control for step-decomposed transactions. Information Systems, 1999.

[6] T. Cao, M. Vaz Salles, B. Sowell, Y. Yue, A. Demers, J. Gehrke, and W. White. Fast checkpoint recovery algorithms for frequently consistent applications. In SIGMOD, 2011.

[7] A. Cheung, S. Madden, O. Arden, and A. C. Myers. Automatic partitioning of database applications. In VLDB, 2012. [OpenAIRE]

[8] D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. A. Wood. Implementation techniques for main memory database systems. In SIGMOD, 1984. [OpenAIRE]

[9] D. E. Difallah, A. Pavlo, C. Curino, and P. Cudre-Mauroux. Oltp-bench: An extensible testbed for benchmarking relational databases. In VLDB, 2013. [OpenAIRE]

[10] H. Garcia-Molina. Using semantic knowledge for transaction processing in a distributed database. TODS, 1983.

[11] H. Garcia-Molina and K. Salem. Sagas. In SIGMOD, 1987.

[12] R. Johnson, I. Pandis, N. Hardavellas, A. Ailamaki, and B. Falsafi. Shore-mt: A scalable storage manager for the multicore era. In EDBT, 2009. [OpenAIRE]

[13] R. Johnson, I. Pandis, R. Stoica, M. Athanassoulis, and A. Ailamaki. Aether: a scalable approach to logging. In VLDB, 2010. [OpenAIRE]

[14] R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. C. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi. H-store: A high-performance, distributed main memory transaction processing system. In VLDB, 2008. [OpenAIRE]

[15] A. Kemper and T. Neumann. Hyper: A hybrid oltp&olap main memory database system based on virtual memory snapshots. In ICDE, 2011.

37 references, page 1 of 3
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue