Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

Encoding, Fast and Slow: Low-Latency Video Processing Using Thousands of Tiny Threads
Page 1 This paper is included in the Proceedings of the 14th USENIX Symposium on Networked …

Parallel technology boosts data processing in recent years, and parallel direct data
processing on hierarchically compressed documents exhibits great promise. The high …

Stateful serverless analytics can be enabled using a remote memory system for inter-task
communication, and for storing and exchanging intermediate data. However, existing …

Data-intensive clusters and object stores are increasingly relying on in-memory object
caching to meet the I/O performance demands. These systems routinely face the challenges …

We present the Succinct Range Filter (SuRF), a fast and compact data structure for
approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single …

In modern data management systems, directly performing operations on compressed data
has been proven to be a big success facing big data problems. These systems have …

We present PANCAKE, the first system to protect key-value stores from access pattern
leakage attacks with small constant factor bandwidth overhead. PANCAKE uses a new …

This article provides a comprehensive description of text analytics directly on compression
(TADOC), which enables direct document analytics on compressed textual data. The article …

This paper evaluates the suitability of Apache Arrow, Parquet, and ORC as formats for
subsumption in an analytical DBMS. We systematically identify and explore the high-level …