Sciweavers

736 search results - page 2 / 148
» Confidence-Aware Join Algorithms
Sort
View
ISCC
2000
IEEE
13 years 8 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve
PVLDB
2008
201views more  PVLDB 2008»
13 years 4 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
VLDB
2002
ACM
83views Database» more  VLDB 2002»
13 years 4 months ago
Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm
Jens-Peter Dittrich, Bernhard Seeger, David Scot T...
SIGMOD
1996
ACM
180views Database» more  SIGMOD 1996»
13 years 9 months ago
Partition Based Spatial-Merge Join
This paper describes PBSM (Partition Based Spatial
Jignesh M. Patel, David J. DeWitt
IPL
2007
95views more  IPL 2007»
13 years 4 months ago
Optimal implementations of UPGMA and other common clustering algorithms
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algo...
Ilan Gronau, Shlomo Moran