Sciweavers

4438 search results - page 21 / 888
» On the Distribution of Keys by Hashing
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 1 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
15 years 6 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
PVLDB
2010
164views more  PVLDB 2010»
14 years 10 months ago
FlashStore: High Throughput Persistent Key-Value Store
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 ...
Biplob Debnath, Sudipta Sengupta, Jin Li
GLOBECOM
2008
IEEE
14 years 12 months ago
On the Impact of Caching for High Performance Packet Classifiers
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
Harald Widiger, Andreas Tockhorn, Dirk Timmermann
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 5 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...