Skip to main content

2017 | OriginalPaper | Buchkapitel

An Efficient Parallel Method for Performing Concurrent Operations on Social Networks

verfasst von : Phuong-Hanh Du, Hai-Dang Pham, Ngoc-Hoa Nguyen

Erschienen in: Computational Collective Intelligence

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents our approach to optimize the concurrent operations on a large-scale social network. Here, we focus on the directed, unweighted relationships among members in a social network. It can then be illustrated as a directed, unweighted graph. With such a large-scale dynamic social network, we face the problem of having concurrent operations from adding or removing edges dynamically while one may ask to determine the relationship between two members. To solve this challenge, we propose an efficient parallel method based on (i) utilizing an appropriate data structure, (ii) optimizing the updating actions and (iii) improving the performance of query processing by both reducing the searching space and computing in multi-threaded parallel. Our method was validated by the datasets from SigMod Contest 2016 and SNAP DataSet Collections with the good experimental results compared to other solutions.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Gong, M., Li, G., Wang, Z., Ma, L., Tian, D.: An efficient shortest path approach for social networks based on community structure. CAAI Trans. Intell. Technol. 1(1), 114–123 (2016)CrossRef Gong, M., Li, G., Wang, Z., Ma, L., Tian, D.: An efficient shortest path approach for social networks based on community structure. CAAI Trans. Intell. Technol. 1(1), 114–123 (2016)CrossRef
2.
Zurück zum Zitat Du, P.-H., Pham, H.-D., Nguyen, N.-H.: Optimizing the shortest path query on large-scale dynamic directed graph. In: The 3rd IEEE/ACM International Conference on Big Data Computing, Applications and Technologies, pp. 210–216 (2016) Du, P.-H., Pham, H.-D., Nguyen, N.-H.: Optimizing the shortest path query on large-scale dynamic directed graph. In: The 3rd IEEE/ACM International Conference on Big Data Computing, Applications and Technologies, pp. 210–216 (2016)
3.
Zurück zum Zitat Wei, J., Chen, K., Zhou, Y., Zhou, Q., He, J.: Benchmarking of distributed computing engines spark and graphlab for big data analytics. In: International Conference on Big Data Computing Service and Applications, pp. 10–13 (2016) Wei, J., Chen, K., Zhou, Y., Zhou, Q., He, J.: Benchmarking of distributed computing engines spark and graphlab for big data analytics. In: International Conference on Big Data Computing Service and Applications, pp. 10–13 (2016)
4.
Zurück zum Zitat Hallac, D., Leskovec, J., Boyd, S.: Network lasso: clustering and optimization in large graphs. In: ACM SIGKDD International Conference on KDD, pp. 387–396 (2015) Hallac, D., Leskovec, J., Boyd, S.: Network lasso: clustering and optimization in large graphs. In: ACM SIGKDD International Conference on KDD, pp. 387–396 (2015)
5.
Zurück zum Zitat U, L.H., Zhao, H.J., Yiu, M.L., Li, Y., Gong, Z.: Towards online shortest path computation. IEEE Trans. Knowl. Data Eng. 26(4), 1012–1025 (2014)CrossRef U, L.H., Zhao, H.J., Yiu, M.L., Li, Y., Gong, Z.: Towards online shortest path computation. IEEE Trans. Knowl. Data Eng. 26(4), 1012–1025 (2014)CrossRef
6.
Zurück zum Zitat Chakaravarthy, V.T., Checconi, F., Petrini, F., Sabharwal, Y.: Scalable single source shortest path algorithms for massively parallel systems. In: IEEE 28th International Parallel and Distributed Processing Symposium, pp. 889–901 (2014) Chakaravarthy, V.T., Checconi, F., Petrini, F., Sabharwal, Y.: Scalable single source shortest path algorithms for massively parallel systems. In: IEEE 28th International Parallel and Distributed Processing Symposium, pp. 889–901 (2014)
7.
Zurück zum Zitat Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: Proceedings of the ACM SIGMOD 2012, pp. 145–156 (2012) Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: Proceedings of the ACM SIGMOD 2012, pp. 145–156 (2012)
8.
Zurück zum Zitat Yahia, S.A., Benedikt, M., Lakshmanan, L., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. Proc. VLDB Endow. 1(1), 710–721 (2008)CrossRef Yahia, S.A., Benedikt, M., Lakshmanan, L., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. Proc. VLDB Endow. 1(1), 710–721 (2008)CrossRef
9.
Zurück zum Zitat Leiserson, C.E., Schardl, T.B.: A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 303–314 (2010) Leiserson, C.E., Schardl, T.B.: A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 303–314 (2010)
10.
Zurück zum Zitat Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation, pp. 17–30 (2012) Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation, pp. 17–30 (2012)
11.
Zurück zum Zitat Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: 11th USENIX Conference on Operating Systems Design and Implementation, pp. 599–613 (2014) Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: 11th USENIX Conference on Operating Systems Design and Implementation, pp. 599–613 (2014)
12.
Zurück zum Zitat Hagberg, A.A., Schult, D.A., Swar, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference, pp. 11–15 (2008) Hagberg, A.A., Schult, D.A., Swar, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference, pp. 11–15 (2008)
Metadaten
Titel
An Efficient Parallel Method for Performing Concurrent Operations on Social Networks
verfasst von
Phuong-Hanh Du
Hai-Dang Pham
Ngoc-Hoa Nguyen
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-67074-4_15