Page 461 - 《软件学报》2025年第9期
P. 461

4372                                                       软件学报  2025  年第  36  卷第  9  期


                 [32]   Jung M, Lim Y, Lee S, Kang U. FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams. Data
                     Mining and Knowledge Discovery, 2019, 33(5): 1225–1253. [doi: 10.1007/s10618-019-00630-6]
                 [33]   Zhang LL, Zhang ZW, Wang GR, Yuan Y, Zhao KF. Efficiently counting triangles for hypergraph streams by reservoir-based sampling.
                     IEEE Trans. on Knowledge and Data Engineering, 2023, 35(11): 11328–11341. [doi: 10.1109/TKDE.2023.3236335]
                 [34]   Yang X, Song C, Yu MD, Gu JQ, Liu M. Distributed triangle approximately counting algorithms in simple graph stream. ACM Trans. on
                     Knowledge Discovery from Data (TKDD), 2022, 16(4): 79. [doi: 10.1145/3494562]
                 [35]   Yang X, Song C, Gu JQ, Li K, Li HW. A distributed streaming framework for edge-cloud triangle counting in graph streams. Knowledge-
                     based Systems, 2023, 278: 110878. [doi: 10.1016/j.knosys.2023.110878]
                 [36]   Wang KX, Long C, Yan D, Zhang J, Jagadish HV. Reinforcement learning enhanced weighted sampling for accurate subgraph counting
                     on fully dynamic graph streams. In: Proc. of the 39th IEEE Int’l Conf. on Data Engineering (ICDE). Anaheim: IEEE, 2023. 1084–1097.
                     [doi: 10.1109/ICDE55515.2023.00088]
                 [37]   Babcock B, Datar M, Motwani R. Sampling from a moving window over streaming data. In: Proc. of the 13th Annual ACM-SIAM Symp.
                     on Discrete Algorithms. San Francisco: ACM, 2002. 633–634.
                 [38]   Flajolet P, Fusy É, Gandouet O, Meunier F. HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm. In: Proc. of
                     the 2007 Conf. om Analysis of Algorithms. HAL, 2007. 137–156. [doi: 10.46298/dmtcs.3545]
                 [39]   Stack overflow data source. 2024. http://konect.cc/networks/sx-stackoverflow/
                 [40]   Kunegis J. KONECT: The Koblenz network collection. In: Proc. of the 22nd Int’l Conf. on World Wide Web. Rio de Janeiro: ACM,
                     2013. 1343–1350. [doi: 10.1145/2487788.2488173]
                 [41]   Wikipedia Link data source. 2024. https://dumps.wikimedia.org/
                 [42]   Yahoo data source. 2024. https://webscope.sandbox.yahoo.com/catalog.php?datatype=g

                 附中文参考文献:
                 [22]   王旭, 杨晓春. 基于  FLINK  的滑动窗口内三角形计数算法研究. 计算机科学, 2020, 47(10): 83–90. [doi: 10.11896/jsjkx.190900014]


                             苟向阳(1995-), 男, 博士, CCF  专业会员, 主要             于旭(1958-), 男, 博士, 教授, 博士生导师, 主要
                            研究领域为图流数据, 图查询算法.                            研究领域为图数据库, 图挖掘, 社交网络, 大数
                                                                         据, 云计算, 数据库中的机器学习算法.



                             邹磊(1981-), 男, 博士, 教授, 博士生导师, CCF
                            杰出会员, 主要研究领域为图数据库, 知识图谱,
                            面向图的软硬件协调计算, 图数据在大数据方面
                            的应用.
   456   457   458   459   460   461   462   463   464   465   466