Sciweavers

16 search results - page 1 / 4
» Clustering of Short Strings in Large Databases
Sort
View
DEXAW
2009
IEEE
131views Database» more  DEXAW 2009»
14 years 2 months ago
Clustering of Short Strings in Large Databases
—A novel method CLOSS intended for textual databases is proposed. It successfully identifies misspelled string clusters, even if the cluster border is not prominent. The method ...
Michail Kazimianec, Arturas Mazeika
VLDB
2005
ACM
118views Database» more  VLDB 2005»
14 years 25 days ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
14 years 20 days ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 19 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
14 years 19 days ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...