{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:26Z","timestamp":1742964566928,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642202438"},{"type":"electronic","value":"9783642202445"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20244-5_3","type":"book-chapter","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T04:14:17Z","timestamp":1302581657000},"page":"14-27","source":"Crossref","is-referenced-by-count":2,"title":["Latency-Optimal Walks in Replicated and Partitioned Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Plantikow","sequence":"first","affiliation":[]},{"given":"Maik","family":"Jorra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Angles, R., Guti\u00e9rrez, C.: Survey of graph database models. ACM Comput. Surv.\u00a040(1) (2008)","DOI":"10.1145\/1322432.1322433"},{"key":"3_CR2","unstructured":"Averbuch, A., Neumann, M.: Partitioning Graph Databases. Master\u2019s thesis, KTH Stockholm (2010)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a workload-driven approach to database replication and partitioning. Proceedings of the VLDB Endowment\u00a03(1) (2010)","DOI":"10.14778\/1920841.1920853"},{"key":"3_CR4","first-page":"10","volume-title":"20th International Parallel and Distributed Processing Symposium, IPDPS 2006","author":"B. Derbel","year":"2006","unstructured":"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)"},{"key":"3_CR5","unstructured":"Elsner, U.: Static and dynamic graph partitioning: A comparative study of existing algorithms. Ph.D. thesis, Technische Universit\u00e4t Chemnitz (2002)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Hastorun, D., Jampani, M., Kakulapati, G., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon\u2019s highly available key-value store. In: Proc. SOSP, pp. 205\u2013220 (2007)","DOI":"10.1145\/1323293.1294281"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/43.363121","volume":"14","author":"L. Hwang","year":"2002","unstructured":"Hwang, L., El Gamal, A.: Min-cut replication in partitioned networks. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a014(1), 96\u2013106 (2002)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020, 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"3_CR9","first-page":"2","volume-title":"1991 IEEE International Conference on Computer-Aided Design, ICCAD 1991, Digest of Technical Papers","author":"C. Kring","year":"2002","unstructured":"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\u20135. IEEE, Los Alamitos (2002)"},{"key":"3_CR10","unstructured":"Lehmann, K., Kaufmann, M.: Decentralized algorithms for evaluating centrality in complex networks, p. 9 (2002)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/1321440.1321521","volume-title":"Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, CIKM 2007","author":"N. Mart\u00ednez-Bazan","year":"2007","unstructured":"Mart\u00ednez-Bazan, N., Munt\u00e9s-Mulero, V., G\u00f3mez-Villamor, S., Nin, J., S\u00e1nchez-Mart\u00ednez, 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\u2013582. ACM, New York (2007)"},{"key":"3_CR12","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web (1999)"},{"key":"3_CR13","unstructured":"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)"},{"key":"3_CR14","unstructured":"Rodriguez, M.A., Neubauer, P.: The graph traversal pattern. Computing Research Repository (CoRR) abs\/1004.1001 (2010)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"3_CR16","unstructured":"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)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Adanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20244-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:57:51Z","timestamp":1558558671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20244-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642202438","9783642202445"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20244-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}