Historically, the internal architecture of database management systems (DBMS) is predicated on the storage of data in heavily-encoded disk blocks and the use of an in-memory buffer pool as a cache. The expense of managing disk-resident data has fostered a new class of high-performance DBMSs that store the entire database in main memory. The fundamental problem with these systems, however, is that their improved performance is only achievable when the database is smaller than the amount of physical memory available in the system.
I will present a new DBMS architecture, called "anti-caching," that reverses the traditional hierarchy of disk-oriented systems to overcome this limitation. With an anti-caching system, all data initially resides in memory, and when memory is exhausted, the least-recently accessed records are collected and written to disk. We have implemented a prototype of our anti-caching proposal in a NewSQL DBMS and compared it to a well-tuned disk-based DBMS. Our recent VLDB paper shows that as the size of the database increases, the anti-caching DBMS maintains a significant performance advantage over the disk-based systems. Based on these results, we contend that our anti-caching architecture is preferable over traditional, disk-oriented systems for any front-end OLTP application.
Andy Pavlo is an Assistant Professor in the Computer Science department at Carnegie Mellon University.
His research interest is on database management systems. He is from the streets.
|Date||Location||Open To Public?||Time|
|Tuesday January 21||Univ. of California, Santa Cruz||YES||12:00pm|
|Wednesday January 22||Univ. of California, Berkeley||YES||12:00pm|
|Thursday January 23||Clustrix||-||12:00pm|
|Thursday January 23||Dropbox||-||2:00pm|
|Friday January 24||Oracle||-||12:00pm|
|Friday January 24||Stanford University||YES||4:00pm|
|Wednesday February 5||University of Pittsburgh||YES||3:00pm|