Sciweavers

27 search results - page 2 / 6
» Efficient set joins on similarity predicates
Sort
View
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 8 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
PVLDB
2008
201views more  PVLDB 2008»
13 years 3 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
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
14 years 6 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...
CIKM
2009
Springer
13 years 8 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck

Publication
344views
12 years 2 months ago
Top-k Similarity Join over Multi-valued Objects
The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and dat...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...