109 search results - page 2 / 22 » Implementation Results of Bloom Filters for String Matching |
STRINGOLOGY
2004
13 years 6 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
LCN
2002
IEEE
13 years 10 months ago
2002
IEEE
We investigate methods of using CRC32 for compressing Web URL strings and sharing of URL lists between servers, caches, and URL switches. Using trace-based evaluation, we compare ...
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
CSREASAM
2006
13 years 6 months ago
2006
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...