The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Mar. 01, 2016

Filed:

Jan. 17, 2012
Applicants:

Owen Joseph Strain, San Francisco, CA (US);

Wenguang Wang, Santa Clara, CA (US);

Inventors:

Owen Joseph Strain, San Francisco, CA (US);

Wenguang Wang, Santa Clara, CA (US);

Assignee:

Apple Inc., Cupertino, CA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 7/00 (2006.01); G06F 17/00 (2006.01); G06F 17/30 (2006.01); G06F 15/16 (2006.01);
U.S. Cl.
CPC ...
G06F 17/30362 (2013.01); G06F 17/30327 (2013.01); G06F 17/30961 (2013.01);
Abstract

The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node.


Find Patent Forward Citations

Loading…