A distributed streaming framework for edge–cloud triangle counting in graph streams
The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other fields. However, cloud computing based streaming algorithms cause high bandwidth occupation and long transmission latency due to limited bandwidth...
Uloženo v:
| Vydáno v: | Knowledge-based systems Ročník 278; s. 110878 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
25.10.2023
|
| Témata: | |
| ISSN: | 0950-7051, 1872-7409 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other fields. However, cloud computing based streaming algorithms cause high bandwidth occupation and long transmission latency due to limited bandwidth of the cloud. Recently, edge computing is promising to overcome the issue of transmitting large-scale data for cloud computing. However, directly applying edge computing in streaming triangle counting will reduce the accuracy of the triangle count estimation, due to the limitation of local computing at the edge network. We term the cooperations between edge computing and cloud computing for streaming triangle counting as edge–cloud triangle counting in graph streams. In this paper, we first propose a streaming framework for edge–cloud triangle counting in graph streams. Then, we propose a streaming triangle counting algorithm called Trie-based Edge Compression (TbEC) by using the binary trie at the edge network that enables lossless compression and efficient transmission to the cloud. In addition, to extend our algorithms for triangle counting in multigraphs, we present a dual deduplication strategy collaboratively using the trie-based data structure and a Bloom Filter. Our experiments with real-world datasets show that TbEC is (a) Accurate: yielding up to 3.35×more accurate smaller estimation error than the state-of-the-art distributed streaming algorithm, (b) Fast: yielding up to 10.59×faster than the state-of-the-art distributed streaming algorithm, (c) Scalable: scaling linearly with the number of edges in the input graph stream.
•A framework of edge–cloud triangle counting to count triangles in graph streams.•Algorithms TbEC and TbECOPT to reduce the transmission cost between the edge and cloud.•Algorithms TbEC-BF and TbECOPT-BF to accurately count triangles in multigraphs. |
|---|---|
| AbstractList | The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other fields. However, cloud computing based streaming algorithms cause high bandwidth occupation and long transmission latency due to limited bandwidth of the cloud. Recently, edge computing is promising to overcome the issue of transmitting large-scale data for cloud computing. However, directly applying edge computing in streaming triangle counting will reduce the accuracy of the triangle count estimation, due to the limitation of local computing at the edge network. We term the cooperations between edge computing and cloud computing for streaming triangle counting as edge–cloud triangle counting in graph streams. In this paper, we first propose a streaming framework for edge–cloud triangle counting in graph streams. Then, we propose a streaming triangle counting algorithm called Trie-based Edge Compression (TbEC) by using the binary trie at the edge network that enables lossless compression and efficient transmission to the cloud. In addition, to extend our algorithms for triangle counting in multigraphs, we present a dual deduplication strategy collaboratively using the trie-based data structure and a Bloom Filter. Our experiments with real-world datasets show that TbEC is (a) Accurate: yielding up to 3.35×more accurate smaller estimation error than the state-of-the-art distributed streaming algorithm, (b) Fast: yielding up to 10.59×faster than the state-of-the-art distributed streaming algorithm, (c) Scalable: scaling linearly with the number of edges in the input graph stream.
•A framework of edge–cloud triangle counting to count triangles in graph streams.•Algorithms TbEC and TbECOPT to reduce the transmission cost between the edge and cloud.•Algorithms TbEC-BF and TbECOPT-BF to accurately count triangles in multigraphs. |
| ArticleNumber | 110878 |
| Author | Yang, Xu Gu, Jiqing Song, Chao Li, Hongwei Li, Ke |
| Author_xml | – sequence: 1 givenname: Xu orcidid: 0000-0003-0094-6245 surname: Yang fullname: Yang, Xu email: yangxu@stu.xjtu.edu.cn organization: School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China – sequence: 2 givenname: Chao orcidid: 0000-0002-4830-1860 surname: Song fullname: Song, Chao email: chaosong@uestc.edu.cn organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 610731, China – sequence: 3 givenname: Jiqing orcidid: 0000-0002-8602-3996 surname: Gu fullname: Gu, Jiqing email: gujiqing@cuit.edu.cn organization: School of Computer Science, Chengdu University of Information Technology, Chengdu, Sichuan 610225, China – sequence: 4 givenname: Ke surname: Li fullname: Li, Ke email: Kay_Rick@stu.xjtu.edu.cn organization: School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, Shaanxi 710049, China – sequence: 5 givenname: Hongwei surname: Li fullname: Li, Hongwei email: hongweili@uestc.edu.cn organization: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 610731, China |
| BookMark | eNqFkEtOwzAURS1UJNrCDhh4Ayn-pInNAKmq-EmVmNCx5fgT3KZ2ZaegztgDO2QlJEpHDGD03uCeK90zASMfvAHgGqMZRri42cy2PqRjmhFE6AxjxEp2BsaYlSQrc8RHYIz4HGUlmuMLMElpgxAiBLMxWC-gdqmNrjq0RsPuM3LnfA1tlDvzEeIW2hCh0bX5_vxSTTho2KWlrxsDVTj4tg87D-so928nPl2CcyubZK5OdwrWD_evy6ds9fL4vFysMkVR0WZYcS5lnlesoJVUjFmirFacGm0L2a9QVBcaK2YrSq2WZSk5MQWvtNWUEzoF-dCrYkgpGiv20e1kPAqMRK9GbMSgRvRqxKCmw25_Ycq1snXBt1G65j_4boBNN-zdmSiScsYro100qhU6uL8LfgASioho |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2025_127942 |
| Cites_doi | 10.1016/j.comcom.2021.11.012 10.1145/3375392 10.1016/j.comcom.2021.01.010 10.1145/3147.3165 10.1145/3441487 10.1145/3059194 10.1007/s10618-019-00630-6 10.1038/s41467-019-09123-y 10.1145/3494562 10.1007/s13278-010-0001-9 10.1080/09540091.2020.1782840 10.1111/cgf.13410 10.3103/S0146411621040039 10.1016/j.jpdc.2017.09.014 10.1145/3022186 10.1016/j.jpdc.2021.10.001 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.knosys.2023.110878 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7409 |
| ExternalDocumentID | 10_1016_j_knosys_2023_110878 S0950705123006287 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABIVO ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADGUI ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W JJJVA KOM LG9 LY7 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SST SSV SSW SSZ T5K WH7 XPP ZMT ~02 ~G- 29L 77I 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET UHS WUQ ~HD |
| ID | FETCH-LOGICAL-c306t-1c99aa44b863bac88f2cfdc93edf6a0878c3d6d1c8fb33fda77a92e69bdfd3923 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001068890200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0950-7051 |
| IngestDate | Tue Nov 18 20:49:12 EST 2025 Sat Nov 29 07:05:49 EST 2025 Fri Feb 23 02:38:32 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Streaming graphs Approximate algorithms Distributed streaming algorithms Triangle counting |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-1c99aa44b863bac88f2cfdc93edf6a0878c3d6d1c8fb33fda77a92e69bdfd3923 |
| ORCID | 0000-0002-8602-3996 0000-0003-0094-6245 0000-0002-4830-1860 |
| ParticipantIDs | crossref_primary_10_1016_j_knosys_2023_110878 crossref_citationtrail_10_1016_j_knosys_2023_110878 elsevier_sciencedirect_doi_10_1016_j_knosys_2023_110878 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-10-25 |
| PublicationDateYYYYMMDD | 2023-10-25 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-10-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | Knowledge-based systems |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Shin, Lee, Oh, Hammoud, Faloutsos (b22) 2021; 15 Stefani, Epasto, Riondato, Upfal (b34) 2017; 11 Yu, Song, Gu, Liu (b21) 2019 Yang, Song, Yu, Gu, Liu (b23) 2022; 16 Tsourakakis, Drineas, Michelakis, Koutis, Faloutsos (b4) 2011; 1 Bader, Li, Ganeshan, Gundogdu, Lew, Rodriguez, Du (b10) 2023 Vitter (b30) 1985; 11 Lim, Kang (b16) 2015 Beg, Ahmad, Zaman, Khan (b36) 2018; vol. 10939 Xu, Palanisamy, Wang, Ludwig, Gopisetty (b39) 2022; 160 Li, Xu, Chen (b41) 2013 Chatterjee, Ruj, Bit (b42) 2021; 55 Hasan, Dave (b2) 2018; 8 Soni, Lu, Hansen, Purchase, Kobourov, Maciejewski (b31) 2018; 37 Riondato, García-Soriano, Bonchi (b35) 2014 Ramesh, Arora (b8) 2019; 9 Fu, Ghaffar, Davis, Lee (b26) 2019 Sotiropoulos, Tsourakakis (b3) 2021 Sardiu, Gilmore, Groppe, Dutta, Florens, Washburn (b9) 2019; 10 Bar-Yossef, Kumar, Sivakumar (b13) 2002 Buriol, Frahling, Leonardi, Marchetti-Spaccamela, Sohler (b33) 2006 Jiang, Jiao, Wang, Liang, Guo, Zhang, Sun, Xiong, Zhu (b5) 2022 Wen, Quoc, Bhatotia, Chen, Lee (b25) 2018 Jung, Lim, Lee, Kang (b44) 2019; 33 Lumezanu, Baden, Spring, Bhattacharjee (b7) 2009 Ahmed, Duffield, Neville, Kompella (b15) 2014 Larsson (b43) 1996 Zhou, Liu, Xu, Zhang (b1) 2019 Shin, Hammoud, Lee, Oh, Faloutsos (b20) 2018; vol. 10939 Kang, Lee, Shin (b45) 2022; 13280 Stefani, Epasto, Riondato, Upfal (b18) 2016 Lim, Jung, Kang (b17) 2018; 12 Shin, Oh, Kim, Hooi, Faloutsos (b19) 2020; 14 Zhang, Gorlatch (b6) 2020 Zhao, Yao, Zeng, Li, Xie, Zhu, Tang (b28) 2021; 33 Jowhari, Ghodsi (b32) 2005; vol. 3595 Gaba, Kumar, Kim, Monga, Kumar (b24) 2021; 169 Gou, Zou (b11) 2021 Tsourakakis, Kang, Miller, Faloutsos (b14) 2009 Pace, Aloi, Gravina, Caliciuri, Fortino, Liotta (b40) 2019; 15 Gou, Zou, Zhao, Yang (b37) 2019 Zhang, Ni, Zhang, Zhang, Yang, Wang, Yan (b38) 2022; 183 Wang, Zhao, Huang, Xu, Hsu (b29) 2019; 127 Hoffa, Mehta, Freeman, Deelman, Keahey, Berriman, Good (b12) 2008 Tiwari, Ramprasad, Mortazavi, Gabel, de Lara (b27) 2019 Jung (10.1016/j.knosys.2023.110878_b44) 2019; 33 Shin (10.1016/j.knosys.2023.110878_b20) 2018; vol. 10939 Tsourakakis (10.1016/j.knosys.2023.110878_b4) 2011; 1 Zhang (10.1016/j.knosys.2023.110878_b6) 2020 Beg (10.1016/j.knosys.2023.110878_b36) 2018; vol. 10939 Yang (10.1016/j.knosys.2023.110878_b23) 2022; 16 Jiang (10.1016/j.knosys.2023.110878_b5) 2022 Riondato (10.1016/j.knosys.2023.110878_b35) 2014 Fu (10.1016/j.knosys.2023.110878_b26) 2019 Li (10.1016/j.knosys.2023.110878_b41) 2013 Tsourakakis (10.1016/j.knosys.2023.110878_b14) 2009 Chatterjee (10.1016/j.knosys.2023.110878_b42) 2021; 55 Lim (10.1016/j.knosys.2023.110878_b16) 2015 Yu (10.1016/j.knosys.2023.110878_b21) 2019 Tiwari (10.1016/j.knosys.2023.110878_b27) 2019 Larsson (10.1016/j.knosys.2023.110878_b43) 1996 Wen (10.1016/j.knosys.2023.110878_b25) 2018 Jowhari (10.1016/j.knosys.2023.110878_b32) 2005; vol. 3595 Buriol (10.1016/j.knosys.2023.110878_b33) 2006 Bader (10.1016/j.knosys.2023.110878_b10) 2023 Shin (10.1016/j.knosys.2023.110878_b22) 2021; 15 Gou (10.1016/j.knosys.2023.110878_b37) 2019 Zhou (10.1016/j.knosys.2023.110878_b1) 2019 Hasan (10.1016/j.knosys.2023.110878_b2) 2018; 8 Shin (10.1016/j.knosys.2023.110878_b19) 2020; 14 Hoffa (10.1016/j.knosys.2023.110878_b12) 2008 Vitter (10.1016/j.knosys.2023.110878_b30) 1985; 11 Soni (10.1016/j.knosys.2023.110878_b31) 2018; 37 Stefani (10.1016/j.knosys.2023.110878_b34) 2017; 11 Ramesh (10.1016/j.knosys.2023.110878_b8) 2019; 9 Gou (10.1016/j.knosys.2023.110878_b11) 2021 Zhang (10.1016/j.knosys.2023.110878_b38) 2022; 183 Zhao (10.1016/j.knosys.2023.110878_b28) 2021; 33 Gaba (10.1016/j.knosys.2023.110878_b24) 2021; 169 Sardiu (10.1016/j.knosys.2023.110878_b9) 2019; 10 Xu (10.1016/j.knosys.2023.110878_b39) 2022; 160 Pace (10.1016/j.knosys.2023.110878_b40) 2019; 15 Sotiropoulos (10.1016/j.knosys.2023.110878_b3) 2021 Ahmed (10.1016/j.knosys.2023.110878_b15) 2014 Stefani (10.1016/j.knosys.2023.110878_b18) 2016 Bar-Yossef (10.1016/j.knosys.2023.110878_b13) 2002 Wang (10.1016/j.knosys.2023.110878_b29) 2019; 127 Kang (10.1016/j.knosys.2023.110878_b45) 2022; 13280 Lumezanu (10.1016/j.knosys.2023.110878_b7) 2009 Lim (10.1016/j.knosys.2023.110878_b17) 2018; 12 |
| References_xml | – volume: 1 start-page: 75 year: 2011 end-page: 81 ident: b4 article-title: Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation publication-title: Soc. Netw. Anal. Min. – volume: 16 start-page: 79:1 year: 2022 end-page: 79:43 ident: b23 article-title: Distributed triangle approximately counting algorithms in simple graph stream publication-title: ACM Trans. Knowl. Discov. Data – volume: 15 start-page: 38:1 year: 2021 end-page: 38:30 ident: b22 article-title: Cocos: Fast and accurate distributed triangle counting in graph streams publication-title: ACM Trans. Knowl. Discov. Data – start-page: 1501 year: 2021 end-page: 1509 ident: b3 article-title: Triangle-aware spectral sparsifiers and community detection publication-title: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining – start-page: 685 year: 2015 end-page: 694 ident: b16 article-title: MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams publication-title: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – start-page: 153 year: 2019 end-page: 158 ident: b27 article-title: Reconfigurable streaming for the mobile edge publication-title: Proceedings of the 20th International Workshop on Mobile Computing Systems and Applications, HotMobile – start-page: 415 year: 2020 end-page: 424 ident: b6 article-title: A bilateral recommendation strategy for mobile event-based social networks publication-title: MobiQuitous ’20: Computing, Networking and Services, Virtual Event / Darmstadt, Germany, December 7-9, 2020 – volume: 15 start-page: 481 year: 2019 end-page: 489 ident: b40 article-title: An edge-based architecture to support efficient applications for healthcare industry 4.0 publication-title: TII – volume: 33 start-page: 173 year: 2021 end-page: 200 ident: b28 article-title: An edge streaming data processing framework for autonomous driving publication-title: Connect. Sci. – volume: 37 start-page: 169 year: 2018 end-page: 181 ident: b31 article-title: The perception of graph properties in graph layouts publication-title: Comput. Graph. Forum – volume: 13280 start-page: 54 year: 2022 end-page: 67 ident: b45 article-title: Are edge weights in summary graphs useful? - a comparative study publication-title: 26th Pacific-Asia Conference, PAKDD – volume: 169 start-page: 114 year: 2021 end-page: 128 ident: b24 article-title: Secure device-to-device communications for 5G enabled internet of things applications publication-title: Comput. Commun. – volume: vol. 10939 start-page: 502 year: 2018 end-page: 514 ident: b36 article-title: Scalable approximation algorithm for graph summarization publication-title: 22nd Pacific-Asia Conference, PAKDD – start-page: 825 year: 2016 end-page: 834 ident: b18 article-title: Trièst: Counting local and global triangles in fully-dynamic streams with fixed memory size publication-title: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – start-page: 947 year: 2014 end-page: 952 ident: b35 article-title: Graph summarization with quality guarantees publication-title: International Conference on Data Mining, ICDM – volume: 127 start-page: 134 year: 2019 end-page: 144 ident: b29 article-title: Qos prediction for service recommendations in mobile edge computing publication-title: J. Parallel Distrib. Comput. – volume: 14 start-page: 12:1 year: 2020 end-page: 12:39 ident: b19 article-title: Fast, accurate and provable triangle counting in fully dynamic graph streams publication-title: ACM Trans. Knowl. Discov. Data – start-page: 550 year: 2013 end-page: 554 ident: b41 article-title: NSFIB construction & aggregation with next hop of strict partial order publication-title: Proceedings of the IEEE INFOCOM 2013 – volume: 33 start-page: 1225 year: 2019 end-page: 1253 ident: b44 article-title: FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams publication-title: Data Min. Knowl. Discov. – volume: 10 start-page: 1 year: 2019 end-page: 14 ident: b9 article-title: Topological scoring of protein interaction networks publication-title: Nature Commun. – year: 2023 ident: b10 article-title: Communication-efficient triangle counting – volume: vol. 3595 start-page: 710 year: 2005 end-page: 716 ident: b32 article-title: New streaming algorithms for counting triangles in graphs publication-title: Computing and Combinatorics, 11th Annual International Conference, COCOON – start-page: 837 year: 2009 end-page: 846 ident: b14 article-title: DOULION: counting triangles in massive graphs with a coin publication-title: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – start-page: 640 year: 2008 end-page: 645 ident: b12 article-title: On the use of cloud computing for scientific workflows publication-title: Fourth International Conference on E-Science – volume: 9 start-page: 28:1 year: 2019 end-page: 28:12 ident: b8 article-title: Spark’s graphx-based link prediction for social communication using triangle counting publication-title: Soc. Netw. Anal. Min. – start-page: 253 year: 2006 end-page: 262 ident: b33 article-title: Counting triangles in data streams publication-title: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems – start-page: 929 year: 2019 end-page: 946 ident: b26 article-title: EdgeWise: A better stream processing engine for the edge publication-title: USENIX Annual Technical Conference, USENIX – start-page: 190 year: 1996 end-page: 199 ident: b43 article-title: Extended application of suffix trees to data compression publication-title: Proceedings of the 6th Data Compression Conference (DCC) – start-page: 1446 year: 2014 end-page: 1455 ident: b15 article-title: Graph sample and hold: a framework for big-graph analytics publication-title: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining – volume: 11 start-page: 37 year: 1985 end-page: 57 ident: b30 article-title: Random sampling with a reservoir publication-title: ACM Trans. Math. Softw. – volume: 11 start-page: 43:1 year: 2017 end-page: 43:50 ident: b34 article-title: Trièst: Counting local and global triangles in fully dynamic streams with fixed memory size publication-title: ACM Trans. Knowl. Discov. Data – volume: 55 start-page: 319 year: 2021 end-page: 333 ident: b42 article-title: Efficient data storage and name look-up in named data networking using connected dominating set and patricia trie publication-title: Autom. Control. Comput. Sci. – start-page: 645 year: 2021 end-page: 657 ident: b11 article-title: Sliding window-based approximate triangle counting over streaming graphs with duplicate edges publication-title: International Conference on Management of Data – start-page: 623 year: 2002 end-page: 632 ident: b13 article-title: Reductions in streaming algorithms, with an application to counting triangles in graphs publication-title: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms – volume: vol. 10939 start-page: 651 year: 2018 end-page: 663 ident: b20 article-title: Tri-fly: Distributed estimation of global and local triangle counts in graph streams publication-title: 22nd Pacific-Asia Conference, PAKDD – volume: 8 year: 2018 ident: b2 article-title: Triangle counting in large networks: a review publication-title: WIREs Data Min. Knowl. Discov. – start-page: 3125 year: 2019 end-page: 3132 ident: b1 article-title: On completing sparse knowledge base with transitive relation embedding publication-title: The Thirty-Third AAAI Conference on Artificial Intelligence – start-page: 411 year: 2018 end-page: 421 ident: b25 article-title: ApproxIoT: Approximate analytics for edge computing publication-title: 38th IEEE International Conference on Distributed Computing Systems, ICDCS – volume: 183 start-page: 121 year: 2022 end-page: 135 ident: b38 article-title: A novel edge computing architecture based on adaptive stratified sampling publication-title: Comput. Commun. – volume: 12 start-page: 4:1 year: 2018 end-page: 4:28 ident: b17 article-title: Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs publication-title: ACM Trans. Knowl. Discov. Data – start-page: 177 year: 2009 end-page: 183 ident: b7 article-title: Triangle inequality variations in the internet publication-title: Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference – start-page: 401 year: 2022 end-page: 409 ident: b5 article-title: Triangle graph interest network for click-through rate prediction publication-title: WSDM ’22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21 - 25, 2022 – start-page: 294 year: 2019 end-page: 301 ident: b21 article-title: Distributed triangle counting algorithms in simple graph stream publication-title: 25th IEEE International Conference on Parallel and Distributed Systems, ICPADS – start-page: 1118 year: 2019 end-page: 1129 ident: b37 article-title: Fast and accurate graph stream summarization publication-title: 35th IEEE International Conference on Data Engineering, ICDE – volume: 160 start-page: 49 year: 2022 end-page: 64 ident: b39 article-title: Amnis: Optimized stream processing for edge computing publication-title: J. Parallel Distrib. Comput. – volume: 183 start-page: 121 year: 2022 ident: 10.1016/j.knosys.2023.110878_b38 article-title: A novel edge computing architecture based on adaptive stratified sampling publication-title: Comput. Commun. doi: 10.1016/j.comcom.2021.11.012 – volume: 15 start-page: 481 issue: 1 year: 2019 ident: 10.1016/j.knosys.2023.110878_b40 article-title: An edge-based architecture to support efficient applications for healthcare industry 4.0 publication-title: TII – volume: 14 start-page: 12:1 issue: 2 year: 2020 ident: 10.1016/j.knosys.2023.110878_b19 article-title: Fast, accurate and provable triangle counting in fully dynamic graph streams publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/3375392 – volume: vol. 10939 start-page: 502 year: 2018 ident: 10.1016/j.knosys.2023.110878_b36 article-title: Scalable approximation algorithm for graph summarization – volume: 169 start-page: 114 year: 2021 ident: 10.1016/j.knosys.2023.110878_b24 article-title: Secure device-to-device communications for 5G enabled internet of things applications publication-title: Comput. Commun. doi: 10.1016/j.comcom.2021.01.010 – start-page: 947 year: 2014 ident: 10.1016/j.knosys.2023.110878_b35 article-title: Graph summarization with quality guarantees – start-page: 837 year: 2009 ident: 10.1016/j.knosys.2023.110878_b14 article-title: DOULION: counting triangles in massive graphs with a coin – start-page: 411 year: 2018 ident: 10.1016/j.knosys.2023.110878_b25 article-title: ApproxIoT: Approximate analytics for edge computing – volume: 11 start-page: 37 issue: 1 year: 1985 ident: 10.1016/j.knosys.2023.110878_b30 article-title: Random sampling with a reservoir publication-title: ACM Trans. Math. Softw. doi: 10.1145/3147.3165 – volume: vol. 10939 start-page: 651 year: 2018 ident: 10.1016/j.knosys.2023.110878_b20 article-title: Tri-fly: Distributed estimation of global and local triangle counts in graph streams – start-page: 294 year: 2019 ident: 10.1016/j.knosys.2023.110878_b21 article-title: Distributed triangle counting algorithms in simple graph stream – start-page: 1501 year: 2021 ident: 10.1016/j.knosys.2023.110878_b3 article-title: Triangle-aware spectral sparsifiers and community detection – volume: 15 start-page: 38:1 issue: 3 year: 2021 ident: 10.1016/j.knosys.2023.110878_b22 article-title: Cocos: Fast and accurate distributed triangle counting in graph streams publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/3441487 – start-page: 177 year: 2009 ident: 10.1016/j.knosys.2023.110878_b7 article-title: Triangle inequality variations in the internet – start-page: 929 year: 2019 ident: 10.1016/j.knosys.2023.110878_b26 article-title: EdgeWise: A better stream processing engine for the edge – volume: 11 start-page: 43:1 issue: 4 year: 2017 ident: 10.1016/j.knosys.2023.110878_b34 article-title: Trièst: Counting local and global triangles in fully dynamic streams with fixed memory size publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/3059194 – volume: 13280 start-page: 54 year: 2022 ident: 10.1016/j.knosys.2023.110878_b45 article-title: Are edge weights in summary graphs useful? - a comparative study – start-page: 401 year: 2022 ident: 10.1016/j.knosys.2023.110878_b5 article-title: Triangle graph interest network for click-through rate prediction – volume: 8 issue: 2 year: 2018 ident: 10.1016/j.knosys.2023.110878_b2 article-title: Triangle counting in large networks: a review publication-title: WIREs Data Min. Knowl. Discov. – volume: 33 start-page: 1225 issue: 5 year: 2019 ident: 10.1016/j.knosys.2023.110878_b44 article-title: FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams publication-title: Data Min. Knowl. Discov. doi: 10.1007/s10618-019-00630-6 – volume: vol. 3595 start-page: 710 year: 2005 ident: 10.1016/j.knosys.2023.110878_b32 article-title: New streaming algorithms for counting triangles in graphs – volume: 10 start-page: 1 issue: 1 year: 2019 ident: 10.1016/j.knosys.2023.110878_b9 article-title: Topological scoring of protein interaction networks publication-title: Nature Commun. doi: 10.1038/s41467-019-09123-y – volume: 16 start-page: 79:1 issue: 4 year: 2022 ident: 10.1016/j.knosys.2023.110878_b23 article-title: Distributed triangle approximately counting algorithms in simple graph stream publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/3494562 – year: 2023 ident: 10.1016/j.knosys.2023.110878_b10 – start-page: 640 year: 2008 ident: 10.1016/j.knosys.2023.110878_b12 article-title: On the use of cloud computing for scientific workflows – volume: 1 start-page: 75 issue: 2 year: 2011 ident: 10.1016/j.knosys.2023.110878_b4 article-title: Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation publication-title: Soc. Netw. Anal. Min. doi: 10.1007/s13278-010-0001-9 – volume: 33 start-page: 173 issue: 2 year: 2021 ident: 10.1016/j.knosys.2023.110878_b28 article-title: An edge streaming data processing framework for autonomous driving publication-title: Connect. Sci. doi: 10.1080/09540091.2020.1782840 – start-page: 623 year: 2002 ident: 10.1016/j.knosys.2023.110878_b13 article-title: Reductions in streaming algorithms, with an application to counting triangles in graphs – start-page: 415 year: 2020 ident: 10.1016/j.knosys.2023.110878_b6 article-title: A bilateral recommendation strategy for mobile event-based social networks – start-page: 3125 year: 2019 ident: 10.1016/j.knosys.2023.110878_b1 article-title: On completing sparse knowledge base with transitive relation embedding – start-page: 825 year: 2016 ident: 10.1016/j.knosys.2023.110878_b18 article-title: Trièst: Counting local and global triangles in fully-dynamic streams with fixed memory size – start-page: 1118 year: 2019 ident: 10.1016/j.knosys.2023.110878_b37 article-title: Fast and accurate graph stream summarization – volume: 37 start-page: 169 issue: 3 year: 2018 ident: 10.1016/j.knosys.2023.110878_b31 article-title: The perception of graph properties in graph layouts publication-title: Comput. Graph. Forum doi: 10.1111/cgf.13410 – start-page: 153 year: 2019 ident: 10.1016/j.knosys.2023.110878_b27 article-title: Reconfigurable streaming for the mobile edge – start-page: 685 year: 2015 ident: 10.1016/j.knosys.2023.110878_b16 article-title: MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams – volume: 55 start-page: 319 issue: 4 year: 2021 ident: 10.1016/j.knosys.2023.110878_b42 article-title: Efficient data storage and name look-up in named data networking using connected dominating set and patricia trie publication-title: Autom. Control. Comput. Sci. doi: 10.3103/S0146411621040039 – start-page: 190 year: 1996 ident: 10.1016/j.knosys.2023.110878_b43 article-title: Extended application of suffix trees to data compression – volume: 127 start-page: 134 year: 2019 ident: 10.1016/j.knosys.2023.110878_b29 article-title: Qos prediction for service recommendations in mobile edge computing publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2017.09.014 – start-page: 550 year: 2013 ident: 10.1016/j.knosys.2023.110878_b41 article-title: NSFIB construction & aggregation with next hop of strict partial order – start-page: 1446 year: 2014 ident: 10.1016/j.knosys.2023.110878_b15 article-title: Graph sample and hold: a framework for big-graph analytics – volume: 12 start-page: 4:1 issue: 1 year: 2018 ident: 10.1016/j.knosys.2023.110878_b17 article-title: Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs publication-title: ACM Trans. Knowl. Discov. Data doi: 10.1145/3022186 – start-page: 253 year: 2006 ident: 10.1016/j.knosys.2023.110878_b33 article-title: Counting triangles in data streams – volume: 160 start-page: 49 year: 2022 ident: 10.1016/j.knosys.2023.110878_b39 article-title: Amnis: Optimized stream processing for edge computing publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2021.10.001 – volume: 9 start-page: 28:1 issue: 1 year: 2019 ident: 10.1016/j.knosys.2023.110878_b8 article-title: Spark’s graphx-based link prediction for social communication using triangle counting publication-title: Soc. Netw. Anal. Min. – start-page: 645 year: 2021 ident: 10.1016/j.knosys.2023.110878_b11 article-title: Sliding window-based approximate triangle counting over streaming graphs with duplicate edges |
| SSID | ssj0002218 |
| Score | 2.393778 |
| Snippet | The triangle counting problem in graph streams has been extensively studied in social network analysis, recommendation systems, user portraits and other... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 110878 |
| SubjectTerms | Approximate algorithms Distributed streaming algorithms Streaming graphs Triangle counting |
| Title | A distributed streaming framework for edge–cloud triangle counting in graph streams |
| URI | https://dx.doi.org/10.1016/j.knosys.2023.110878 |
| Volume | 278 |
| WOSCitedRecordID | wos001068890200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7409 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002218 issn: 0950-7051 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELYg5cCFN6LlIR-4VY527WS9PkZVEQ-p4tBK4bTyYw0pwSlNUvXIf-Af8ksYPxsoKvTAZbWy1rNO5tvx7Ow3Mwi9rFRFrTI1GTPBwmdGIkaqJWpUybEwFHZ0HZpN8IODdjoV71NAfxnaCXDn2vNzcfJfVQ1joGyfOnsNdRehMADnoHQ4gtrh-E-Kn_iPLrGPFTiTPhdEfgl0yUzDilW-fU_1RHRger5Ym13fwMN9nHv6euofMXO7oaB1krLc9GTf5WAc8RuhSSWhi4f-IcWhp-sSw0nk371PclFYP-uAotnXvIF6alDkF_Sb8QgamG0xd7kEFivCq1RGNtlYGvv0JCvpUw_iwCUDHmMJx8PPbgHrHvobDC8u_7Ve9m_7WGEXZuLacReldF5KF6XcRFuUj0U7QFuTN_vTt2XXpjTEgsvqc5pl4AJeXs2f3ZgN1-TwHrqT3inwJGLhPrrRuwfobu7XgZP5foiOJngDGrhAAxdoYIAG9kr98e17AAXOoMAZFHjmcABFmr98hI5e7R_uvSaprQbR8H64IrUWQsoRPJENU1K3raXaGi1Yb2wj_Y_TzDSm1q1VjFkjOZeC9o1Qxhpwp9ljNHAL1z9BmEsw77Wtda_YiKletqqyNfj0yta8kXYbsfwvdTrVnPetT-bdVTraRqTMOok1V_5yPc8K6JLfGP3BDlB15cyda97pKbp9AflnaLA6XffP0S19tpotT18kSP0EZ0KTcQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+distributed+streaming+framework+for+edge%E2%80%93cloud+triangle+counting+in+graph+streams&rft.jtitle=Knowledge-based+systems&rft.au=Yang%2C+Xu&rft.au=Song%2C+Chao&rft.au=Gu%2C+Jiqing&rft.au=Li%2C+Ke&rft.date=2023-10-25&rft.issn=0950-7051&rft.volume=278&rft.spage=110878&rft_id=info:doi/10.1016%2Fj.knosys.2023.110878&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_knosys_2023_110878 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0950-7051&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0950-7051&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0950-7051&client=summon |