Sciweavers

164 search results - page 1 / 33
» Maximally joining probabilistic data
Sort
View
PODS
2007
ACM
113views Database» more  PODS 2007»
14 years 4 months ago
Maximally joining probabilistic data
Benny Kimelfeld, Yehoshua Sagiv
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
13 years 10 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CIKM
2006
Springer
13 years 8 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
CIKM
2010
Springer
13 years 2 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
SSDBM
2008
IEEE
111views Database» more  SSDBM 2008»
13 years 11 months ago
iJoin: Importance-Aware Join Approximation over Data Streams
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
Dhananjay Kulkarni, Chinya V. Ravishankar