Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams
Summary: Considers sliding-window multi-join processing for continuous streams; presents multi-way incremental NLJs and hash joins with in-memory windows and join-order heuristics. Hash joins outperform NLJs for equi-joins; cost depends on eviction strategies for sliding windows. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lukasz Golab
- 2. M. Tamer Özsu
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 43 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00072723062 |
| 211 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033981214 |
| 1,904 | Characterizing Memory Requirements for Queries over Continuous Data Streams | 2002 | PODS | 0.00010154528 |
Previous
Page 1 / 1
Next