Integrating reliable memory in databases
dc.contributor.author | Chen, Peter M. | en_US |
dc.contributor.author | Ng, Wee Teck | en_US |
dc.date.accessioned | 2006-09-08T20:13:22Z | |
dc.date.available | 2006-09-08T20:13:22Z | |
dc.date.issued | 1998-08 | en_US |
dc.identifier.citation | Ng, Wee Teck; Chen, Peter M.; (1998). " Integrating reliable memory in databases." The VLDB Journal 7(3): 194-204. <http://hdl.handle.net/2027.42/42329> | en_US |
dc.identifier.issn | 1066-8888 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/42329 | |
dc.description.abstract | Recent results in the Rio project at the University of Michigan show that it is possible to create an area of main memory that is as safe as disk from operating system crashes. This paper explores how to integrate the reliable memory provided by the Rio file cache into a database system. Prior studies have analyzed the performance benefits of reliable memory; we focus instead on how different designs affect reliability. We propose three designs for integrating reliable memory into databases: non-persistent database buffer cache, persistent database buffer cache, and persistent database buffer cache with protection. Non-persistent buffer caches use an I/O interface to reliable memory and require the fewest modifications to existing databases. However, they waste memory capacity and bandwidth due to double buffering. Persistent buffer caches use a memory interface to reliable memory by mapping it into the database address space. This places reliable memory under complete database control and eliminates double buffering, but it may expose the buffer cache to database errors. Our third design reduces this exposure by write protecting the buffer pages. Extensive fault tests show that mapping reliable memory into the database address space does not significantly hurt reliability. This is because wild stores rarely touch dirty, committed pages written by previous transactions. As a result, we believe that databases should use a memory interface to reliable memory. | en_US |
dc.format.extent | 123181 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; Springer-Verlag Berlin Heidelberg | en_US |
dc.subject.other | Legacy | en_US |
dc.subject.other | Key Words:Reliability – Recovery – Main Memory Database System (MMDB) | en_US |
dc.title | Integrating reliable memory in databases | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Computer Science and Engineering Division, Department of Electrical Engineering and Computer Science, 1301 Beal Avenue, University of Michigan, Ann Arbor, MI 48109-2122, USA, US | en_US |
dc.contributor.affiliationum | Computer Science and Engineering Division, Department of Electrical Engineering and Computer Science, 1301 Beal Avenue, University of Michigan, Ann Arbor, MI 48109-2122, USA, US | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/42329/1/778-7-3-194_80070194.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s007780050063 | en_US |
dc.identifier.source | The VLDB Journal | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.