Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Fractal_tree_index> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Fractal_tree_index abstract "In computer science, a Fractal Tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree but with insertions and deletions that are asymptotically faster than a B-tree. Like a B-tree, a Fractal Tree index is a generalization of a binary search tree in that a node can have more than two children. Furthermore, unlike a B-tree, a Fractal Tree index has buffers at each node, which allow insertions, deletions and other changes to be stored in intermediate locations. The goal of the buffers is to schedule disk writes so that each write performs a large amount of useful work, thereby avoiding the worst-case performance of B-trees, in which each disk write may change a small amount of data on disk. Like a B-tree, Fractal Tree indexes are optimized for systems that read and write large blocks of data. The Fractal Tree index has been commercialized in databases by Tokutek. Originally, it was implemented as a cache-oblivious lookahead array, but the current implementation is an extension of the Bε tree. The Bε is related to the Buffered Repository Tree. The Buffered Repository Tree has degree 2, whereas the Bε tree has degree Bε. The Fractal Tree index has also been used in a prototype filesystem. An open source implementation of the Fractal Tree index is available, which demonstrates the implementation details outlined below.".
- Fractal_tree_index wikiPageID "41058483".
- Fractal_tree_index wikiPageRevisionID "606796287".
- Fractal_tree_index deleteAvg "O".
- Fractal_tree_index deleteWorst "O".
- Fractal_tree_index insertAvg "O".
- Fractal_tree_index insertWorst "O".
- Fractal_tree_index inventedBy Bradley_C._Kuszmaul.
- Fractal_tree_index inventedBy Martin_Farach-Colton.
- Fractal_tree_index inventedBy Michael_A._Bender.
- Fractal_tree_index inventedYear "2007".
- Fractal_tree_index name "Fractal Tree index".
- Fractal_tree_index searchAvg "O".
- Fractal_tree_index searchWorst "O".
- Fractal_tree_index spaceAvg "O".
- Fractal_tree_index spaceWorst "O".
- Fractal_tree_index type "tree".
- Fractal_tree_index subject Category:Database_index_techniques.
- Fractal_tree_index subject Category:Trees_(data_structures).
- Fractal_tree_index comment "In computer science, a Fractal Tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree but with insertions and deletions that are asymptotically faster than a B-tree. Like a B-tree, a Fractal Tree index is a generalization of a binary search tree in that a node can have more than two children.".
- Fractal_tree_index label "Fractal tree index".
- Fractal_tree_index sameAs m.010fbywp.
- Fractal_tree_index sameAs Q17014592.
- Fractal_tree_index sameAs Q17014592.
- Fractal_tree_index wasDerivedFrom Fractal_tree_index?oldid=606796287.
- Fractal_tree_index isPrimaryTopicOf Fractal_tree_index.