Using bloom filters to speed-up name lookup in distributed systems

Computer Journal

Volumn 45, Issue 6, 2002, Pages 645-652

  Little, Mark C ^a,b   Shrivastava, Santosh K ^a   Speirs, Neil A ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b HP Arjuna Labs   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; PERFORMANCE; PROBABILISTIC LOGICS; RESOURCE ALLOCATION;

BLOOM FILTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036448527     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.6.645     Document Type: Article

References (20)

1. Bloom, B.H. (1970) Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13, 422-426.
2. Mullin, J.K. (1983) A second look at Bloom filters. Commun. ACM, 26, 570-571.
3. Mullender, S.J. et al. (1990) Amoeba: a distributed operating system for the 1990s. IEEE Computer, 23, 44-53.
4. Mitzenmacher, M. (2001) Compressed Bloom filters. In Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC-01), Newport, Rhode Island, August 26-29, pp. 144-150. ACM, New York.
5. Mullin, J.K. (1988) Accessing textual documents using compressed indexes of arrays of small Bloom filters. Comp. J., 30, 343-348.
6. Shepherd, M.A., Phillips, W.J. and Chu, C.K. (1989) A fixed-size Bloom filter for searching textual documents. Comp. J., 32, 212-219.
7. Fan, L., Cao, P., Almeida, J. and Broder, A.Z. (1998) Summary cache: a scalable wide-area Web cache sharing protocol. In Proc. ACM SIGCOMM'98, Vancouver, British Columbia, August 31-September 4, pp. 254-265. ACM, New York.
8. Fan, L., Cao, P., Almeida, J. and Broder, A.Z. (2000) Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Trans. Networking, 8, 281-293.
9. Kubiatowicz, J. et al. (2000) OceanStore: an architecture for global-scale persistent storage. In Proc. 9th Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS-9), Cambridge, MA, November 12-15, pp. 190-201. ACM, New York.
10. Needham, R.M. (1993) Names. In Mullender, S.J. (ed.), Distributed Systems, pp. 315-327. Addison-Wesley, Harlow.
11. Lampson, B.W. (1986) Designing a global name service. In Proc. 5th ACM Symposium on Principles of Distributed Computing, ACM SIGACT-SIGOPS, Calgary, Alberta, Canada, August 11-13, pp. 1-10. ACM, New York.
12. Sheltzer, A.B., Lindell, R. and Popek, G.J. (1986) Name server locality and cache design in a distributed operating system. In Proc. 6th Int. Conf. on Distributed Computing Systems, Cambridge, MA, May 19-23, pp. 515-522. IEEE Computer Society Press, Washington, DC.
13. Welch, B. and Outerhout, J.K. (1986) Prefix tables: a simple mechanism for locating files in a distributed system. In Proc. 6th Int. Conf. on Distributed Computing Systems, Cambridge, MA, May 19-23, pp. 523-530. IEEE Computer Society Press, Washington, DC.
14. Cheriton, D.R. and Mann, T.P. (1989) Decentralizing a global naming service. ACM Trans. Comput. Syst., 7, 147-183.
15. Orfali, R., Harkey, D. and Edwards, J. (1996) The Essential Distributed Objects. Wiley, Chichester, UK.
16. omniORB2, Olivetti Research Laboratory. http://www.orl.com/.
17. Knuth, D.E. (1973) The Art of Computer Programming, III: Sorting and Searching. Addison-Wesley, Harlow, UK.
18. Wang, T. (1997) Integer Hash Function. Concentric Internal Report, March 1997. http://www.concentric.net.
19. Moreau, T. (1997) The Frogbit Hash Function. Connotech Experts-counsels Inc., May 1997. http://www.connotech.com.
20. Aho, A., Sethi, R. and Ullman, J.D. (1986) Compilers Principles, Techniques, and Tools. Addison-Wesley, Harlow, UK.