mlsanityData to 7 Oct 2026

GEqO: ML-Accelerated Semantic Equivalence Detection

arXiv 2401.01280 ↗First posted 2 Jan 2024cs.DB cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Large scale analytics engines have become a core dependency for modern data-driven enterprises to derive business insights and drive actions. These engines support a large number of analytic jobs processing huge volumes of data on a daily basis, and workloads are often inundated with overlapping computations across multiple jobs. Reusing common computation is crucial for efficient cluster resource utilization and reducing job execution time. Detecting common computation is the first and key step for reducing this computational redundancy. However, detecting equivalence on large-scale analytics engines requires efficient and scalable solutions that are fully automated. In addition, to maximize computation reuse, equivalence needs to be detected at the semantic level instead of just the syntactic level (i.e., the ability to detect semantic equivalence of seemingly different-looking queries). Unfortunately, existing solutions fall short of satisfying these requirements. In this paper, we take a major step towards filling this gap by proposing GEqO, a portable and lightweight machine-learning-based framework for efficiently identifying semantically equivalent computations at scale. GEqO introduces two machine-learning-based filters that quickly prune out nonequivalent subexpressions and employs a semi-supervised learning feedback loop to iteratively improve its model with an intelligent sampling mechanism. Further, with its novel database-agnostic featurization method, GEqO can transfer the learning from one workload and database to another. Our extensive empirical evaluation shows that, on TPC-DS-like queries, GEqO yields significant performance gains-up to 200x faster than automated verifiers-and finds up to 2x more equivalences than optimizer and signature-based equivalence detection approaches.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 57 references that are in the map. First posted on arXiv 2 Jan 2024.

Builds on

12 of 57 references.

References · 12

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  5. 2019Neo: A Learned Query Optimizercited by 80
  6. 2020Bao: Learning to Steer Query Optimizerscited by 62
  7. 2022DeepJoin: Joinable Table Discovery with Pre-trained Language Modelscited by 15
  8. 2018Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queriescited by 11
  9. 2016HoTTSQL: Proving Query Rewrites with Univalent SQL Semanticscited by 10
  10. 2019An Empirical Analysis of Deep Learning for Cardinality Estimationcited by 8
  11. 2019Improved Cardinality Estimation by Learning Queries Containment Ratescited by 3
  12. 2021KEA: Tuning an Exabyte-Scale Data Infrastructurecited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.