Stratified B-trees and Versioned Dictionaries
暂无分享,去创建一个
Andrew Twigg | Andrew Byde | Grzegorz Milos | Tim D. Moreton | John Wilkes | Tom Wilkie | J. Wilkes | Grzegorz Milos | Andrew Twigg | A. Byde | Tom Wilkie
[1] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.
[2] Eric Mays,et al. Fully persistent B+-trees , 1991, SIGMOD '91.
[3] Sailesh Chutani,et al. The Episode File System , 1992 .
[4] James Lau,et al. File System Design for an NFS File Server Appliance , 1994, USENIX Winter.
[5] Bernhard Seeger,et al. An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.
[6] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[7] Val Henson,et al. The Zettabyte File System , 2003 .
[8] Charles E. Leiserson,et al. Cache-Oblivious Algorithms , 2003, CIAC.
[9] Craig A. N. Soules,et al. Metadata Efficiency in Versioning File Systems , 2003, FAST.
[10] Rudolf Bayer,et al. Organization and maintenance of large ordered indexes , 1972, Acta Informatica.
[11] Michael A. Bender,et al. Cache-oblivious streaming B-trees , 2007, SPAA '07.
[12] OHAD RODEH,et al. B-trees, shadowing, and clones , 2008, TOS.
[13] Andrew Twigg,et al. Optimal query/update tradeoffs in versioned dictionaries , 2011, ArXiv.