logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Evaluating Continuous Queries with Inconsistency Annotations

delete2025-01-01
delete0
PRE
AI
S
Samuele Langhi
A
Angela Bonifati
R
Riccardo Tommasini
DOI：10.14778/3718057.3718062delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Continuous Queries (CQs) run indefinitely, processing infinite data streams and producing continuous outputs. They commonly use window functions to segment streams intofi nite chunks for computation. Ensuring data integrity in CQs is challenging, involving, for example, streaming joins for binary constraints. Current methods, like dropping or repairing inconsistent data, can harm throughput and increase latency. This paper proposes a novel approach using provenance-based techniques to map violations in input streams to CQ results with minimal overhead. This ensures continuous dataflow and maintains the analytical integrity of CQs. Our study explores the feasibility and efficiency of this method, addressing a significant gap in applying provenance techniques to streaming data. While provenance-based techniques have proven effective for static data, their application in streaming contexts remains unexplored. Our solution addresses this gap, achieving a stable throughput across increasingly demanding memory loads wrt to the baselines, spacing between a 10% increase for medium-sized buffers (i.e., the windows), up to 80% for heavier loads. Moreover, results show the minimal impact of annotation (up to 25%) in the total execution runtime, demonstrating the effectiveness of our graph-based approach.
Keywords:
Continuous Queries
Streaming Data
Provenance Techniques
Data Integrity
Window Functions

Journal

P
Proceedings of the VLDB Endowment
IF:
3.3
Papers:
553
Citations:
1.2W

Organization

No organization information available