5 search results - page 1 / 1 » Using Bloom Filters to Speed-up Name Lookup in Distributed S... |
CJ
2002
13 years 5 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
CLUSTER
2004
IEEE
13 years 9 months ago
2004
IEEE
An efficient and distributed scheme for file mapping or file lookup scheme is critical in decentralizing metadata management within a group of metadata servers. This paper present...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
WS
2005
ACM
13 years 11 months ago
2005
ACM
Traceback schemes are useful to identify the source of an attack. Existing traceback systems are not suitable for Mobile Ad Hoc Networks (MANET) because they rely on assumptions s...