B+ tree

Known as: Quaternary Tree, B+-tree, B plus tree 
A B+ tree is an n-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Due to their many advantages, flash-based SSDs (Solid-State Drives) have become a mainstream alternative to magnetic disks for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
With the rapid increasing capacity of flash memory, flash-aware indexing techniques are highly desirable for flash devices. The… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This report presents a way of indexing moving objects with a B+-tree based data structure. This concept was first described 2004… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to magnetic hard disks, due to their high… (More)
  • figure 1
  • table 1
  • figure 3
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
  • 2008
We investigate the relations among voluntary disclosure, earnings quality, and cost of capital. We find that firms with good… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this article, we present an efficient B+-tree based indexing method, called iDistance, for K-nearest neighbor (KNN) search in… (More)
  • table I
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to… (More)
  • figure 2
  • figure 3
  • table 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A number of algorithms have been proposed to access B+-trees concurrently, but they are not well understood. In this article, we… (More)
  • figure 2
  • figure 1
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1989
1989
We consider the design and analysis of algorithms to retrieve simple random samples from databases. Specifically, we examine… (More)
  • table 1
  • table 3
  • figure 1
Is this relevant?