33 search results - page 2 / 7 » Fast and Compact Hash Tables for Integer Keys |
SBBD
2008
13 years 6 months ago
2008
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
PVLDB
2010
13 years 3 months ago
2010
We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the ...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...