Sciweavers

52 search results - page 1 / 11
» SPIDER: flexible matching in databases
Sort
View
SIGMOD
2005
ACM
108views Database» more  SIGMOD 2005»
14 years 4 months ago
SPIDER: flexible matching in databases
We present a prototype system, SPIDER, developed at AT&T Labs? Research, which supports flexible string attribute value matching in large databases. We discuss the design prin...
Nick Koudas, Amit Marathe, Divesh Srivastava
CSB
2004
IEEE
110views Bioinformatics» more  CSB 2004»
13 years 8 months ago
SPIDER: Software for Protein Identification from Sequence Tags with De Novo Sequencing Error
For the identification of novel proteins using MS/MS, de novo sequencing software computes one or several possible amino acid sequences (called sequence tags) for each MS/MS spect...
Yonghua Han, Bin Ma, Kaizhong Zhang
VLDB
2004
ACM
96views Database» more  VLDB 2004»
13 years 10 months ago
Flexible String Matching Against Large Databases in Practice
Nick Koudas, Amit Marathe, Divesh Srivastava
VLDB
2002
ACM
166views Database» more  VLDB 2002»
13 years 4 months ago
COMA - A System for Flexible Combination of Schema Matching Approaches
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
Hong Hai Do, Erhard Rahm
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 6 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...