{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T08:46:59Z","timestamp":1789375619958,"version":"build-2803163510"},"publisher-location":"New York, New York, USA","reference-count":11,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1145\/2938503.2938506","type":"proceedings-article","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T13:33:45Z","timestamp":1473687225000},"page":"142-147","source":"Crossref","is-referenced-by-count":9,"title":["DynamicDFEP"],"prefix":"10.1145","author":[{"given":"Chayma","family":"Sakouhi","sequence":"first","affiliation":[{"name":"Jendouba University, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sabeur","family":"Aridhi","sequence":"additional","affiliation":[{"name":"Aalto University, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessio","family":"Guerrieri","sequence":"additional","affiliation":[{"name":"University of Trento, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salma","family":"Sassi","sequence":"additional","affiliation":[{"name":"Jendouba University, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[{"name":"University of Trento, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"key-10.1145\/2938503.2938506-1","unstructured":"J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI'12, pages 17--30, Berkeley, CA, USA, 2012. USENIX Association."},{"key":"key-10.1145\/2938503.2938506-2","doi-asserted-by":"crossref","unstructured":"A. Guerrieri and A. Montresor. DFEP: distributed funding-based edge partitioning. In Proc. of the 21st Int. Conf. on Parallel and Distributed Computing (Europar'15), pages 346--358, 2015.","DOI":"10.1007\/978-3-662-48096-0_27"},{"key":"key-10.1145\/2938503.2938506-3","doi-asserted-by":"crossref","unstructured":"M. Han and K. Daudjee. Giraph unchained: Barrierless asynchronous parallel execution in Pregel-like graph processing systems. Proc. VLDB Endow., 8(9):950--961, May 2015.","DOI":"10.14778\/2777598.2777604"},{"key":"key-10.1145\/2938503.2938506-4","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, Supercomputing '95, New York, NY, USA, 1995. ACM.","DOI":"10.1145\/224170.224229"},{"key":"key-10.1145\/2938503.2938506-5","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359--392, Dec. 1998.","DOI":"10.1137\/S1064827595287997"},{"key":"key-10.1145\/2938503.2938506-6","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data, 2014."},{"key":"key-10.1145\/2938503.2938506-7","doi-asserted-by":"crossref","unstructured":"Y. Low, D. Bickson, J. Gonzalez, and et al. Distributed GraphLab: A framework for machine learning and data mining in the cloud. Proc. VLDB Endow., 5(8):716--727, Apr. 2012.","DOI":"10.14778\/2212351.2212354"},{"key":"key-10.1145\/2938503.2938506-8","doi-asserted-by":"crossref","unstructured":"G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pages 135--146, New York, NY, USA, 2010. ACM.","DOI":"10.1145\/1807167.1807184"},{"key":"key-10.1145\/2938503.2938506-9","doi-asserted-by":"crossref","unstructured":"G. L. Miller, S. Teng, and S. A. Vavasis. A unified geometric approach to graph separators. pages 538--547, Puerto Rico, Oct 1991. IEEE.","DOI":"10.1109\/SFCS.1991.185417"},{"key":"key-10.1145\/2938503.2938506-10","doi-asserted-by":"crossref","unstructured":"F. Rahimian, A. H. Payberah, S. Girdzijauskas, M. Jelasity, and S. Haridi. Ja-be-ja: A distributed algorithm for balanced graph partitioning. In Self-Adaptive and Self-Organizing Systems (SASO), 2013 IEEE 7th International Conference on, pages 51--60, Sept 2013.","DOI":"10.1109\/SASO.2013.13"},{"key":"key-10.1145\/2938503.2938506-11","doi-asserted-by":"crossref","unstructured":"Y. Tian, A. Balmin, S. A. Corsten, S. Tatikonda, and J. McPherson. From think like a vertex to think like a graph. Proceedings of the VLDB Endowment, 7(3):193--204, 2013.","DOI":"10.14778\/2732232.2732238"}],"event":{"name":"the 20th International Database Engineering & Applications Symposium","location":"Montreal, QC, Canada","acronym":"IDEAS '16","number":"20","sponsor":["Keio University"],"start":{"date-parts":[[2016,7,11]]},"end":{"date-parts":[[2016,7,13]]}},"container-title":["Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2938503.2938506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2938506&ftid=1786993&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:38:21Z","timestamp":1750282701000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2938503.2938506"}},"subtitle":["A Distributed Edge Partitioning Approach for Large Dynamic Graphs"],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1145\/2938503.2938506","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}