1. Bender M, Kuszmaul B (2013) Data structures and algorithms for big databases. 7th extremely large databases conference, workshop, and tutorials (XLDB), Stanford University, California, USA
2. Black P (2009) Hash table. In Pieterse V, Black P (eds) Dictionary of algorithms and data structures. http://www.nist.gov/dads/HTML/hashtab.html
3. Black P (2014) Skip list. In Pieterse V and Black P (eds) Dictionary of algorithms and data structures. https://www.nist.gov/dads/HTML/skiplist.html
4. Bloom B (1970) Space/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422–426
5. Boldi P, Rosa M, Vigna S (2011) HyperANF: approximating the neighbourhood function of very large graphs on a budget. In: Srinivasan S et al. (eds) Proceedings of the 20th international conference on World Wide Web, March 2011, Hyderabad, India, pp 625–634