Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"B+ trees"”.
-
Replication control in distributed B-trees
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
On the performance of B-trees using dynamic address computation
… by Cook that can be used to implement B-trees using no pointers. A minimal amount of storage (in addition to the keys) is required. An implementation of Dynamic Address Computation and a B-tree management package is described. Analytical performance measures are derived in an attempt to …
-
BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B⁺-trees
… update speed by using large leaf nodes. B⁺-trees are a fundamental data structure for implementing in-memory indexes in databases and storage systems. B⁺- trees support both point operations (i.e., inserts and finds) and range operations (i.e., iterators and maps). There is an inherent …
-
Template B+ trees: an index scheme for fast data streams with distributed append-only stores
… traditional index structures based on B+ trees and their variants to create an efficient in-memory template-based tree without the overhead of expensive node splits. We also propose the use of optimized domain partitioning and multi-thread insertion techniques to exploit the advantages of …
-
Designing Compact On-Disk Index Data Structures
… Many database systems have chosen B+-trees as the on-disk index data structure. A B+-tree organizes every internal node in a block of the I/O unit so that the reads would incur minimum I/Os. However, writes in B+-trees are slow because a single write often causes multiple blocks to be …
-
External-memory search trees with fast insertions
… regarding external-memory dynamic search trees with fast insertions. The first contribution is the implementation of the buffered repository B-tree, a data structure that provably outperforms B-trees for updates at the cost of a constant factor decrease in query performance. This thesis …
-
A hybrid data structure for dense keys in in-memory database systems
… to 50% compared to an implementation based on B+Trees, and showed even more dramatic performance gains in the presence of few and large clusters of data.
-
Cache-oblivious dynamic search trees
… faster than a memory mapped implementation of B-trees. The packed memory array of the COB-Tree maintains data in sorted order, allows sequential reads at high speeds, and data insertions and deletions with few data writes on average. In addition, the data, structure is easy to implement because I …
-
Correlation indices : a new access method to exploit correlated attributes
… times by 5 to 20 times over both unclustered B+Trees and sequential scans. The strong experimental results suggest that CIs offer practical and substantial benefits in a variety of useful query scenarios.
-
Fast in-memory storage systems : two aspects
… key prefixes, Masstree arranges a set of B+trees into a Trie. Masstree uses software prefetch to further hide DRAM latency. Several optimizations improve concurrency. Masstree achieves millions of queries per second on a 16-core server, which is more than 30x as fast as MongoDB [6] or VoltDB …
-
Efficient Concurrent Operations in Spatial Databases
… by the Space-Filling Curve (SFC) combined with B-trees. Concurrency control protocols have been designed for some pure multidimensional indexing structures, but none of them is suitable for variants of R-trees with object clipping, which are efficient in searching. On the other hand, there is no …
-
On indexing large databases for advanced data models
… method. Our experiments demonstrate that EPS-trees achieve excellent search and update performance, comparable to that of B+-trees on one-dimensional datasets. Our experiments with large datasets demonstrate the scalability and robustness of our techniques. We also affirm the relevance of …