DeepOLA: An online aggregation approach to approximating deeply nested queries
Sheoran, Nikhil
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/117660
Description
Title
DeepOLA: An online aggregation approach to approximating deeply nested queries
Author(s)
Sheoran, Nikhil
Issue Date
2022-12-05
Director of Research (if dissertation) or Advisor (if thesis)
Park, Yongjoo
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
Online Aggregation
Approximate Query Processing
Abstract
For exploratory data analysis, it is often desirable to know what answers you are likely to get before actually obtaining those answers. This can potentially be achieved by designing systems to offer the estimates of a data operation result — say op(data) — earlier in the process based on partial data processing. Those estimates continuously refine as more data is processed and finally converge to the exact answer. Unfortunately, the existing techniques — called Online Aggregation (OLA) — are limited to a single operation; that is, we cannot obtain the estimates for op(op(data)) or op(...(op(data))). If this Deep OLA becomes possible, data analysts will be able to explore data more interactively using complex cascade operations.
In this work, we take a step toward Deep OLA with evolving data frames (edf), a novel data model to offer OLA for nested ops — op(...(op(data))) — by representing an evolving structured data (with converging estimates) that is closed under set operations. That is, op(edf) produces yet another edf; thus, we can freely apply successive operations to edf and obtain an OLA output for each op. We evaluate its viability with DeepOLA, an edf-based OLA system, by examining against state-of-the-art OLA and non-OLA systems. In our experiments on TPC-H dataset, DeepOLA produces its first estimates 12.8× faster (median) — with 1.3× median slowdown for exact answers — compared to conventional systems, while even producing faster exact results for some queries (i.e. no overhead). Besides its generality, DeepOLA is also 1.92× faster (median) than existing OLA systems in producing estimates of under 1% relative errors.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.