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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)
Averbuch, A., Neumann, M.: Partitioning Graph Databases. Master’s thesis, KTH Stockholm (2010)
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)
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)
Elsner, U.: Static and dynamic graph partitioning: A comparative study of existing algorithms. Ph.D. thesis, Technische Universität Chemnitz (2002)
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)
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)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)
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)
Lehmann, K., Kaufmann, M.: Decentralized algorithms for evaluating centrality in complex networks, p. 9 (2002)
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)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web (1999)
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)
Rodriguez, M.A., Neubauer, P.: The graph traversal pattern. Computing Research Repository (CoRR) abs/1004.1001 (2010)
Schaeffer, S.E.: Graph clustering. Computer Science Review 1(1), 27–64 (2007)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plantikow, S., Jorra, M. (2011). Latency-Optimal Walks in Replicated and Partitioned Graphs. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds) Database Systems for Adanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20244-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-20244-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20243-8
Online ISBN: 978-3-642-20244-5
eBook Packages: Computer ScienceComputer Science (R0)