Skip Navigation

The Computer Journal 2002 45(6):645-652; doi:10.1093/comjnl/45.6.645
© 2002 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Little, M. C.
Right arrow Articles by Speirs, N. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Using Bloom Filters to Speed-up Name Lookup in Distributed Systems

M. C. Little1,2, S. K. Shrivastava1 and N. A. Speirs1

1 Department of Computing Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, UK Email: Santosh.Shrivastava@ncl.ac.uk, Neil.Speirs@ncl.ac.uk 2 HP Arjuna Labs, 4th Floor Central Square South, Orchard Street, Newcastle Upon Tyne, UK Email: mark_little@hp.com

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 size and the probability that the filter returns the wrong result. It does this without storing the entire set, at the cost of occasionally incorrectly answering yes to the question ‘is $x$ a member of $s$?’. How Bloom filters can be used to speed up the name to location resolution process in large-scale distributed systems is discussed. The approach presented offers trade-offs between performance (the time taken to resolve an object's name to its location) and resource utilization (the amount of physical memory to store location information and the number of messages exchanged to obtain the object's address).

Received 16 May, 2000. Revised 11 April, 2002.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.