Dandelion

1. DLHT (Dandelion HashTable)

DLHT is our high-performance hashtable design, optimized for fast lookups and efficient memory usage. Like the intricate structure of a dandelion's seed head, it forms the backbone of our data storage system, ensuring quick access to your data.

2. DLTree (Dandelion B+ Tree)

DLTree is our implementation of a B+ tree, designed for efficient range queries and ordered data storage. It complements DLHT by providing fast access to sorted data and supporting complex query operations, branching out like the roots of a dandelion. Among others DLTree follows the Spiderman technique, which couples software prefetching with request multiplexing to boost performance of traversals avoiding CPU stalls on memory accesses.

Long Vu won a global undergraduate award for his thesis describing Spiderman and demonstrating 30% performance improvement on the fastest B+tree.

3. U2PC (Unanimous Two-Phase Commit)

U2PC is our innovative protocol for ensuring data consistency across distributed systems. It provides a unanimous approach to transaction management, guaranteeing ACID properties in a distributed environment, as reliable as a dandelion's ability to spread its seeds.

4. DLStore (Dandelion Datastore)

The Dandelion Datastore combines DLHT, DLTree, U2PC (and other transactional protocols) with a datastore-optimized network library to create a fast distributed in-memory datastore, with strongly-consistent and fault-tolerant transactions. It offers unparalleled throughput, scalability, and reliability for your data management needs, all inspired by the resilience and adaptability of the dandelion.