Efficient data structures for sparse network representation

International Journal of Computer Mathematics

Volumn 85, Issue 8, 2008, Pages 1219-1233

  Hyvonen, Jorkki ^a   Saramaki, Jari ^a   Kaski, Kimmo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Cache; Complex network; Data structure; Hashing; Linear probing

Indexed keywords

ABSOLUTE MINIMUM; CACHE; EFFICIENT DATA STRUCTURES; HASHING; LINEAR PROBING; MAIN-MEMORY ACCESS; PROCESSING POWER; REAL-WORLD NETWORKS;

BENCHMARKING; COMPLEX NETWORKS; DATA STRUCTURES;

CACHE MEMORY;

EID: 47249090000     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160701753629     Document Type: Article

References (22)

1. R. Bayer, Symmetric binary B-trees: data structures and maintenance algorithms, Acta Informat. 1 (1972), pp. 290-306.
2. J.R.J. Black, C.U. Martel, and H. Qi, Graph and hashing algorithms for modem architectures: design and performance, Proceedings of WAE, Saarbrücken, Germany, 20-22 August, 1998, pp. 87-48.
3. S. Boccaletti, Complex networks: structure and dynamics, Phys. Rep. 424 (2006), pp. 175-308.
4. K. Briggs, Graphlib, 2005; software available at http://keithbriggs.info/graphlib.html (accessed 12 September 2007).
5. J. Cantin and M. Hill, Cache performance, for selected SPEC CPU2000 benchmarks, ACM SIGARCH Comp. Archit. News 29 (2001), pp. 13-18.
6. P.Celis, P.A. Larson, and J. Munro, Robin Hood hashing, Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Loas Alamitos, CA, 1985, pp. 281-288.
7. G. Csardi, IGraph, 2007; software available at http://cneurocvs.rmki.kfki.hu/igraph/ (accessed 12 September 2007).
8. S. Dorogovtsev and J. Mendes, Evolution of networks, Adv. Phys. 51 (2002), pp. 1079-1187.
9. GNOME, GLib, 2007; software available at http://library.gnome.org/ devel/glib/stable/ (accessed 12 September 2007).
10. S. Janson, Individual displacements for linear probing hashing with different isertion policies, ACM Trans. Algorithms 1 (2005), pp. 177-213.
11. D.E. Knuth, The Stanford GmphBase: A Platform for Combinatorial Computing, Addison Wesley, Reading, MA, 1993.
12. _, The Art of Computer Programming, 2nd ed., Sorting and Searching, vol. 3, Addison Wesley, Reading, MA, 1998.
13. D. Knuth and O. Amble, Ordered hash, tables, Comput. J. 17 (1974), pp. 35-142.
14. D. Lea, A Memory Allocator, 2000. Available at http://gee.cs.oswego.edu/dl/html/malloc.html (accessed 30 May 2007).
15. D.R. Musser, G.J. Derge, and A. Saini, STL Tutorial and Reference Guide, Addison Wesley, Redwood City, CA, 2001.
16. M. Newman, The structure and function of complex networks, SIAM Rev. 45 (2003), pp. 167-256.
17. J.P. Onnela et al., Structure and tie strengths in mobile communication networks, Proc. Nat. Acad. Sci. USA 104 (2007), p. 7332.
18. _, Analysis of a large-scale weighted network of one-to-one human communication. New J. Phys. 9 (2007) 179.
19. D. Patterson and J. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3rd ed., Morgan Kaufman, San Francisco, CA, 2004.
20. K. Ross, Efficient hash probes on modern processors, Proceedings of the 2007 DBRank Workshop, April, 2007.
21. R.E. Tarjan, Amortized computational complexity, SIAM J. Algebra. Discr. Methods 6 (1985), pp. 306-318.
22. A. Viola, Exact distribution of individual displacements in linear probing hashing, ACM Trans. Algorithms 1 (2005), pp. 214-242.