73 search results - page 2 / 15 » Perfect Hashing for Data Management Applications |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
TPDS
1998
13 years 4 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
PODC
2004
ACM
13 years 10 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
WWW
2010
ACM
14 years 6 days ago
2010
ACM
This paper establishes the theoretical framework of b-bit minwise hashing. The original minwise hashing method has become a standard technique for estimating set similarity (e.g.,...