2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) 2020
DOI: 10.1109/etfa46521.2020.9211958
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic Time-Series Joins for Asynchronous High-Throughput Data Streams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…The Nearest Advocate (NAd) algorithm, based on a zipper principle adapted from a stream-stream join algorithm [22], estimates the time delay between two event-based time-series data. The core concept involves calculating the distance between each event in one time-series and the nearest event (i.e., advocate) in another time-series for a given time offset φ .…”
Section: Algorithmmentioning
confidence: 99%
“…The Nearest Advocate (NAd) algorithm, based on a zipper principle adapted from a stream-stream join algorithm [22], estimates the time delay between two event-based time-series data. The core concept involves calculating the distance between each event in one time-series and the nearest event (i.e., advocate) in another time-series for a given time offset φ .…”
Section: Algorithmmentioning
confidence: 99%