Columnar storage is a core component of a modern data analytics system. Although many
database management systems (DBMSs) have proprietary storage formats, most provide …

Log-structured merge (LSM) trees have emerged as one of the most commonly used storage-
based data structures in modern data systems as they offer high throughput for writes and …

A range filter is a data structure to answer range membership queries. Range queries are
common in modern applications, and range filters have gained rising attention for improving …

Filter data structures have been used ubiquitously since the 1970s to answer approximate
set-membership queries in various areas of computer science including architecture …

The learning-enhanced data structure has inspired the development of the range filter,
bringing significantly better false positive rate (FPR) than traditional non-learned range …

Distributed Mean Estimation (DME), in which $ n $ clients communicate vectors to a
parameter server that estimates their average, is a fundamental building block in …

Mainstream LSM-tree-based key-value stores face challenges in optimizing performance for
point lookup, range lookup, and update operations concurrently due to their constrained …

Log-structured merge-trees (LSM-trees) are widely used in key-value stores because of its
excellent write performance. To reduce LSM-tree's read amplification due to overlapping …

LSM-based key-value stores have been leveraged in many state-of-the-art data-intensive
applications as storage engines. As data volume scales up, a cost-efficient approach is to …

Filter data structures are widely used in various areas of computer science to answer
approximate set-membership queries. In many applications, the data grows dynamically …