{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:17Z","timestamp":1740109217736,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T00:00:00Z","timestamp":1544659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000741","name":"University of Warwick","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000741","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00778-018-0531-8","type":"journal-article","created":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T11:46:13Z","timestamp":1544701573000},"page":"329-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cascade-aware partitioning of large graph databases"],"prefix":"10.1007","volume":"28","author":[{"given":"Gunduz Vehbi","family":"Demirci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,13]]},"reference":[{"issue":"7","key":"531_CR1","doi-asserted-by":"publisher","first-page":"540","DOI":"10.14778\/2904483.2904486","volume":"9","author":"J Huang","year":"2016","unstructured":"Huang, J., Abadi, D.J.: Leopard: Lightweight edge-oriented partitioning and replication for dynamic graphs. Proc. VLDB Endow. 9(7), 540\u2013551 (2016)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 145\u2013156. ACM, (2012)","key":"531_CR2","DOI":"10.1145\/2213836.2213854"},{"doi-asserted-by":"crossref","unstructured":"Yang, S., Yan, X., Zong, B., Khan, A.: Towards effective partition management for large graphs. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 517\u2013528. ACM, (2012)","key":"531_CR3","DOI":"10.1145\/2213836.2213895"},{"issue":"1\u20132","key":"531_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/1920841.1920853","volume":"3","author":"C Curino","year":"2010","unstructured":"Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a workload-driven approach to database replication and partitioning. Proc. VLDB Endow. 3(1\u20132), 48\u201357 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"531_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10619-017-7191-3","volume":"35","author":"A Ya\u015far","year":"2017","unstructured":"Ya\u015far, A., Gedik, B., Ferhatosmano\u011flu, H.: Distributed block formation and layout for disk-based management of large-scale graphs. Distrib. Parallel Databases 35(1), 23\u201353 (2017)","journal-title":"Distrib. Parallel Databases"},{"unstructured":"Karypis, G., Kumar, V.: Metis\u2013unstructured graph partitioning and sparse matrix ordering system, version 2.0. (1995)","key":"531_CR6"},{"unstructured":"\u00c7ataly\u00fcrek, \u00dc., Aykanat, C.: Patoh (partitioning tool for hypergraphs). In: Encyclopedia of Parallel Computing, pp. 1479\u20131487. Springer, (2011)","key":"531_CR7"},{"issue":"23","key":"531_CR8","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"unstructured":"Pujol, J.M.., Siganos, G., Erramilli, V., Rodriguez, P.: Scaling online social networks without pains. In: Proceedings of NETDB (2009)","key":"531_CR9"},{"unstructured":"Pujol, J.M., Erramilli, V., Rodriguez, P.: Divide and conquer: Partitioning online social networks. arXiv preprint arXiv:0905.4918 (2009)","key":"531_CR10"},{"issue":"4","key":"531_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/1851275.1851227","volume":"41","author":"JM Pujol","year":"2011","unstructured":"Pujol, J.M., Erramilli, V., Siganos, G., Yang, X., Laoutaris, N., Chhabra, P., Rodriguez, P.: The little engine (s) that could: scaling online social networks. ACM SIGCOMM Comput. Commun. Rev. 41(4), 375\u2013386 (2011)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"doi-asserted-by":"crossref","unstructured":"Carrasco, B., Lu, Y., da\u00a0Trindade, J.M.F.: Partitioning social networks for time-dependent queries. In: Proceedings of the 4th Workshop on Social Network Systems. ACM, (2011)","key":"531_CR12","DOI":"10.1145\/1989656.1989658"},{"doi-asserted-by":"crossref","unstructured":"Yuan, M., Stein, D., Carrasco, B., Trindade, J.M.F., Lu, Yi: Partitioning social networks for fast retrieval of time-dependent queries. In: Data Engineering Workshops (ICDEW), 2012 IEEE 28th International Conference on, pp. 205\u2013212. IEEE (2012)","key":"531_CR13","DOI":"10.1109\/ICDEW.2012.63"},{"issue":"11","key":"531_CR14","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1109\/TKDE.2014.2302291","volume":"26","author":"A Turk","year":"2014","unstructured":"Turk, A., Selvitopi, R.O., Ferhatosmanoglu, H., Aykanat, C.: Temporal workload-aware replicated partitioning for social networks. IEEE Trans. Knowl. Data Eng. 26(11), 2832\u20132845 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: Proceedings of the 13th International Conference on World Wide Web, pp. 491\u2013501. ACM, (2004)","key":"531_CR15","DOI":"10.1145\/988672.988739"},{"doi-asserted-by":"crossref","unstructured":"Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: Proceedings of the 21st International Conference on World Wide Web, pp. 519\u2013528. ACM, (2012)","key":"531_CR16","DOI":"10.1145\/2187836.2187907"},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference On Knowledge Discovery and Data Mining, pp. 1029\u20131038. ACM, (2010)","key":"531_CR17","DOI":"10.1145\/1835804.1835934"},{"unstructured":"Digg social news portal. http:\/\/digg.com\/ , (2017)","key":"531_CR18"},{"issue":"3","key":"531_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM, (2010)","key":"531_CR20","DOI":"10.1145\/1807167.1807184"},{"unstructured":"Nicoara, D., Kamali, S., Daudjee, K., Chen, L.: Hermes: Dynamic partitioning for distributed social network graph databases. In: EDBT, pp. 25\u201336, (2015)","key":"531_CR21"},{"doi-asserted-by":"crossref","unstructured":"Le, W., Kementsietsidis, A., Duan, S., Li, F.: Scalable multi-query optimization for sparql. In: IEEE 28th International Conference on Data Engineering (ICDE), pp. 666\u2013677. IEEE, (2012)","key":"531_CR22","DOI":"10.1109\/ICDE.2012.37"},{"issue":"3","key":"531_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12(3), 211\u2013223 (2001)","journal-title":"Mark. Lett."},{"doi-asserted-by":"crossref","unstructured":"Granovetter, M.: Threshold models of collective behavior. American journal of sociology, pp. 1420\u20131443, (1978)","key":"531_CR24","DOI":"10.1086\/226707"},{"doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: Learning influence probabilities in social networks. In: Proceedings of the third ACM International Conference on Web Search and Data Mining, pp. 241\u2013250. ACM, (2010)","key":"531_CR25","DOI":"10.1145\/1718487.1718518"},{"doi-asserted-by":"crossref","unstructured":"Saito, K., Nakano, R., Kimura, M.: Prediction of information diffusion probabilities for independent cascade model. In: International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, pp. 67\u201375. Springer, (2008)","key":"531_CR26","DOI":"10.1007\/978-3-540-85567-5_9"},{"doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366. ACM, (2001)","key":"531_CR27","DOI":"10.1145\/502512.502525"},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, (2003)","key":"531_CR28","DOI":"10.1145\/956755.956769"},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208. ACM, (2009)","key":"531_CR29","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van Briesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420\u2013429. ACM, (2007)","key":"531_CR30","DOI":"10.1145\/1281192.1281239"},{"doi-asserted-by":"crossref","unstructured":"Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039\u20131048. ACM, (2010)","key":"531_CR31","DOI":"10.1145\/1835804.1835935"},{"issue":"1","key":"531_CR32","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li, H., Bhowmick, S.S., Sun, A., Cui, J.: Conformity-aware influence maximization in online social networks. VLDB J. 24(1), 117\u2013141 (2015)","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946\u2013957. Society for Industrial and Applied Mathematics, (2014)","key":"531_CR33","DOI":"10.1137\/1.9781611973402.70"},{"doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386. ACM, (2014)","key":"531_CR34","DOI":"10.1145\/2588555.2593670"},{"doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: Scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 629\u2013638. ACM, (2014)","key":"531_CR35","DOI":"10.1145\/2661829.2662077"},{"doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, L.: Social influence based clustering of heterogeneous information networks. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 338\u2013346. ACM, (2013)","key":"531_CR36","DOI":"10.1145\/2487575.2487640"},{"issue":"1","key":"531_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-014-0001-4","volume":"1","author":"L Zaixin","year":"2014","unstructured":"Zaixin, L., Zhu, Y., Li, W., Weili, W., Cheng, X.: Influence-based community partition for social networks. Comput. Soc. Netw. 1(1), 1 (2014)","journal-title":"Comput. Soc. Netw."},{"doi-asserted-by":"crossref","unstructured":"Ghosh, R., Lerman, K.: Community detection using a measure of global influence. In: Advances in Social Network Mining and Analysis, pp. 20\u201335. Springer, (2010)","key":"531_CR38","DOI":"10.1007\/978-3-642-14929-0_2"},{"doi-asserted-by":"crossref","unstructured":"Barbieri, N., Bonchi, F., Manco, G.: Cascade-based community detection. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 33\u201342. ACM, (2013)","key":"531_CR39","DOI":"10.1145\/2433396.2433403"},{"issue":"6","key":"531_CR40","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.parco.2007.12.001","volume":"34","author":"C Chevalier","year":"2008","unstructured":"Chevalier, C., Pellegrini, F.: Pt-scotch: a tool for efficient parallel graph ordering. Parallel Comput. 34(6), 318\u2013331 (2008)","journal-title":"Parallel Comput."},{"key":"531_CR41","volume-title":"The Combinatorics of Network Reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C.J., Colbourn, C.J.: The Combinatorics of Network Reliability, vol. 200. Oxford University Press, New York (1987)"},{"key":"531_CR42","volume-title":"Randomized Algorithms","author":"R Motwani","year":"2010","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Chapman & Hall\/CRC, Boca Raton (2010)"},{"unstructured":"Karypis, G., Schloegel, K., Kumar, V.: Parmetis. Parallel graph partitioning and sparse matrix ordering library. Version, 2, (2003)","key":"531_CR43"},{"doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, pp. 595\u2013602. ACM, (2004)","key":"531_CR44","DOI":"10.1145\/988672.988752"},{"unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data , (June 2014)","key":"531_CR45"},{"unstructured":"Zafarani, R., Liu, H.: Social computing data repository at ASU. http:\/\/socialcomputing.asu.edu , (2009)","key":"531_CR46"},{"unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595\u2013601, Manhattan, USA, (2004). ACM Press","key":"531_CR47"},{"doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, (2015)","key":"531_CR48","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"531_CR49","first-page":"1","volume":"2","author":"D Bader","year":"2006","unstructured":"Bader, D., Madduri, K., Gilbert, J., Shah, V., Kepner, J., Meuse, T., Krishnamurthy, A.: Designing scalable synthetic compact applications for benchmarking high productivity computing systems. CT Watch 2, 1\u201310 (2006)","journal-title":"CT Watch"},{"issue":"1","key":"531_CR50","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall, M., Axelsson, D., Bergstrom, C.T.: The map equation. Eur. Phys. J. Spec. Top. 178(1), 13\u201323 (2009)","journal-title":"Eur. Phys. J. Spec. Top."},{"unstructured":"Slota, G.M., Madduri, K., Rajamanickam, S.: Pulp: Scalable multi-objective multi-constraint partitioning for small-world networks. In: Big Data (Big Data), 2014 IEEE International Conference on, pp. 481\u2013490. IEEE, (2014)","key":"531_CR51"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0531-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0531-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0531-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T04:33:55Z","timestamp":1662611635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0531-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,13]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0531-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2018,12,13]]},"assertion":[{"value":"26 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}