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 56 for “"B tree"”.
-
The Ubiquitous B-tree: Volume II
Major developments relating to the B-tree from early 1979 through the fall of 1986 are presented. This updates the well-known article, "The Ubiquitous B-Tree" by Douglas Comer (Computing Surveys, June 1979). After a basic overview of B and B+ trees, recent research is cited as well as descriptions …
-
Relaxed B+ tree for managing disjoint intervals
… to the poor cache locality of traditional binary trees. Although the Maple Tree mitigates this issue, its coupling to the Linux kernel and its implementation in C pose challenges for portability and for developing memory-safe implementations. This work proposes the Disjoint Interval B+ Tree …
-
Practical performance considerations for the perfetching B+-tree
… be delivered from main-memory. In particular, B+-trees have been shown to utilize cache memory poorly, triggering the development of many cache-conscious indices. While early studies of cache-conscious indices used simulation models, the trend has recently swung towards performance measurements on …
-
A scalable video streaming approach using distributed b-tree
… streaming video. We developed a distributed B-tree, and stored video files in the B- tree which runs over a cluster of computers and served from there. We show that system throughput increases almost linearly when more computers are added to the system.
-
A User Configurable B-tree Implementation as a Utility
<p>B-trees are widely used in management of data to support good performance for storage, retrievals and updates. Many excellent implementations of B-tree exist in industry and academia. However, it is hard to find one that is easily configurable for clients who need to create and use B-trees. In …
-
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 …
-
Distributed true string B-tree peer-to-peer overlay networks
… network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A …
-
B*tree representation based thermal and variability aware floorplanning frame work
… The purpose of the thesis is to develop a B*-Tree based floorplanner with two major objectivesFirst, we present an interconnect and thermal-aware floorplanner that aims at reducing hot spots and distributing temperature evenly across a chip while optimizing the traditional design metrics, chip …
-
Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems
… on the improvement of the performance of B-Trees in highly concurrent and distributed environments, as well as in memory, for shared-memory mul- tiprocessors. However, little focus has been given to the performance of main memory B-Trees for NUMA systems. This work focuses on improving the …
-
A B+-tree index for the know-it-all database framework
An efficient implementation of search trees is crucial for any database systems. The B+-tree is one of the most widely and studied data structures and provides an efficient index structure for databases. The Index subframework is a component of the Know-It-All database framework. It covers …
-
A B-tree implementation of MUMPS global arrays using variable length keys
… the data base are hierarchically organized tree file structures called "global arrays".</p> <p>As with any data base management facility, the requirement to service an interactive user is highly dependent upon the speed with which a given token of information can be stored, deleted, and …
-
Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency
… is to study the properties of a distributed tree data-structure that allow searches, insertions and deletions of data elements. In particular, the b- tree structure [13] is considered, which is a generalization of a binary search tree. The study consists of analyzing the effect of …
-
B-tree concurrency control and recovery in a client-server database management system
… the physical database is organized as a sparse B±tree or B-link-tree index. Client transactions perform their operations on cached copies of index and data pages. A client transaction can contain any number of operations of the form "fetch the first (or next) matching record", "insert a record", …
-
Coarse-Grained, Fine-Grained, and Lock-Free Concurrency Approaches for Self-Balancing B-Tree
… approaches for a standard, unmodified B-Tree which is one of the more complex data structures. This includes the coarse grained, fine-grained locking, and the lock-free approaches. The basic industry standard coarse-grained approach is used as a base-line for comparison to the more …
-
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 …
-
Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts
… sorted array into the level-order binary search tree (BST), level-order B-tree (B-tree), and van Emde Boas (vEB) layouts in-place. We analytically determine the complexity of our algorithms and empirically measure their performance. Given N elements and P processors, our fastest algorithms have a …
-
Batch updates and concurrency control in B-trees
… keys are to be inserted (or deleted) into a B-tree at about the same time, it is often profitable to sort the keys in the main memory before performing updates to the B-tree on disk. Thus, updates falling into the same leaf of the B-tree can be performed simultaneously and disk accesses are …
-
Indexing on memory-constrained embedded devices
… While database indexes such as the popular B-tree have been adapted to flash storage on servers and solid state drives, these optimizations typically demand hardware and memory resources beyond what is available on embedded devices. This work introduces both index types for memory-constrained …
-
Accessing multiversion data in database transactions
… multiversion index, such as the multiversion B+-tree (MVBT) of Becker et al. The MVBT is optimal, so that any version of the database can be accessed as efficiently as with a single-version B+-tree that is used to index only the data items of that version, but it cannot be used in a full-fledged …
Page 1 of 3