FlashProfile: a framework for synthesizing data profiles

Author:

Padhi Saswat1,Jain Prateek2,Perelman Daniel3,Polozov Oleksandr4,Gulwani Sumit3,Millstein Todd1

Affiliation:

1. University of California at Los Angeles, USA

2. Microsoft Research Lab, India

3. Microsoft, USA

4. Microsoft Research, USA

Abstract

We address the problem of learning a syntactic profile for a collection of strings, i.e. a set of regex-like patterns that succinctly describe the syntactic variations in the strings. Real-world datasets, typically curated from multiple sources, often contain data in various syntactic formats. Thus, any data processing task is preceded by the critical step of data format identification. However, manual inspection of data to identify the different formats is infeasible in standard big-data scenarios. Prior techniques are restricted to a small set of pre-defined patterns (e.g. digits, letters, words etc.), and provide no control over granularity of profiles. We define syntactic profiling as a problem of clustering strings based on syntactic similarity, followed by identifying patterns that succinctly describe each cluster. We present a technique for synthesizing such profiles over a given language of patterns, that also allows for interactive refinement by requesting a desired number of clusters. Using a state-of-the-art inductive synthesis framework, PROSE, we have implemented our technique as FlashProfile. Across 153 tasks over 75 large real datasets, we observe a median profiling time of only ∼ 0.7s. Furthermore, we show that access to syntactic profiles may allow for more accurate synthesis of programs, i.e. using fewer examples, in programming-by-example (PBE) workflows such as Flash Fill.

Funder

National Science Foundation

Microsoft Research

Microsoft

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference54 articles.

1. Profiling relational data: a survey

2. Learning regular sets from queries and counterexamples

3. Ataccama. 2017. Ataccama One Platform. https://www.ataccama.com/ . Ataccama. 2017. Ataccama One Platform. https://www.ataccama.com/ .

4. Automatic generation of regular expressions from examples with genetic programming

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Diffy: Data-Driven Bug Finding for Configurations;Proceedings of the ACM on Programming Languages;2024-06-20

2. Saggitarius: A DSL for Specifying Grammatical Domains;Proceedings of the ACM on Programming Languages;2023-10-16

3. Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates;Proceedings of the ACM on Programming Languages;2023-10-16

4. Fast and Reliable Program Synthesis via User Interaction;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11

5. Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection;Proceedings of the ACM on Programming Languages;2023-04-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3