Sciweavers

356 search results - page 5 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
WWW
2003
ACM
15 years 10 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
72
Voted
WAIM
2010
Springer
14 years 7 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
AOSD
2008
ACM
14 years 11 months ago
Test-based pointcuts for robust and fine-grained join point specification
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...
Kouhei Sakurai, Hidehiko Masuhara
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
15 years 11 months ago
Top-k Set Similarity Joins
Abstract-- Similarity join is a useful primitive operation underlying many applications, such as near duplicate Web page detection, data integration, and pattern recognition. Tradi...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Haichuan Sh...
EUC
2006
Springer
15 years 1 months ago
Distributed Proximity-Aware Peer Clustering in BitTorrent-Like Peer-to-Peer Networks
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
Bin Xiao, Jiadi Yu, Zili Shao, Minglu Li