Übersetzung für 'B tree' von Englisch nach Deutsch

B-tree

B-Baum {m}comp.

---

B-cell chronic lymphotic leukemia <B-CLL, B-cell CLL> [Am.]

chronische lymphatische Leukämie {f} vom B-Zell-Typ <B-CLL, BCLL, B-Zellen-CLL>med.

Werbung

Bachelor of Engineering <B.Eng., BEng, B.E.>

Bachelor {m} of Engineering <B.Eng., BEng, BE>educ.

bed and breakfast house <B&B>

Gästehaus {n}travel

B-cell non-Hodgkin / non-Hodgkin's lymphoma <B-NHL, BNHL, B-cell NHL>

B-Zell-Non-Hodgkin-Lymphom {n} <B-NHL, B-Zell-NHL>med.

bottom quark <b quark, b>

Bottom-Quark {n} <b-Quark, b>phys.

bed and breakfast <B&B>

Frühstückspension {f}

Übernachtung {f} mit Frühstück

bed-and-breakfast <B&B>

Bed and Breakfast {n} <B&B>travelTrVocab.

Frühstückspension {f}

black and white {adj} <B&W, b&w, B/W>

schwarz/weiß <sw, s/w>

Belt and Road Initiative [in China] <B&R, B&R Initiative, BRI>

Neue Seidenstraße {f} [ugs.] [Belt and Road Initiative; bis 2016: Projekt One Belt, One Road (OBOR)]econ.pol.

B minor <b, Bm>

h-Moll {n} <h, Hm>mus.

rhythm and blues <R&B, R'n'B or RnB>

Rhythm and Blues {m} <R&B, R'n'B, RnB>mus.

Rhythm'n'Blues {m} <R&B, R'n'B, RnB>mus.

base fog <B+F, b&f> [base plus fog]

Grundschleier {m}MedTech.photo.

a plus b in brackets squared < (a+b)² >

a plus b in Klammern zum Quadrat < (a+b)² >math.

bed and breakfast establishment <B&B establishment>

Hotel garni {n}

base plus fog <B+F, b&f>

Grundschleier {m}photo.

d open bracket b plus c close bracket < d(b+c) >

d Klammer auf b plus c Klammer zu < d(b+c) >math.

B sharp <B#>

His {n}mus.

• For example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers.
• In addition, a B-tree minimizes waste by making sure the interior nodes are at least half full. A B-tree can handle an arbitrary number of insertions and deletions.
• ReiserFS stores file metadata ("stat items"), directory entries ("directory items"), inode block lists ("indirect items"), and tails of files ("direct items") in a single, combined B+ tree keyed by a universal object ID.
• Where the size of the allocation map is too large for it to be stored within the inode, the map is moved into a B+ tree which allows for rapid access to data anywhere in the 64-bit address space provided for the file.
• A red–black tree is similar in structure to a B-tree of order 4, where each node can contain between 1 and 3 values and (accordingly) between 2 and 4 child pointers.

• This is because B-tree indexes result in query times proportional to log(n) where n is the number of rows in a table and hash indexes result in constant time queries (no size dependency as long as the relevant part of the index fits into memory).