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 20 of 22 for “"B tree"”.
-
Comparative study on data searching in linked list & B-tree and B+tree techniques
… are used in this work namely; linked list, B-tree, and B+ tree. A comparison analysis is conducted using five case databases studies. Experimental results reveal that after the average times for each search algorithms on the databases have been recorded, the linked list requires lots of time …
-
Re-engineering a B-tree implementation using design patterns
… for the design process. The evolution of a B-tree indexing system, which is a component in a database management system, is presented to illustrate how design patterns clarify the design and make it more understandable. This re-engineering is a necessary step towards a reusable design and …
-
On the performance of B-trees using dynamic address computation
The B-tree is a one of the more popular methods in use today for indexes and inverted files in database management systems. The traditional implementation of a Bâ tree uses many pointers (more than one per key), which can directly affect the performance of the B-tree. A general method of file …
-
BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B⁺-trees
This thesis presents the BP-tree, an efficient concurrent key-value store based on the B⁺-tree, that uses large leaf nodes to optimize for range-query performance without sacrificing update speed by using large leaf nodes. B⁺-trees are a fundamental data structure for implementing in-memory indexes …
-
A hybrid data structure for dense keys in in-memory database systems
… The proposed data structure consists of a B+ Tree with intervals as keys, and arrays as values. Each array holds a cluster of values, while the clusters themselves are managed by the B+ Tree for space and cache efficiency. Using the H-Tree as an in-memory indexing structure for an …
-
Storage system design for non-volatile byte-addressable memory using consistent and durable data structures
… When compared to a memory-backed Berkeley DB B-Tree, our prototype- based results show that a CDDS B-Tree can increase put and get throughput by 74% and 138%. Tembo, a CDDS B-Tree enabled distributed Key-Value system, has up to 250%–286% higher throughput than Cassandra, a two-level data store.
-
Cache-oblivious dynamic search trees
… implemented a cache-oblivious dynamic search tree as an alternative to the ubiquitious B-tree. I use a binary tree with a "van Endcle Boas" layout whose leaves point to intervals in a "packed memory structure". We refer to the data structure as a COB-Tree. The COB-Tree supports efficient …
-
Memory-mapped transactions
… serial, memory-mapped implementations of a B+-tree and a cache-oblivious B-tree into parallel versions that support concurrent searches and insertions.
-
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 …
-
Virtual forced splitting in multidimensional access methods
External, tree-based, multidimensional access methods typically attempt to provide B+ tree like behaviour and performance in the organisation of large collections of multidimensional data. The B+ tree’s efficiency comes directly from the fact that it organises data occupying a single dimension, …
-
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 …
-
Proposta de um framework conceitual para apoiar a criação de técnicas de indexação para banco de dados temporais
… de desempenho e portabilidade. São exemplos B-Tree, B+-Tree e R-Tree, entre outras. Estas técnicas não suportam indexar os complexos BDTs, mas são fundamentais para que sirvam de base para novas estruturas que suportem esses tipos de dados. As técnicas de indexação para dados temporais …
-
Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks
… of graph partitioning and a set of composite B+-tree local indexes tuned for a given query load and a given data distribution in the network space. D-PARINET studies continuous update of trajectory data and use interpolation to predict future MO movement in the network. PARINET and D-PARINET can …
-
A paging scheme for pointer-based quadtrees
The quadtree is a family of data structures that organize spatial data using recursive subdivision. A pointer-based quadtree uses an explicit tree structure to represent the subdivision, while a linear quadtree holds a sorted list of records corresponding to the leaves of the tree structure. Small …
-
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 …
-
Retina: Cross-Layered Key-Value Store using Computational Storage
… fully utilizing the IO bandwidth. LSM or B+ tree-based key-value stores involve complex garbage collection and store sorted keys and complicated synchronization mechanisms. In this work, we propose a cross-layered key-value store named Retina that decouples the design to delegate control path …
-
Global optimization algorithms for semi-infinite and generalized semi-infinite programs
… subproblems arise very high in the B&B tree and render global solution of the whole problem infeasible.
-
Correlation indices : a new access method to exploit correlated attributes
… against sequential scans and unclustered B+Tree indices in the popular Berkeley DB [22] library. Experimental results over three different data sets validate the accuracy of the cost model and establish numerous cases where CIs accelerate lookup times by 5 to 20 times over both unclustered …
Page 1 of 2