Efficient rename in a lock-coupled traversal of B+tree
作者： Saikrishnan Krishnamurthy
DOI:
关键词:
摘要: Highly concurrent systems use lock-coupling for tree traversal wherein only two levels (parent and current) are locked at any time. The parent lock is released as soon successful attained on the grandchild. rename technique described here facilitates using finer grained locking multiple path traversals by changing ownerships.
lens.org 参考文章(26)
Ragaa Ishak, Yijhye J. Hwang, Method and system for restructuring a B-Tree for managing data during a node splitting operation ,(1995)
Paul Bowden, Arthur J. Beaverson, Namespace file system accessing an object store ,(2010)
Owen Joseph Strain, Wenguang Wang, Optimized b-tree ,(2012)
Arnon Kanfi, System and method for managing filesystem objects ,(2012)
David Irvine, Distributed file systems ,(2011)
Frank E. Levine, Chandrasekaran Mohan, Method and apparatus for concurrent modification of an index tree in a transaction processing system utilizing selective indication of structural modification operations ,(1988)
Jain Nitin, Eric A. Anderson, Joseph A. Tucek, File system management and balancing ,(2012)
Uresh Vahalia, Kang Wei, Jean-Pierre B. Bono, Fengcheng Lu, System and method of file locking in a network file system federated namespace ,(2010)
David A. Majnemer, Wenguang Wang, Concurrent access methods for tree data structures ,(2012)
Daniel A. Muntz, Christos Karamanolis, Mallik Mahalingam, Zheng Zhang, Namespace management in a distributed file system ,(2001)