DBScholar

Back to papers

Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees

Summary: Blocking-augmented sampling (BaS) combines embedding blocking with sampling for ML-based joins over unstructured data. It adaptively handles false negatives/positives, providing confidence intervals and up to 19× lower error than prior methods. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h7c13734247ea6e5c
Venue
SIGMOD
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,402 | 30.07%
DOI
10.1145/3802004

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zhu_sigmod26,
        title = {{Accelerating Approximate Analytical Join Queries over Unstructured Data with Statistical Guarantees}},
        author = {Zhu, Yuxuan and Jin, Tengjun and Mo, Chenghao and Kang, Daniel},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802004},
        url = {https://dl.acm.org/doi/10.1145/3802004},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
57 On Random Sampling over Joins 1999 SIGMOD 0.00040108301
134 Deep Entity Matching with Pre-Trained Language Models 2021 VLDB 0.00030043481
135 Ripple Joins for Online Aggregation 1999 SIGMOD 0.00029866033
138 Join Synopses for Approximate Query Answering 1999 SIGMOD 0.00029627449
158 Deep Learning for Entity Matching: A Design Space Exploration 2018 SIGMOD 0.00028046388
271 NoScope: Optimizing Neural Network Queries over Video at Scale 2017 VLDB 0.00022560564
281 Accelerating Machine Learning Inference with Probabilistic Predicates 2018 SIGMOD 0.00022295232
329 Can Foundation Models Wrangle Your Data? 2023 VLDB 0.00020858443
541 BlazeIt: Optimizing Declarative Aggregation and Limit Queries for Neural Network-Based Video Analytics 2020 VLDB 0.00016657685
750 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014265196
795 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013938779
1,247 Entity Matching: How Similar Is Similar 2011 VLDB 0.00011346515
1,301 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00011112842
2,450 ThalamusDB: Approximate Query Processing on Multi-Modal Data 2024 SIGMOD 8.4474092e-05
2,514 Deep Learning for Blocking in Entity Matching: A Design Space Exploration 2021 VLDB 8.3648432e-05
2,677 Relational Confidence Bounds Are Easy With The Bootstrap* 2005 SIGMOD 8.1461074e-05
2,776 Approximate Selection with Guarantees using Proxies 2020 VLDB 8.0309448e-05
3,843 Magellan: Toward Building Entity Matching Management Systems over Data Science Stacks 2016 VLDB 6.987246e-05
3,874 Accelerating Approximate Aggregation Queries with Expensive Predicates 2021 VLDB 6.953738e-05
3,917 Optimal Tracking of Distributed Heavy Hitters and Quantiles 2009 PODS 6.9266831e-05
5,143 Schema-agnostic vs Schema-based Configurations for Blocking Methods on Homogeneous Data 2016 VLDB 6.2569019e-05
5,157 Finding Hierarchical Heavy Hitters in Data Streams 2003 VLDB 6.2494766e-05
5,501 SemBench: A Benchmark for Semantic Query Processing Engines 2026 VLDB 6.1027188e-05
5,705 Analyzing How BERT Performs Entity Matching 2022 VLDB 6.0295759e-05
5,831 Joins on Samples: A Theoretical Guide for Practitioners 2020 VLDB 5.9782109e-05
5,859 Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks 2018 SIGMOD 5.9682458e-05
8,216 Wander Join: Online Aggregation for Joins 2016 SIGMOD 5.3764262e-05
Previous Page 1 / 1 Next

Semantically Similar Papers