736 search results - page 48 / 148 » Confidence-Aware Join Algorithms |
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
133
click to vote
ACIIDS
2009
IEEE
15 years 5 months ago
2009
IEEE
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
216
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
189
Voted
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send enc...
100
Voted
EDBT
2008
ACM
16 years 20 days ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...