Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality
Xilin Tang, Feng Zhang, Shuhao Zhang, Yani Liu, Bingsheng He, Xiaoyong Du
摘要
>Sampling is one of the most widely employed approximations in big data processing. Among various challenges in sampling design, sampling for join is particularly intriguing yet complex. This perplexing problem starts with a classical case where the join of two Bernoulli samples shrinks its output size quadratically and exhibits a strong dependency on the input data, presenting a unique challenge that necessitates adaptive sampling to guarantee both the quantity and quality of the sampled data. The community has made strides in achieving this goal by constructing offline samples and integrating support from indexes or key frequencies. However, when dealing with stream data, due to the need for real-time processing and high-quality analysis, methods developed for processing static data become unavailable. Consequently, a fundamental question arises: Is it possible to achieve adaptive sampling in stream data without relying on offline techniques? To address this problem, we propose FreeSam, which couples hybrid sampling with intra-window join, a key stream join operator. Our focus lies on two widely used metrics: output size, ensuring quantity, and variance, ensuring quality. FreeSam enables adaptability in both the desired quantity and quality of data sampling by offering control on the two-dimensional space spanned by these metrics. Meanwhile, adjustable trade-offs between quality and performance make FreeSam practical for use. Our experiments show that, for every 1% increase in latency limitation, FreeSam can yield a 3.83% increase in the output size while maintaining the level of the estimator's variance. Additionally, we give FreeSam a multi-core implementation and ensure predictability of its latency through both an analytic model and a neural network model. The accuracy of these models is 88.05% and 96.75% respectively.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle InequalitiesQian Xu, Juan Yang, Feng Zhang, Junda Pan 等SIGMOD 2025 · 被引用 14 次
- Succinct and Fast Tiny Pointer Hash TablesXilin Tang, Yuqi Mai, William Kuszmaul, Alex ConwayVLDB 2026
- Reasoning Through Execution: Unifying Process and Outcome Rewards for Code GenerationZhuohao Yu, Weizheng Gu, Yidong Wang, Xingru Jiang 等ICML 2025
它引用的顶会 Paper27
- Cardinality Estimation in DBMS: A Comprehensive Benchmark EvaluationYuxing Han, Ziniu Wu, Peizhi Wu, Rong Zhu 等VLDB 2022 · 被引用 169 次
- Towards Spatio- Temporal Aware Traffic Time Series ForecastingRazvan-Gabriel Cirstea, Bin Yang, Chenjuan Guo, Tung Kieu 等ICDE 2022 · 被引用 137 次
- Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding WindowsXiangyang Gou, Long He, Yinda Zhang, Ke Wang 等KDD 2020 · 被引用 53 次
- Efficient Sampling Approaches to Shapley Value ApproximationJiayao Zhang, Qiheng Sun, Jinfei Liu, Li Xiong 等SIGMOD 2023 · 被引用 43 次
- Move Fast and Meet Deadlines: Fine-grained Real-time Stream Processing with CameoLe Xu, Shivaram Venkataraman, Indranil Gupta, Luo Mai 等NSDI 2021 · 被引用 38 次
相关 Paper
- Join on Samples: A Theoretical Guide for PractitionersDawei Huang, Dong Young Yoon, Seth Pettie, Barzan MozafariVLDB 2020 · 被引用 13 次
- Reservoir Sampling over JoinsBinyang Dai, Xiao Hu, Ke YiSIGMOD 2024 · 被引用 6 次
- Low-Latency Adaptive Distributed Stream Join System Based on a Flexible Join ModelQihang Wang, Decheng Zuo, Zhan Zhang, Yanjun Shu 等SIGMOD 2024
- JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product EstimationFeiyu Wang, Qizhi Chen, Yuanpeng Li, Tong Yang 等SIGMOD 2023 · 被引用 20 次
- Adaptive Threshold SamplingDaniel TingSIGMOD 2022 · 被引用 3 次
