Database Paper Browser

Back to papers

Memory-Limited Execution of Windowed Stream Joins

Summary: Memory-limited execution of continuous sliding-window stream joins; analyzes two approximations under memory constraints: max-subset and random-sample. Introduces age-based arrival models, proves infeasibility for arbitrary inputs, and proposes a multi-join memory-allocation algorithm with experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9226
Venue
VLDB
Year
2004
Pagerank
6.4196026e-05
Overall Rank
4,133 | 71.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
18 On Random Sampling over Joins 1999 SIGMOD 0.00092385438
43 Models and Issues in Data Stream Systems 2002 PODS 0.00072723062
549 Tracking Join and Self-Join Sizes in Limited Storage 1999 PODS 0.00020376603
726 Load Shedding in a Data Stream Manager 2003 VLDB 0.00017511209
1,064 Processing Complex Aggregate Queries over Data Streams 2002 SIGMOD 0.00014356481
1,717 Approximate Join Processing Over Data Streams 2003 SIGMOD 0.00010793312
6,853 On Joining and Caching Stochastic Streams 2005 SIGMOD 4.9070864e-05
Previous Page 1 / 1 Next

Semantically Similar Papers