Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
Key-value data structures constitute the core of any datadriven system. They provide the
means to store, search, and modify data residing at various levels of the storage and …
means to store, search, and modify data residing at various levels of the storage and …
Enabling Timely and Persistent Deletion in LSM-Engines
Data-intensive applications have fueled the evolution of log-structured merge (LSM) based
key-value engines that employ the out-of-place paradigm to support high ingestion rates …
key-value engines that employ the out-of-place paradigm to support high ingestion rates …
BoDS: A benchmark on data sortedness
Indexes in data systems accelerate data access by adding structure to otherwise
unstructured data at the cost of index construction and maintenance. Data systems, and …
unstructured data at the cost of index construction and maintenance. Data systems, and …
[PDF][PDF] QuIT your B+-tree for the Quick Insertion Tree
Search trees, like B+-trees, are often used as index structures in data systems to improve
query performance at the cost of index construction and maintenance. Production data …
query performance at the cost of index construction and maintenance. Production data …
Benchmarking Learned and LSM Indexes for Data Sortedness
Database systems use indexes on frequently accessed attributes to accelerate query and
transaction processing. This requires paying the cost of maintaining and updating those …
transaction processing. This requires paying the cost of maintaining and updating those …