13 search results - page 1 / 3 » iJoin: Importance-Aware Join Approximation over Data Streams |
SSDBM
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
SIGMOD
2003
ACM
14 years 5 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
ICDE
2009
IEEE
13 years 2 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...