Sciweavers

164 search results - page 4 / 33
» Maximally joining probabilistic data
Sort
View
DKE
2002
94views more  DKE 2002»
13 years 9 months ago
Tie-breaking strategies for fast distance join processing
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
Hyoseop Shin, Bongki Moon, Sukho Lee
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
14 years 4 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi
ACIIDS
2009
IEEE
144views Database» more  ACIIDS 2009»
14 years 2 months ago
Processing Exact Results for Sliding Window Joins over Time-Sequence, Streaming Data Using a Disk Archive
— 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...
Abhirup Chakraborty, Ajit Singh
SIGMOD
2005
ACM
118views Database» more  SIGMOD 2005»
14 years 10 months ago
RPJ: Producing Fast Join Results on Streams through Rate-based Optimization
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...
Yufei Tao, Man Lung Yiu, Dimitris Papadias, Marios...