Keyword search algorithm of large graph based on GPU

被引：0
|
作者：
Lin H.-X. [1 ]
Qiao L.-P. [2 ]
Yuan Y. [1 ]
Wang G.-R. [1 ]
机构：
[1] School of Computer Science and Technology, Beijing Institute of Technology, Beijing
[2] School of Computer Science and Engineering, Northeastern University, Shenyang
来源：
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2022年 / 56卷 / 02期
关键词：
Attributed graph; General-purpose computing on GPU; Index; Keyword search; Parallel computing;
D O I：
10.3785/j.issn.1008-973X.2022.02.007
中图分类号：
学科分类号：
摘要：
A new keyword search algorithm on graphics processing unit (GPU) was designed based on the research of the traditional keyword search problem on graphs. First of all, a keyword search problem based on Steiner tree semantics was defined. A basic algorithm was designed on the CPU in combination with the traditional all-pair shortest path algorithm. The algorithm could not be directly transplanted to the GPU due to the characteristics of the CPU architecture. Secondly, a basic search algorithm on GPU was designed, and its advantages and remaining shortcomings compared to the CPU version were analyzed. To improve the query speed of the algorithm, an index-based optimization technique was proposed reflecting on the shortcomings of the basic search algorithm on GPU. An efficient keyword search algorithm on GPU was designed, using the relaxing and updating idea of the single-source shortest path algorithm, keyword independence, and internal integrity. Finally, an optimization idea on GPU for the r-cliques keyword search problem was proposed based on the idea of the algorithm. By analyzing the complexity of the algorithm and conducting experiments on real data sets, the correctness and effectiveness of the GPU algorithm are proved, and it is proved that the algorithm still has strong computing performance on large-scale graph data. Copyright ©2022 Journal of Zhejiang University (Engineering Science). All rights reserved.
引用
下载
收藏
页码：271 / 279
页数：8
相关论文
共 34 条
  • [1] DING B, YU J X, WANG S, Et al., Finding top-k min-cost connected trees in databases, 2007 IEEE 23rd International Conference on Data Engineering, pp. 836-845, (2007)
  • [2] KARGAR M, AN A., Keyword search in graphs: finding r-cliques, Proceedings of the VLDB Endowment, 4, 10, pp. 681-692, (2011)
  • [3] BHALOTIA G, HULGERI A, NAKHE C, Et al., Keyword searching and browsing in databases using BANKS, Proceedings of 18th International Conference on Data Engineering, pp. 431-440, (2002)
  • [4] HE H, WANG H, YANG J, Et al., Blinks: ranked keyword searches on graphs, Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 305-316, (2007)
  • [5] WANG Y, DAVIDSON A, PAN Y, Et al., Gunrock: a high-performance graph processing library on the GPU, Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1-12, (2016)
  • [6] PAGE L, BRIN S, MOTWANI R, Et al., The PageRank citation ranking: bringing order to the web, (1999)
  • [7] FLOYD R W., Algorithm 97: shortest path, Communications of the ACM, 5, 6, (1962)
  • [8] HARISH P, NARAYANAN P J., Accelerating large graph algorithms on the GPU using CUDA, International Conference on High-Performance Computing, pp. 197-208, (2007)
  • [9] BELLMAN R., On a routing problem, Quarterly of Applied Mathematics, 16, 1, pp. 87-90, (1958)
  • [10] FORD L R., Network flow theory, (1956)
1234