From Batch to Stream: Automatic Generation of Online Algorithms

Author:

Wang Ziteng1ORCID,Pailoor Shankara1ORCID,Prakash Aaryan1ORCID,Wang Yuepeng2ORCID,Dillig Işıl3ORCID

Affiliation:

1. University of Texas at Austin, Austin, TX, USA

2. Simon Fraser University, Burnaby, Canada

3. University of Texas at Austin, Austin, USA

Abstract

Online streaming algorithms, tailored for continuous data processing, offer substantial benefits but are often more intricate to design than their offline counterparts. This paper introduces a novel approach for automatically synthesizing online streaming algorithms from their offline versions. In particular, we propose a novel methodology, based on the notion of relational function signature (RFS), for deriving an online algorithm given its offline version. Then, we propose a concrete synthesis algorithm that is an instantiation of the proposed methodology. Our algorithm uses the RFS to decompose the synthesis problem into a set of independent subtasks and uses a combination of symbolic reasoning and search to solve each subproblem. We implement the proposed technique in a new tool called Opera and evaluate it on over 50 tasks spanning two domains: statistical computations and online auctions. Our results show that Opera can automatically derive the online version of the original algorithm for 98% of the tasks. Our experiments also demonstrate that Opera significantly outperforms alternative approaches, including adaptations of SyGuS solvers to this problem as well as two of Opera's own ablations.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Reference80 articles.

1. [n. d.]. https://storm.apache.org/

2. 2010. https://web.archive.org/web/20240314171007/https://stackoverflow.com/questions/3903538/online-algorithm-for-calculating-absolute-deviation Accessed: 2024-03-14

3. 2013. https://stackoverflow.com/questions/17104673/incremental-entropy-computation Accessed: 2024-03-14

4. 2014. https://stackoverflow.com/questions/26191456/algorithm-for-a-running-harmonic-mean Accessed: 2024-03-14

5. 2018. https://stackoverflow.com/questions/52070293/efficient-online-linear-regression-algorithm-in-python Accessed: 2024-03-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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