VLDB 2026 Research / reviewers in the wild / expert
Ruyun Lu
dblp:411/0944
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 50% Spatial and temporal data management · 50% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › data reduction
error-bounded compression |
0.9 | 1 | 2025 | Serf: Streaming Error-Bounded Floating-Point Compression · Proc. ACM Manag. Data 2025 |
Spatial and temporal data management
time series compression |
0.9 | 1 | 2025 | Serf: Streaming Error-Bounded Floating-Point Compression · Proc. ACM Manag. Data 2025 |
Methods — techniques the papers use, named apart from their topics
quantization · 1.7elias gamma coding · 1.7XOR-based compression · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Serf: Streaming Error-Bounded Floating-Point CompressionabstractIn IoT (Internet of Things) scenarios, massive floating-point time series data are generated in a streaming manner and transmitted within limited bandwidth for real-time analysis. To enhance the efficiency, it is acknowledged to compress the data before transmission. Existing floating-point compression methods are either for batched compression that may cause long delays, or for streaming lossless compression that has an unsatisfactory compression ratio when certain errors are allowed. In this paper, we propose the first Streaming ERror-bounded Floating-point compression Serf , which has two implementations: Serf-Qt and Serf-XOR . Serf-Qt first quantizes each floating-point value into an integer, and then encodes the integer with Elias gamma coding. Serf-XOR is the first lossy floating-point compression based on the XORing operation. To enhance the compression ratio of Serf-XOR , we propose a novel data offset technique to increase the leading zeros of the XORed values, and design a novel approximation technique to search for an error-qualified value that produces an XORed value with many trailing zeros. To improve the compression efficiency, we propose a pruning strategy to accelerate the process of approximated values search. We further build a streaming transmission prototype system based on a real development board, and deploy the proposed methods to it. Extensive experiments using 13 datasets show that, compared with 17 competitors, both Serf-Qt and Serf-XOR enjoy remarkable compression ratios with high efficiency in streaming scenarios. The transmission experiments based on the proposed system also showcase that Serf-XOR always takes the least overall time when the bandwidth is limited. Zechao Chen, Ruyun Lu, Xiaolong Xu 0001, Guangchao Yang, Chao Chen 0004, Jie Bao 0003, Yu Zheng 0004 |
Proc. ACM Manag. Data | 3 |