发明申请
- 专利标题: OPTIMIZED B-TREE
- 专利标题(中): 优化B-TREE
-
申请号: US13352256申请日: 2012-01-17
-
公开(公告)号: US20130185271A1公开(公告)日: 2013-07-18
- 发明人: Owen Joseph Strain , Wenguang Wang
- 申请人: Owen Joseph Strain , Wenguang Wang
- 申请人地址: US CA Cupertino
- 专利权人: Apple Inc.
- 当前专利权人: Apple Inc.
- 当前专利权人地址: US CA Cupertino
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
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.
公开/授权文献
- US09275096B2 Optimized b-tree 公开/授权日:2016-03-01
信息查询