B Trees

@inproceedings{Zhang2004BT,
  title={B Trees},
  author={Donghui Zhang},
  booktitle={Handbook of Data Structures and Applications},
  year={2004}
}
  • Donghui Zhang
  • Published in
    Handbook of Data Structures…
    2004
  • Computer Science
• B-trees are balanced search trees designed to work well on magnetic disks or other direct-access secondary storage devices. • B-tree nodes may have many children, from a handful to thousands. That is called the "branching factor" of a B-tree. • Every n-node B-tree has height O(lg n), therefore, B-trees can be used to implement many dynamic-set operations in time O(lg n). • B-trees generalize binary search trees in a natural manner. – If a B-tree node x contains n[x] keys, then x has n[x] + 1… 

Deletion Without Rebalancing in Binary Search Trees

TLDR
The vexing issue of deletions in balanced trees is addressed with a relaxation of AVL trees in which rebalancing is done after insertions but not after deletions, yet worst-case access time remains logarithmic in the number of insertions.

Efficient Bulk Updates on Multiversion B-trees

TLDR
This paper proposes the first loading algorithm for MVBT that meets the lower-bound of external sorting and is applicable to bulk updates, achieved by combining two basic technologies, weight balancing and buffer tree.

Minuet: A Scalable Distributed Multiversion B-Tree

TLDR
Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance, and supports writable clones, so that users can create branching versions of the data.

A lock-free B+tree

TLDR
This paper presents the first design of a lock-free, dynamic, and balanced tree, specifically, a B+tree, that employs standard compare-and-swap operations.

FineLine: log-structured transactional storage and recovery

TLDR
This paper proposes a novel approach for transactional storage and recovery called FineLine, which simplifies the implementation of transactional database systems by eliminating the log-database duality and maintaining all persistent data in a single, log-structured data structure.

A Lock-Free

TLDR
This paper presents the first design of a lock-free, dynamic, and balanced tree, specifically, a Btree, that employs standard compare-and-swap operations.

Indexing Structures for Range Searching with Point Objects: A Survey

TLDR
This paper discusses the various indexing structures for range queries in details and possible ways of implementing them in relational databases.

HMVFS: A Versioning File System on DRAM/NVM Hybrid Memory

Going Back and Forth: Efficient Virtual Machine Image Deployment and Snapshotting on IaaS Clouds

TLDR
This paper proposes a lazy transfer scheme based on object-versioning that transfers only the needed content on-demand that greatly reduces total time for execution time, network traffic and storage space, which translates into lower end-user costs.

Multiple Crossover and Mutation Operators Enabled Genetic Algorithm for Non-slicing VLSI Floorplanning

Floorplanning is a crucial process in the early stage of VLSI physical design. It determines the performance, reliability, and size of chips. B*-tree is a simple yet efficient representation that

References

Silva pointed out that the hamming function from my article about lazy streams could be simpliied Gene Hsu and I discussed multi-way merge functions. Also, I posed an exercise about the sequence 4

  • Silva pointed out that the hamming function from my article about lazy streams could be simpliied Gene Hsu and I discussed multi-way merge functions. Also, I posed an exercise about the sequence 4