paper-with-me

홈 › Papers

GEqO: ML-Accelerated Semantic Equivalence Detection

2024-01-02 · Brandon Haynes, Rana Alotaibi, Anna Pavlenko, Jyoti Leeka, Alekh Jindal, Yuanyuan Tian

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.

📄 PDF Abstract BibTeX arXiv:2401.01280

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Semantic Equivalence Detection: Are Interrogatives Harder than Declaratives?

2018-05-01 · LREC 2018 5 · Jo{\~a}o Rodrigues, Chakaveh Saedi, Ant{\'o}nio Branco, Jo{\~a}o Silva
Community Question AnsweringInformation RetrievalQuestion AnsweringRelation Extraction+1

Active Learning of Sequential Transducers with Side Information about the Domain

2021-04-23 · Raphaël Berthon, Adrien Boiret, Guillermo A. Perez, Jean-François Raskin

Active learning is a setting in which a student queries a teacher, through membership and equivalence queries, in order to learn a language. Performance on these algorithms is often measured in the number of queries requ…

Active Learning

A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights

2015-03-04 · Weijie Su, Stephen Boyd, Emmanuel J. Candes

We derive a second-order ordinary differential equation (ODE) which is the limit of Nesterov's accelerated gradient method. This ODE exhibits approximate equivalence to Nesterov's scheme and thus can serve as a tool for …

A Differential Equation for Modeling Nesterov’s Accelerated Gradient Method: Theory and Insights

2014-12-01 · NeurIPS 2014 12 · Weijie Su, Stephen Boyd, Emmanuel Candes

We derive a second-order ordinary differential equation (ODE), which is the limit of Nesterov’s accelerated gradient method. This ODE exhibits approximate equivalence to Nesterov’s scheme and thus can serve as a tool for…

Defense semantics of argumentation: encoding reasons for accepting arguments

2017-04-30 · Beishui Liao, Leendert van der Torre

In this paper we show how the defense relation among abstract arguments can be used to encode the reasons for accepting arguments. After introducing a novel notion of defenses and defense graphs, we propose a defense sem…