Social Based Layouts for the Increase of Locality in Graph Operations

Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy. Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies.

[1]  William G. Poole,et al.  An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[2]  H. D. Simon,et al.  A spectral algorithm for envelope reduction of sparse matrices , 1993, Supercomputing '93. Proceedings.

[3]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[5]  M. Fiedler.  Eigenvectors of acyclic matrices , 1975 .

[6]  Naren Ramakrishnan,et al.  Studying Recommendation Algorithms by Graph Analysis , 2003, Journal of Intelligent Information Systems.

[7]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  Jeffrey Scott Vitter,et al.  Algorithms and Data Structures for External Memory , 2008, Found. Trends Theor. Comput. Sci..

[10]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[12]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[13]  Viktor K. Prasanna,et al.  Optimizing graph algorithms for improved cache performance , 2002, IEEE Transactions on Parallel and Distributed Systems.

[14]  Marco Pellegrini,et al.  Extraction and classification of dense communities in the web , 2007, WWW '07.

[15]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[16]  Chau-Wen Tseng,et al.  Exploiting locality for irregular scientific codes , 2006, IEEE Transactions on Parallel and Distributed Systems.

[17]  Sanjay Ranka,et al.  Memory hierarchy management for iterative graph structures , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[18]  Hsinchun Chen,et al.  A graph-based recommender system for digital library , 2002, JCDL '02.

[19]  Michael F. Goodchild,et al.  Foundations of Geographic Information Science , 2003 .

[20]  Victor Muntés-Mulero,et al.  Overlapping Community Search for social networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[21]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[23]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[25]  Paul R. Wilson,et al.  Effective “static-graph” reorganization to improve locality in garbage-collected systems , 1991, PLDI '91.

[26]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[27]  Stephan Winter,et al.  Spatial Information Theory, 8th International Conference, COSIT 2007, Melbourne, Australia, September 19-23, 2007, Proceedings , 2007, COSIT.

[28]  Katarzyna Musial,et al.  User position measures in social networks , 2009, SNA-KDD '09.

[29]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[30]  Sandeep Sen,et al.  Planar Graph Blocking for External Searching , 2002, Algorithmica.

[31]  Josep-Lluís Larriba-Pey,et al.  BIBEX: a bibliographic exploration tool based on the DEX graph query engine , 2008, EDBT '08.

[32]  Atsuyoshi Nakamura,et al.  Partitioning of Web graphs by community topology , 2005, WWW '05.

[33]  Richard Cole,et al.  Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy , 2002, ESA.

[34]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

[35]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[36]  B. Parlett.  The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices , 1974 .

[37]  Igor Jurisica,et al.  NAViGaTOR: Network Analysis, Visualization and Graphing Toronto , 2009, Bioinform..

[38]  Solomon L. Pollack,et al.  Proceedings of the 1969 24th national conference , 1969 .

[39]  Josep-Lluís Larriba-Pey,et al.  Dex: high-performance exploration on large graphs for information retrieval , 2007, CIKM '07.

[40]  Ovidiu Ivanciuc,et al.  Graph Theory in Chemistry , 2002 .

[41]  Victor Y. Pan,et al.  The complexity of the matrix eigenproblem , 1999, STOC '99.

[42]  Rajeev Raman,et al.  Algorithms — ESA 2002 , 2002, Lecture Notes in Computer Science.

[43]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[44]  José Nelson Amaral,et al.  A performance study of data layout techniques for improving data locality in refinement-based pathfinding , 2004, JEAL.

[45]  Cynthia A. Phillips,et al.  A graph-based system for network-vulnerability analysis , 1998, NSPW '98.

[46]  Lars Kulik,et al.  "Simplest" Paths: Automated Route Selection for Navigation , 2003, COSIT.