EUVIMEDEUVIMED entdecken
Crossref

A Step Toward Deep Online Aggregation

Nikhil Sheoran, Supawit Chockchowwat, Arav Chheda, Suwen Wang, Riya Verma, Yongjoo Park

Proceedings of the ACM on Management of Data · 13.06.2023 · 1 (2) · 1-28

DOI: 10.1145/3589269 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 20.06.2023. Verfasst von Nikhil Sheoran und 5 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 93 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 Wake, an edf-based OLA system, by examining against state-of-the-art OLA and non-OLA systems. In our experiments on TPC-H dataset, Wake produces its first estimates 4.93× faster (median)-with 1.3× median slowdown for exact answers-compared to conventional systems. Besides its generality, Wake is also 1.92× faster (median) than existing OLA systems in producing estimates of under 1% relative errors.

Zitieren

APA

Sheoran, N., Chockchowwat, S., Chheda, A., Wang, S., Verma, R., & Park, Y. (2023). A Step Toward Deep Online Aggregation. Proceedings of the ACM on Management of Data, 1(2), 1-28. https://doi.org/10.1145/3589269

Vancouver

Sheoran N, Chockchowwat S, Chheda A, Wang S, Verma R, Park Y. A Step Toward Deep Online Aggregation. Proceedings of the ACM on Management of Data. 2023;1(2):1-28. doi:10.1145/3589269

BibTeX
@article{Sheoran2023,
  author = {Sheoran, Nikhil and Chockchowwat, Supawit and Chheda, Arav and Wang, Suwen and Verma, Riya and Park, Yongjoo},
  title = {A Step Toward Deep Online Aggregation},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2023},
  volume = {1},
  number = {2},
  pages = {1--28},
  doi = {10.1145/3589269}
}
Kostenlos starten →