{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T11:18:19Z","timestamp":1717499899089},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p>The three traditional failure classes are system, media, and transaction failures. Sometimes, however, modern storage exhibits failures that differ from all of those. In order to capture and describe such cases, single-page failures are introduced as a fourth failure class. This class encompasses all failures to read a data page correctly and with plausible contents despite all correction attempts in lower system levels.<\/jats:p>\n          <jats:p>Efficient recovery seems to require a new data structure called the page recovery index. Its transactional maintenance can be accomplished writing the same number of log records as today's efficient implementations of logging and recovery. Detection and recovery of a single-page failure can be sufficiently fast that the affected data access is merely delayed, without the need to abort the transaction.<\/jats:p>","DOI":"10.14778\/2180912.2180917","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"646-655","source":"Crossref","is-referenced-by-count":9,"title":["Definition, detection, and recovery of single-page failures, a fourth class of database failures"],"prefix":"10.14778","volume":"5","author":[{"given":"Goetz","family":"Graefe","sequence":"first","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harumi","family":"Kuno","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989353"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254917"},{"key":"e_1_2_1_3_1","volume-title":"FAST 2008:  223--238","author":"Bairavasundaram Lakshmi N.","unstructured":"Lakshmi N. Bairavasundaram , Garth R. Goodson , Bianca Schroeder , Andrea C. Arpaci-Dusseau , Remzi H. Arpaci-Dusseau : An analysis of data corruption in the storage stack . FAST 2008: 223--238 . Lakshmi N. Bairavasundaram, Garth R. Goodson, Bianca Schroeder, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau: An analysis of data corruption in the storage stack. FAST 2008: 223--238."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Jim Gray: Notes on data base operating systems. In: Advanced course: operating systems. 1978: 393--481.   Jim Gray: Notes on data base operating systems. In: Advanced course: operating systems. 1978: 393--481.","DOI":"10.1007\/3-540-08755-9_9"},{"key":"e_1_2_1_8_1","first-page":"672","volume":"2004","author":"Graefe Goetz","unstructured":"Goetz Graefe : Write-optimized B-trees. VLDB 2004 : 672 -- 683 . Goetz Graefe: Write-optimized B-trees. VLDB 2004: 672--683.","journal-title":"Write-optimized B-trees. VLDB"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000028"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2109196.2109197"},{"key":"e_1_2_1_11_1","volume-title":"Hideaki Kimura","author":"Graefe Goetz","year":"2012","unstructured":"Goetz Graefe , Hideaki Kimura , Harumi Kuno : Foster B-trees. Submitted for publication ( 2012 ). Goetz Graefe, Hideaki Kimura, Harumi Kuno: Foster B-trees. Submitted for publication (2012)."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356847"},{"key":"e_1_2_1_13_1","volume-title":"Andreas Reuter: Transaction processing: concepts and techniques. Morgan Kaufmann","author":"Gray Jim","year":"1992","unstructured":"Jim Gray , Andreas Reuter: Transaction processing: concepts and techniques. Morgan Kaufmann 1992 . Jim Gray, Andreas Reuter: Transaction processing: concepts and techniques. Morgan Kaufmann 1992."},{"key":"e_1_2_1_14_1","first-page":"27","article-title":"Efficient verification of B-tree integrity","volume":"2009","author":"Graefe Goetz","unstructured":"Goetz Graefe , Ryan Stonecipher : Efficient verification of B-tree integrity . BTW 2009 : 27 -- 46 . Goetz Graefe, Ryan Stonecipher: Efficient verification of B-tree integrity. BTW 2009: 27--46.","journal-title":"BTW"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/289.291"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_17_1","volume-title":"ICDE 1995:  324--331","author":"Mohan C.","unstructured":"C. Mohan : Disk read-write optimizations and data integrity in transaction systems using write-ahead logging . ICDE 1995: 324--331 . C. Mohan: Disk read-write optimizations and data integrity in transaction systems using write-ahead logging. ICDE 1995: 324--331."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/128765.128770"},{"key":"e_1_2_1_19_1","unstructured":"Henrik Olsen: http:\/\/www.bautforum.com\/showthread.php\/82200 posted on 12\/9\/2008 retrieved on 2\/29\/2012.  Henrik Olsen: http:\/\/www.bautforum.com\/showthread.php\/82200 posted on 12\/9\/2008 retrieved on 2\/29\/2012."},{"key":"e_1_2_1_20_1","volume-title":"Markus Kirchberg: D-ARIES: a distributed version of the ARIES recovery algorithm. ADBIS Research Communications","author":"Speer Jayson","year":"2005","unstructured":"Jayson Speer , Markus Kirchberg: D-ARIES: a distributed version of the ARIES recovery algorithm. ADBIS Research Communications 2005 . Jayson Speer, Markus Kirchberg: D-ARIES: a distributed version of the ARIES recovery algorithm. ADBIS Research Communications 2005."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2180912.2180917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:12:17Z","timestamp":1672222337000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2180912.2180917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.14778\/2180912.2180917"],"URL":"https:\/\/doi.org\/10.14778\/2180912.2180917","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}