Sciweavers

Share
57 search results - page 1 / 12
» Prefix Tree Indexing for Similarity Search and Similarity Jo...
Sort
View
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
9 years 11 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
APWEB
2004
Springer
10 years 12 days ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
WWW
2008
ACM
10 years 7 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
10 years 8 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
9 years 12 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
books