Sciweavers

14 search results - page 1 / 3
» Flexible String Matching Against Large Databases in Practice
Sort
View
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
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
SIGMOD
2008
ACM
100views Database» more  SIGMOD 2008»
13 years 4 months ago
Incorporating string transformations in record matching
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
Arvind Arasu, Surajit Chaudhuri, Kris Ganjam, Ragh...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 5 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
SIGCOMM
2006
ACM
13 years 10 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...