Data structure

Rendezvous Thread control block Bridge Protocol Data Units passive data structure (a,b)-tree line Association list B-heap block allocation map C-trie red–black tree concurrent data structure Data Control Block exponential tree hashed array tree database index partition table Job File Table binary search tree Kinetic heap R*-tree use-define chain level set linked data structure zipper Stream Log-structured merge-tree B-tree B-tree matrix representation skip graph sorted array call stack Succinct data structure counting Bloom filter Unit Control Block binary heap associative array splay tree Bloom filter union type Scan-Line Interleave