B-Tree Based Data Model for File Systems
作者： Jeremy Fitzhardinge
DOI:
关键词:
摘要: Methods and systems for organizing data are provided. An example method includes providing an object store to objects. Each of the objects represents fragments is associated with address. The further allows associating a B-tree store. nodes, wherein each nodes keys, keys at least one from Values generated based partially on If size less than pre-determined size, value stored in particular node B-tree, including key object. Otherwise, storing address B-tree.
lens.org 参考文章(39)
Jonathan M. Cargille, William R. Tipton, Thomas J. Miller, Surendra Verma, Hierarchical allocation for file system storage device ,(2011)
Frank E. Barrus, Reference counter integrity checking ,(2014)
Adam Polly, Jutta Staerck, Michael Hartel, Marcel Hermanns, Business Object Data Structures with Node Keys ,(2012)
Yekesa Kosuru, Alexey Yakubovich, Method and apparatus for providing a range ordered tree structure ,(2011)
Changming Liu, Lin Chen, Xiaosong Yang, Protection of database operations ,(2010)
Frank E. Barrus, Tad Hunt, Cryptographic hash database ,(2013)
Gerrit Simon Kazmaier, Baré Said, Wolfgang Pfeifer, Jan Telchmann, Common modeling of data access and provisioning for search, query, reporting and/or analytics ,(2010)
Kenneth D. McCracken, Zane Zheng Yan Pan, Fujian Yang, Method and apparatus for providing a list-based interface to key-value stores ,(2011)
John Douglas Curtis, Gary Paul Rheaume, Jonathan David Champlin, Preventing transfer and duplication of redundantly referenced objects across nodes of an application system ,(2009)
Drex Dixon, Ethan Barnes, Jonathan Ludwig, Apparatus, system, and method for a persistent object store ,(2011)