Self-diagnosing and self-healing indexes

Proceedings of the 5th International Workshop on Testing Database Systems, DBTest'12

Volumn , Issue , 2012, Pages

  Graefe, Goetz ^a,b   Kuno, Harumi ^a,b   Seeger, Bernhard ^a,b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

B tree; Failure; Quality assurance; Recovery

Indexed keywords

AUTOMATIC RECOVERY; B-TREE; CONSISTENCY CONSTRAINTS; CONSISTENT STATE; CRITICAL SECTIONS; INDEX STRUCTURE; MANY-CORE; RELIABILITY AND AVAILABILITY; ROOT CAUSE ANALYSIS; SELF-HEALING; TEST EXECUTION; TEST FAILURE; TESTING SOFTWARE; TREE STRUCTURES;

COMPUTER SYSTEM RECOVERY; DATABASE SYSTEMS; FORESTRY; PROGRAM PROCESSORS; QUALITY ASSURANCE; RECOVERY; TREES (MATHEMATICS); VERIFICATION;

SOFTWARE TESTING;

COMPUTER PROGRAMS; COMPUTERS; FAILURE; MATHEMATICS; QUALITY CONTROL; RECOVERY; TESTING; TREES;

EID: 84864033169     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2304510.2304521     Document Type: Conference Paper

References (15)

1. Nedyalko Borisov, Shivnath Babu, Nagapramod Mandagere, Sandeep Uttamchandani: Warding off the dangers of data corruption with Amulet. ACM SIG-MOD 2011: 277-288.
2. Goetz Graefe: Write-optimized B-trees. VLDB 2004: 672-683.
3. Goetz Graefe: A survey of B-tree locking techniques. ACM TODS 35(3) (2010).
4. Goetz Graefe: A survey of B-tree logging and recovery techniques. ACM TODS 37(1):1 (2012).
5. Goetz Graefe, Harumi A. Kuno: Definition, detection, and recovery of single-page failures, a fourth class of database failures. PVLDB 5(7):646-655 (2012).
6. Goetz Graefe, Hideaki Kimura, Harumi Kuno: Foster B-trees. Submitted for publication (2012).
7. Goetz Graefe, Ryan Stonecipher: Efficient verification of B-tree integrity. BTW 2009: 27-46.
8. http://www.thefreedictionary.com/Foster+parent, retrieved April 13, 2012.
9. Daniel Fryer, Kuei Sun, Rahat Mahmood, TingHao Cheng, Shaun Benjamin, Ashvin Goel, Angela Demke Brown: Recon: verifying file system consistency at runtime. USENIX FAST 2012: 73-86.
10. David B. Lomet: Simple, robust and highly concurrent B-trees with node deletion. ICDE 2004: 18-27.
11. Philip L. Lehman, S. Bing Yao: Efficient locking for concurrent operations on B-trees. ACM TODS 6(4): 650-670 (1981).
12. C. Mohan: ARIES/KVL: a key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. VLDB 1990: 392-405.
13. C. Mohan, Donald J. Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz: ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM TODS 17(1): 94-162 (1992). (Pubitemid 23609944)
14. C. Mohan, Frank E. Levine: ARIES/IM: an efficient and high concurrency index management method using write-ahead logging. ACM SIGMOD 1992: 371-380.
15. Mendel Rosenblum, John K. Ousterhout: The design and implementation of a log-structured file system. ACM TOCS 10(1): 26-52 (1992). (Pubitemid 23598979)