54 citations · 59 across the 10 of their papers we have counts for
11 papers
Programmable Data Layouts via On-The-Fly Data Transformation
Cole Strickler, Renato Mancuso, Manos Athanassoulis +1
The performance of modern computing systems is heavily bottlenecked by the widening gap between processing throughput and main memory latency, a problem exacerbated when an applica…
Tensor Memory Engine: On-the-fly Data Reorganization for Ideal Locality
Denis Hoornaert, Cole Strickler, Manos Athanassoulis +3
The shift to data-intensive processing from the cloud to the edge has introduced new challenges and expectations for the next generation of intelligent computing systems. As the me…
Eliminating the Hidden Cost of Zone Management in ZNS SSDs
Teona Bagashvili, Tarikul Islam Papon, Subhadeep Sarkar +1
Zoned Namespace (ZNS) SSDs offer a new storage model that allows for high throughput and low-latency storage by eliminating device-side garbage collection. The ZNS interface expose…
CUBIT: Concurrent Updatable Bitmap Indexing (Extended Version)
Junchang Wang, Manos Athanassoulis
Bitmap indexes are widely used for read-intensive analytical workloads because they are clustered and offer efficient reads with a small memory footprint. However, they are notorio…
Towards Flexibility and Robustness of LSM Trees
Andy Huynh, Harshal A. Chaudhari, Evimaria Terzi +1
Log-Structured Merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of a…
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins
Zichen Zhu, Xiao Hu, Manos Athanassoulis
Storage-based joins are still commonly used today because the memory budget does not always scale with the data size. One of the many join algorithms developed that has been widely…
Constructing and Analyzing the LSM Compaction Design Space (Updated Version)
Subhadeep Sarkar, Dimitris Staratzis, Zichen Zhu +1
Log-structured merge (LSM) trees offer efficient ingestion by appending incoming data, and thus, are widely used as the storage layer of production NoSQL data stores. To enable com…
OSM-tree: A Sortedness-Aware Index
Aneesh Raman, Subhadeep Sarkar, Matthaios Olma +1
Indexes facilitate efficient querying when the selection predicate is on an indexed key. As a result, when loading data, if we anticipate future selective (point or range) queries,…
Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty
Andy Huynh, Harshal A. Chaudhari, Evimaria Terzi +1
Log-Structured Merge trees (LSM trees) are increasingly used as the storage engines behind several data systems, frequently deployed in the cloud. Similar to other database archite…
Relational Memory: Native In-Memory Accesses on Rows and Columns
Shahin Roozkhosh, Denis Hoornaert, Ju Hyoung Mun +5
Analytical database systems are typically designed to use a column-first data layout to access only the desired fields. On the other hand, storing data row-first works great for ac…
Lethe: A Tunable Delete-Aware LSM Engine (Updated Version)
Subhadeep Sarkar, Tarikul Islam Papon, Dimitris Staratzis +1
Data-intensive applications fueled the evolution of log structured merge (LSM) based key-value engines that employ the out-of-place paradigm to support high ingestion rates with lo…