Page 377 - 《软件学报》2026年第5期

2256 软件学报 2026 年第 37 卷第 5 期

Int’l Conf. on Management of Data. ACM, 2021. 1946–1958. [doi: 10.1145/3448016.3452826]
[21] Wei F. TEDI: Efficient shortest path query answering on graphs. In: Proc. of the 2010 ACM SIGMOD Int’l Conf. on Management of
Data. Indianapolis: ACM, 2010. 99–110. [doi: 10.1145/1807167.1807181]
[22] Sun Z, Wang HZ, Wang HX, Shao B, Li JZ. Efficient subgraph matching on billion node graphs. Proc. of the VLDB Endowment, 2012,
5(9): 788–799. [doi: 10.14778/2311906.2311907]
[23] Jiang JX, Choi B, Xu JL, Bhowmick SS. A generic ontology framework for indexing keyword search on massive graphs. IEEE Trans. on
Knowledge and Data Engineering, 2021, 33(6): 2322–2336. [doi: 10.1109/tkde.2019.2956535]
[24] Ghanbarpour A, Niknafs K, Naderi H. Efficient keyword search over graph-structured data based on minimal covered r-cliques. Frontiers
of Information Technology & Electronic Engineering, 2020, 21(3): 448–464. [doi: 10.1631/FITEE.1800133]
[25] Singh K, Singh V. Graph pattern matching: A brief survey of challenges and research directions. In: Proc. of the 3rd Int’l Conf. on
Computing for Sustainable Global Development. New Delhi: IEEE, 2016. 199–204.
[26] Bouhenni S, Yahiaoui S, Nouali-Taboudjemat N, Kheddouci H. Distributed graph pattern matching via bounded dual simulation.
Information Sciences, 2022, 610: 549–570. [doi: 10.1016/j.ins.2022.08.038]
[27] Ullmann JR. An algorithm for subgraph isomorphism. Journal of the ACM, 1976, 23(1): 31–42. [doi: 10.1145/321921.321925]
[28] Cordella LP, Foggia P, Sansone C, Vento M. A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. on Pattern
Analysis and Machine Intelligence, 2004, 26(10): 1367–1372. [doi: 10.1109/TPAMI.2004.75]
[29] Shasha D, Wang JTL, Giugno R. Algorithmics and applications of tree and graph searching. In: Proc. of the 21st ACM SIGMOD-
SIGACT-SIGART Symp. on Principles of Database Systems. Madison: ACM, 2002. 39–52. [doi: 10.1145/543613.543620]
[30] Zhao PX, Han JW. On graph query optimization in large networks. Proc. of the VLDB Endowment, 2010, 3(1–2): 340–351. [doi: 10.
14778/1920841.1920887]
[31] Han WS, Lee J, Lee JH. Turbo iso : Towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proc. of the
2013 ACM SIGMOD Int’l Conf. on Management of Data. New York: ACM, 2013. 337–348. [doi: 10.1145/2463676.2465300]
[32] Carletti V, Foggia P, Saggese A, Vento M. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs
with VF3. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2018, 40(4): 804–818. [doi: 10.1109/TPAMI.2017.2696940]
[33] Sun SX, Luo Q. Subgraph matching with effective matching order and indexing. IEEE Trans. on Knowledge and Data Engineering, 2022,
34(1): 491–505. [doi: 10.1109/tkde.2020.2980257]
[34] Ouyang D, Wen D, Qin L, Chang LJ, Lin XM, Zhang Y. When hierarchy meets 2-hop-labeling: Efficient shortest distance and path
queries on road networks. The VLDB Journal, 2023, 32(6): 1263–1287. [doi: 10.1007/s00778-023-00789-x]
[35] Akiba T, Iwata Y, Yoshida Y. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proc. of the
2013 ACM SIGMOD Int’l Conf. on Management of Data. New York: ACM, 2013. 349–360. [doi: 10.1145/2463676.2465315]
[36] Fu AWC, Wu HH, Cheng J, Wong RCW. IS-Label: An independent-set based labeling scheme for point-to-point distance querying. Proc.
of the VLDB Endowment, 2013, 6(6): 457–468. [doi: 10.14778/2536336.2536346]

附中文参考文献
[4] 李阅志, 祝园园, 钟鸣. 基于 k-核过滤的社交网络影响最大化算法. 计算机应用, 2018, 38(2): 464–470. [doi: 10.11772/j.issn.1001-
9081.2017071820]

作者简介
陈迪, 博士, 讲师, 主要研究领域为图数据分析与管理, 时空众包在线算法设计.
袁野, 博士, 教授, 博士生导师, CCF 杰出会员, 主要研究领域为大图数据管理与分析, 基于大数据的人工智能, 区块链.
潘雅妮, 硕士, 主要研究领域为图数据挖掘, 图计算.
王国仁, 博士, 教授, 博士生导师, CCF 杰出会员, 主要研究领域为不确定数据管理, 数据密集型计算, 可视媒体数据管理与分析, 非结构化
数据管理, 分布式查询处理与优化技术.