15 search results - page 2 / 3 » Supporting Similarity Operations Based on Approximate String... |
ALGORITHMICA
2005
13 years 5 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
HOTOS
2007
IEEE
13 years 9 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
SSDBM
2010
IEEE
13 years 10 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
ICSOC
2003
Springer
13 years 10 months ago
2003
Springer
The web-services stack of standards is designed to support the reuse and interoperation of software components on the web. A critical step in the process of developing applications...