Article

Social based layouts for the increase of locality in graph operations

Authors:

Arnau Prat-Pérez,

David Dominguez-Sal,

Josep L. Larriba-PeyAuthors Info & Claims

DASFAA'11: Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I

Pages 558 - 569

Published: 22 April 2011 Publication History

Abstract

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.

References

[1]

Al-Furaih, I., Ranka, S.: Memory hierarchy management for iterative graph structures. In: IPPS/SPDP, pp. 298-302 (1998)

Digital Library

[2]

Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1-39 (2008)

Digital Library

[3]

Barnard, S., Simon, H.: Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. CPE 6(2), 101-117 (1994)

[4]

Baswana, S., Sen, S.: Planar graph blocking for external searching. Algorithmica 34(3), 298-308 (2002)

[5]

Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M.: Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 139-151. Springer, Heidelberg (2002)

Digital Library

[6]

Mirza, B.J., Keller, B.J., Ramakrishnan, N.: Studying recommendation algorithms by graph analysis. JIIS 20(2), 131-160 (2003)

Digital Library

[7]

Brown, K., Otasek, D., Ali, M., McGuffin, M., Xie, W., Devani, B., van Toch, I.L., Jurisica, I.: Navigator: Network analysis, visualization and graphing toronto. Bioinformatics 25(24), 3327-3329 (2009)

Digital Library

[8]

Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6) (2004)

[9]

Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, pp. 157-172. ACM, New York (1969)

Digital Library

[10]

Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW, pp. 461-470 (2007)

Digital Library

[11]

Duckham, M., Kulik, L.: Simplest Paths: Automated Route Selection for Navigation. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol. 2825, pp. 169-185. Springer, Heidelberg (2003)

[12]

Facebook: Press room - statistics, http://www.facebook.com/press/info.php?statistics (Last retrieved in January 2010)

[13]

Flake, G., Lawrence, S., Giles, C.: Efficient identification of web communities. In: KDD, pp. 150-160 (2000)

Digital Library

[14]

Flake, G., Lawrence, S., Giles, C., Coetzee, F.: Self-organization and identification of web communities. IEEE Computer 35(3), 66-71 (2002)

Digital Library

[15]

Gibbs, N., Poole, J., Stockmeyer, P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis 13(2), 236- 250 (1976)

[16]

Girvan, M., Newman, M.E.: Community structure in social and biological networks. PNAS 99(12), 7821-7826 (2002)

[17]

Gómez-Villamor, S., Soldevila-Miranda, G., Giménez-Vañó, A., Martínez-Bazan, N., Muntés-Mulero, V., Larriba-Pey, J.: Bibex: a bibliographic exploration tool based on the dex graph query engine. In: EDBT, pp. 735-739 (2008)

Digital Library

[18]

Han, H., Tseng, C.: Exploiting locality for irregular scientific codes. TPDS, 606-618 (2006)

Digital Library

[19]

Ino, H., Kudo, M., Nakamura, A.: Partitioning of web graphs by community topology. In: WWW, pp. 661-669 (2005)

Digital Library

[20]

Ivanciuc, O., Balaban, A.: Graph theory in chemistry. In: The Encyclopedia of Computational Chemistry, pp. 1169-1190 (1998)

[21]

Musiał, K., Kazienko, P., Bródka, P.: User position measures in social networks. In: SNA-KDD, pp. 1-9. ACM, New York (2009)

Digital Library

[22]

Karypis, G., Kumar, V.: METIS: Unstructured graph partitioning and sparse matrix ordering system, vol. 2. The University of Minnesota (1995)

[23]

Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. PRE 78(4) (2008)

[24]

Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Statistical properties of community structure in large social and information networks. In: World Wide Web Conference, pp. 695-704 (2008)

Digital Library

[25]

Martínez-Bazan, N., Muntés-Mulero, V., Gómez-Villamor, S., Nin, J., Sánchez-Martínez, M., Larriba-Pey, J.: Dex: high-performance exploration on large graphs for information retrieval. In: CIKM, pp. 573-582 (2007)

Digital Library

[26]

Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(2), 026113 (2004)

[27]

Niewiadomski, R., Amaral, J.N., Holte, R.: A performance study of data layout techniques for improving data locality in refinement-based pathfinding. JEA 9, 1-2 (2004)

Digital Library

[28]

Oprofile: Oprofile documentation, http://oprofile.sourceforge.net/docs/ (Last retrieved in January 2010)

[29]

Padrol-Sureda, A., Perarnau-Llobet, G., Pfeifle, J., Muntés-Mulero, V.: Overlapping community search for social networks. In: ICDE, pp. 992-995 (2010)

[30]

Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814-818 (2005)

[31]

Papadimitriou, C.: The np-completeness of the bandwidth minimization problem. Computing 16(3), 263-270 (1976)

[32]

Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. IEEE TPDS 15(9), 769-782 (2004)

Digital Library

[33]

Phillips, C., Swiler, L.: A graph-based system for network-vulnerability analysis. In: NSPW, pp. 71-79 (1998)

Digital Library

[34]

Prat-Pérez, A.: Master thesis: Social based layouts for the increase of locality in graph operations (2010), http://www.dama.upc.edu

[35]

Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: SC, pp. 493-502 (1993)

Digital Library

[36]

Vitter, J.: Algorithms and data structures for external memory. FTTCS 2(4), 305- 474 (2006)

Digital Library

[37]

Wilson, P., Lam, M., Moher, T.: Effective "static-graph" reorganization to improve locality in garbage-collected systems. In: PLDI, pp. 177-191 (1991).

Digital Library

Cited By

Prat-Pérez AGuisado-Gámez JSalas XKoupy PDepner SBartolini D(2017)Towards a property graph generator for benchmarkingProceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems10.1145/3078447.3078453(1-6)Online publication date: 19-May-2017
https://dl.acm.org/doi/10.1145/3078447.3078453
Rutgers PMartella CVoulgaris SBoncz P(2016)Powerful and efficient bulk shortest-path queriesProceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems10.1145/2960414.2960420(1-7)Online publication date: 24-Jun-2016
https://dl.acm.org/doi/10.1145/2960414.2960420
Prat-Pérez ADominguez-Sal DBrunat JLarriba-Pey J(2016)Put Three and Three TogetherACM Transactions on Knowledge Discovery from Data10.1145/277510810:3(1-42)Online publication date: 29-Jan-2016
https://dl.acm.org/doi/10.1145/2775108
Show More Cited By

Social based layouts for the increase of locality in graph operations
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Graph layouts via layered separators

A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. A k-track layout of a graph consists of a ...
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02: Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science

A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z ³ and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing '...
Chromatic capacity and graph operations

The chromatic capacity@g"c"a"p(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same colors, some edge is colored the same as both its vertices. We prove ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DASFAA'11: Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I

April 2011

579 pages

ISBN:9783642201486

Editors:
Jeffrey Xu Yu
The Chinese University of Hong Kong, Department of Systems Engineering and Engineering Management, Hong Kong, China
,
Myoung Ho Kim
Korea Advanced Institute of Science and Technology (KAIST), Department of Computer Science, Daejeon, Korea
,
Rainer Unland
University of Duisburg-Essen, Institute for Computer Science and Business Information Systems, Essen, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 April 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Prat-Pérez AGuisado-Gámez JSalas XKoupy PDepner SBartolini D(2017)Towards a property graph generator for benchmarkingProceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems10.1145/3078447.3078453(1-6)Online publication date: 19-May-2017
https://dl.acm.org/doi/10.1145/3078447.3078453
Rutgers PMartella CVoulgaris SBoncz P(2016)Powerful and efficient bulk shortest-path queriesProceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems10.1145/2960414.2960420(1-7)Online publication date: 24-Jun-2016
https://dl.acm.org/doi/10.1145/2960414.2960420
Prat-Pérez ADominguez-Sal DBrunat JLarriba-Pey J(2016)Put Three and Three TogetherACM Transactions on Knowledge Discovery from Data10.1145/277510810:3(1-42)Online publication date: 29-Jan-2016
https://dl.acm.org/doi/10.1145/2775108
Capotă MHegeman TIosup APrat-Pérez AErling OBoncz P(2015)GraphalyticsProceedings of the GRADES'1510.1145/2764947.2764954(1-6)Online publication date: 31-May-2015
https://dl.acm.org/doi/10.1145/2764947.2764954
Prat-Pérez ADominguez-Sal DBrunat JLarriba-Pey JChen XLebanon GWang HZaki M(2012)Shaping communities out of trianglesProceedings of the 21st ACM international conference on Information and knowledge management10.1145/2396761.2398496(1677-1681)Online publication date: 29-Oct-2012
https://dl.acm.org/doi/10.1145/2396761.2398496

View Options

View options

Media

Figures

Other

Tables

View Table of Contents