Skip to main content
SpringerLink
Log in

Social Based Layouts for the Increase of Locality in Graph Operations

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6587))

Included in the following conference series:

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.

The members of DAMA-UPC thank the Ministry of Science and Innovation of Spain and Generalitat de Catalunya, for grant numbers TIN2009-14560-C03-03 and GRC-1087 respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

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

    Google Scholar 

  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)

    Article  Google Scholar 

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

    Google Scholar 

  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)

    Chapter  Google Scholar 

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

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

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

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

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

    Article  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  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)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DAMA-UPC, Department d’Arquitectura de Computadors, Universitat Politècnica de Catalunya, Campus Nord, C/Jordi Girona 1-3, 08034, Barcelona, Catalonia, Spain

    Arnau Prat-Pérez, David Dominguez-Sal & Josep L. Larriba-Pey

Authors
  1. Arnau Prat-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Dominguez-Sal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josep L. Larriba-Pey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong,, Shatin, N.T., Hong Kong, China

    Jeffrey Xu Yu

  2. Department of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 291 Daehak-ro (373-1 Guseong-don), Yuseong-gu, 305-701, Daejeon, Korea

    Myoung Ho Kim

  3. Institute for Computer Science and Business Information Systems (ICB), University of Duisburg-Essen, Schützenbahn 70, 45117, Essen, Germany

    Rainer Unland

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prat-Pérez, A., Dominguez-Sal, D., Larriba-Pey, J.L. (2011). Social Based Layouts for the Increase of Locality in Graph Operations. In: Yu, J.X., Kim, M.H., Unland, R. (eds) Database Systems for Advanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20149-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20149-3_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20148-6

  • Online ISBN: 978-3-642-20149-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation