DJ Die

DJ Die (born Daniel Kausman, 1972 in Devon), is a British music producer and DJ. He was a founder of drum and bass label Full Cycle Recordings and a member of acts Reprazent (1997 Mercury Prize winners) and Breakbeat Era.

Kausman was born in Devon, England and spent his formative years there before moving to Bristol in 1985 as a teenager. An early interest in house and hardcore led to a musical partnership with friend Jody Wisternoff (who later formed Way Out West with Nick Warren). Recording together under the aliases of Tru Funk and Sub Love on Three Stripe Records, they created hardcore staples like "4am" and made numerous DJing appearances at early Universe raves. The partnership, however, was a brief one.

After a chance meeting with Roni Size at Bristol's Replay Records store in 1992, this led to their first collaboration in the form of Agility for V Recordings and Die's ongoing contributions to the Full Cycle Recordings catalogue.

Together with Size, he originated the seminal "Music Box" which was to become the title track of the debut Full Cycle compilation in 1996. Emerging firstly as a core member of Reprazent and later in 1998 as one third of Breakbeat Era (a project spawned by the "Music Box" track of the same name), he soon found himself remixing for DJs including DJ Shadow, Towa Tei and DJ Cam. His remix of the Reprazent single "Watching Windows" was released in its own right by Talkin' Loud. He has his own label called Clear Skyz.

2–3–4 tree

In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that is commonly used to implement dictionaries. The numbers mean a tree where every node with children (internal node) has either two, three, or four child nodes:

2-node

2-node

3-node

3-node

4-node

4-node

2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that all external nodes are at the same depth.

2–3–4 trees are an isometry of red–black trees, meaning that they are equivalent data structures. In other words, for every 2–3–4 tree, there exists at least one red–black tree with data elements in the same order. Moreover, insertion and deletion operations on 2–3–4 trees that cause node expansions, splits and merges are equivalent to the color-flipping and rotations in red–black trees. Introductions to red–black trees usually introduce 2–3–4 trees first, because they are conceptually simpler. 2–3–4 trees, however, can be difficult to implement in most programming languages because of the large number of special cases involved in operations on the tree. Red–black trees are simpler to implement, so tend to be used instead.