868 search results - page 117 / 174 » A general compression algorithm that supports fast searching |
131
Voted
ANCS
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we present an exact active statistics counter architecture called BRICK (Bucketized Rank Indexed Counters) that can efficiently store per-flow variable-width statis...
134
Voted
DASFAA
2009
IEEE
15 years 7 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
151
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
126
Voted
WWW
2002
ACM
16 years 4 months ago
2002
ACM
Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that...
154
Voted
ICS
2009
Tsinghua U.
15 years 10 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...