Latency-Optimal Walks in Replicated and Partitioned Graphs

  • Stefan Plantikow
  • Maik Jorra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6637)

Abstract

Executing walks in partitioned, distributed graphs with minimal latency requires reducing the number of network hops taken. This is especially important for graph databases that specialize on executing fast graph traversals. We present fast-forward-search, an algorithm that uses overlapping graph partitionings, i.e. replication, and parallel speculative execution to minimize the number of required network hops. We proof optimality of the algorithm, analyze storage, message, and computational overhead caused by the parallelism of fast-forward, and introduce escapicity, a metric for replica selection that helps reducing that parallelism at the price of lost optimality. Experiments for a set of smaller graphs indicate that fast-forward-search saves between 20 − 90 % of network hops depending on graph and replication factor and that escapicity outperforms classic measures of network centrality as a metric for replica selection in our scheme.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)Google Scholar
  2. 2.
    Averbuch, A., Neumann, M.: Partitioning Graph Databases. Master’s thesis, KTH Stockholm (2010)Google Scholar
  3. 3.
    Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a workload-driven approach to database replication and partitioning. Proceedings of the VLDB Endowment 3(1) (2010)Google Scholar
  4. 4.
    Derbel, B., Mosbah, M., Zemmari, A.: Fast distributed graph partition and application. In: 20th International Parallel and Distributed Processing Symposium, IPDPS 2006, p. 10. IEEE, Los Alamitos (2006)Google Scholar
  5. 5.
    Elsner, U.: Static and dynamic graph partitioning: A comparative study of existing algorithms. Ph.D. thesis, Technische Universität Chemnitz (2002)Google Scholar
  6. 6.
    Hastorun, D., Jampani, M., Kakulapati, G., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s highly available key-value store. In: Proc. SOSP, pp. 205–220 (2007)Google Scholar
  7. 7.
    Hwang, L., El Gamal, A.: Min-cut replication in partitioned networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14(1), 96–106 (2002)CrossRefGoogle Scholar
  8. 8.
    Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Kring, C., Newton, A.: A cell-replicating approach to minicut-based circuit partitioning. In: 1991 IEEE International Conference on Computer-Aided Design, ICCAD 1991, Digest of Technical Papers, pp. 2–5. IEEE, Los Alamitos (2002)Google Scholar
  10. 10.
    Lehmann, K., Kaufmann, M.: Decentralized algorithms for evaluating centrality in complex networks, p. 9 (2002)Google Scholar
  11. 11.
    Martínez-Bazan, N., Muntés-Mulero, V., Gómez-Villamor, S., Nin, J., Sánchez-Martínez, M.A., Larriba-Pey, J.L.: Dex: high-performance exploration on large graphs for information retrieval. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, CIKM 2007, pp. 573–582. ACM, New York (2007)CrossRefGoogle Scholar
  12. 12.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web (1999)Google Scholar
  13. 13.
    Pujol, J.M., Siganos, G., Erramilli, V., Rodriguez, P.: Scaling online social networks without pains. In: 5th International Workshop on Networking Meets Databases, NetDB 2009, co-located with SOSP (October 2009)Google Scholar
  14. 14.
    Rodriguez, M.A., Neubauer, P.: The graph traversal pattern. Computing Research Repository (CoRR) abs/1004.1001 (2010)Google Scholar
  15. 15.
    Schaeffer, S.E.: Graph clustering. Computer Science Review 1(1), 27–64 (2007)CrossRefMATHGoogle Scholar
  16. 16.
    Vingralek, R., Breitbart, Y., Sayal, M., Scheuermann, P.: Web++: A system for fast and reliable web service. In: Proceedings of the Annual Conference on USENIX Annual Technical Conference, p. 13. USENIX Association (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Stefan Plantikow
    • 1
  • Maik Jorra
    • 1
  1. 1.Zuse Institute BerlinBerlinGermany

Personalised recommendations