- Patent Title: Efficient repair of B+ tree databases with variable-length records
-
Application No.: US15142850Application Date: 2016-04-29
-
Publication No.: US10002055B2Publication Date: 2018-06-19
- Inventor: Richard P. Jernigan, IV
- Applicant: NetApp, Inc.
- Applicant Address: US CA Sunnyvale
- Assignee: NETAPP, INC.
- Current Assignee: NETAPP, INC.
- Current Assignee Address: US CA Sunnyvale
- Agency: Klein, O'Neill & Singh, LLP
- Main IPC: G06F11/00
- IPC: G06F11/00 ; G06F11/14

Abstract:
Presented herein are methods, non-transitory computer readable media, and devices for efficiently repairing tree databases with variable-length records. Methods for repairing tree databases with variable-length records are disclosed which include: iterating the tree database, detecting at least one recoverable leaf block, reducing the at least one recoverable leaf block to its legally formatted contents, and writing the at least one recoverable leaf block back into the tree database; processing the at least one recoverable leaf block to ensure the at least one recoverable leaf block represents a disjoint region within a record space within the tree database; and rebuilding branch blocks as necessary to provide a lookup and organizational index for the at least one recoverable leaf block.
Public/Granted literature
- US20170315881A1 EFFICIENT REPAIR OF B+ TREE DATABASES WITH VARIABLE-LENGTH RECORDS Public/Granted day:2017-11-02
Information query