咨询与建议

限定检索结果

文献类型

  • 8 篇 会议
  • 4 篇 期刊文献

馆藏范围

  • 12 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 3 篇 软件工程
    • 1 篇 电气工程
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 12 篇 distributed grap...
  • 2 篇 graph partitioni...
  • 2 篇 offline approach
  • 2 篇 graph edge parti...
  • 2 篇 local informatio...
  • 2 篇 edge partitionin...
  • 2 篇 hybrid edge part...
  • 1 篇 pull
  • 1 篇 offstream approa...
  • 1 篇 collaborative fi...
  • 1 篇 pregel
  • 1 篇 graph query
  • 1 篇 graph analytics
  • 1 篇 stateful partiti...
  • 1 篇 graph aggregatio...
  • 1 篇 big data
  • 1 篇 attributed graph
  • 1 篇 tensor factoriza...
  • 1 篇 stream approach
  • 1 篇 vertex-cut

机构

  • 2 篇 hefei univ techn...
  • 1 篇 jiangnan univ sc...
  • 1 篇 chongqing univ k...
  • 1 篇 chongqing univ p...
  • 1 篇 chinese univ hon...
  • 1 篇 inner mongolia u...
  • 1 篇 sch comp sci & e...
  • 1 篇 chinese acad sci...
  • 1 篇 hefei univ techn...
  • 1 篇 iefei univ techn...
  • 1 篇 northeastern uni...
  • 1 篇 univ illinois de...
  • 1 篇 univ elect sci &...
  • 1 篇 univ elect sci &...
  • 1 篇 hefei univ techn...
  • 1 篇 beijing univ pos...
  • 1 篇 north china elec...
  • 1 篇 hefei univ techn...
  • 1 篇 univ elect sci &...
  • 1 篇 hong kong univ s...

作者

  • 2 篇 liu changhong
  • 2 篇 ji shengwei
  • 2 篇 wu xindong
  • 2 篇 bu chenyang
  • 2 篇 li lei
  • 2 篇 gereme fantahun
  • 2 篇 duan hancong
  • 1 篇 yu jeffrey xu
  • 1 篇 shi chengcheng
  • 1 篇 gu yu
  • 1 篇 yu ge
  • 1 篇 yan da
  • 1 篇 ayalew tewodros
  • 1 篇 tu xiaogang
  • 1 篇 ayall tewodros
  • 1 篇 zhong jiang
  • 1 篇 wang zhigang
  • 1 篇 cheng james
  • 1 篇 yang shang
  • 1 篇 lu yi

语言

  • 12 篇 英文
检索条件"主题词=Distributed graph computing"
12 条 记 录,以下是1-10 订阅
排序:
DGIC: A distributed graph Inference computing Framework Suitable For Encoder-Decoder GNN  2022
DGIC: A Distributed Graph Inference Computing Framework Suit...
收藏 引用
6th International Conference on Innovation in Artificial Intelligence (ICIAI)
作者: Pan, Zeting Chang, Junsheng Natl Univ Def Technol Coll Comp Changsha Peoples R China
*A graph is a structure that can express the relationship between objects. The emergence of GNN enables deep learning to be applied in the field of graphs. However, most GNNs are trained offline and cannot be directly... 详细信息
来源: 评论
Hybrid Pulling/Pushing for I/O-Efficient distributed and Iterative graph computing  16
Hybrid Pulling/Pushing for I/O-Efficient Distributed and Ite...
收藏 引用
ACM SIGMOD International Conference on Management of Data
作者: Wang, Zhigang Gu, Yu Bao, Yubin Yu, Ge Yu, Jeffrey Xu Northeastern Univ Shenyang Liaoning Peoples R China Chinese Univ Hong Kong Hong Kong Hong Kong Peoples R China
Billion-node graphs are rapidly growing in size in many applications such as online social networks. Most graph algorithms generate a large number of messages during iterative computations. Vertex-centric distributed ... 详细信息
来源: 评论
PECC: parallel expansion based on clustering coefficient for efficient graph partitioning
收藏 引用
distributed AND PARALLEL DATABASES 2024年 第4期42卷 447-467页
作者: Shi, Chengcheng Xie, Zhenping Jiangnan Univ Sch Artificial Intelligence & Comp Sci Wuxi 214122 Jiangsu Peoples R China Jiangnan Univ Jiangsu Key Univ Lab Software & Media Technol Huma Wuxi 214122 Jiangsu Peoples R China
In the pursuit of graph processing performance, graph partitioning, as a crucial preprocessing step, has been widely concerned. Based on an in-depth analysis of Neighbor Expansion (NE) graph partitioning algorithm, we... 详细信息
来源: 评论
Taking Heuristic Based graph Edge Partitioning One Step Ahead via OffStream Partitioning Approach  37
Taking Heuristic Based Graph Edge Partitioning One Step Ahea...
收藏 引用
37th IEEE International Conference on Data Engineering (IEEE ICDE)
作者: Ayall, Tewodros Duan, Hancong Liu, Changhong Gereme, Fantahun Abegaz, Mohammed Deleli, Mesay Sch Comp Sci & Engn Chengdu Peoples R China Univ Elect Sci & Technol China Chengdu Peoples R China
In the modern era of big data, large-scale graph computing has become challenging because of the dramatic rise in graph data size. graph edge partitioning (GEP) is a crucial preprocessing step to distributed graph pla... 详细信息
来源: 评论
distributed aggregation-based attributed graph summarization for summary-based approximate attributed graph queries
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2021年 176卷 114921-114921页
作者: Yang, Shang Yang, Zhipeng Chen, Xiaona Zhao, Jingpeng Ma, Yinglong North China Elect Power Univ Sch Control & Comp Engn Beijing 102206 Peoples R China
With the drastically increasing size of graph data with more diversified and complex structures, it becomes more challenging to summarize and query large attributed graph data. In this paper, we propose a holistic app... 详细信息
来源: 评论
Local graph Edge Partitioning
收藏 引用
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY 2021年 第5期12卷 61-61页
作者: Ji, Shengwei Bu, Chenyang Li, Lei Wu, Xindong Iefei Univ Technol Key Lab Knowledge Engn Big Data Minist Educ China Hefei Peoples R China Hefei Univ Technol Sch Comp Sci & Informat Engn Hefei Peoples R China Hefei Univ Technol Inst Big Knowledge Sci 420 Fei Cui Rd Hefei Anhui Peoples R China Mininglamp Technol Mininglamp Acad Sci 420 Fei Cui Rd Hefei Anhui Peoples R China
graph edge partitioning, which is essential for the efficiency of distributed graph computation systems, divides a graph into several balanced partitions within a given size to minimize the number of vertices to be cu... 详细信息
来源: 评论
DETER: Streaming graph Partitioning via Combined Degree and Cluster Information  19th
DETER: Streaming Graph Partitioning via Combined Degree and ...
收藏 引用
19th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)
作者: Hu, Cong Zhong, Jiang Li, Qi Li, Qing Chongqing Univ Chongqing 400044 Peoples R China Chongqing Univ Key Lab Dependable Serv Comp Cyber Phys Soc Chongqing 400044 Peoples R China
Efficient graph partitioning plays an important role in distributed graph processing systems with the rapid growth of the scale of graph data. The quality of partitioning affects the performance of systems greatly. Ho... 详细信息
来源: 评论
OffStreamNG: Partial Stream Hybrid graph Edge Partitioning Based on Neighborhood Expansion and Greedy Heuristic  1
收藏 引用
24th East-European Conference on Advances in Databases and Information Systems/24th International Conference on Theory and Practice of Digital Libraries/16th Workshop on Business Intelligence and Big Data (ADBIS/TPDL/EDA)
作者: Ayalew, Tewodros Duan, Hancong Liu, Changhong Gereme, Fantahun Delele, Mesay Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China Univ Elect Sci & Technol China Inst Fundamental & Frontier Sci Chengdu Peoples R China Univ Elect Sci & Technol China Sch Informat Sci & Engn Chengdu Peoples R China
Recently, graph edge partitioning has shown better partitioning quality than the vertex graph partitioning for the skewed degree distribution of real-world graph data. graph edge partitioning can be classified as stre... 详细信息
来源: 评论
Local graph Edge Partitioning with a Two-Stage Heuristic Method  39
Local Graph Edge Partitioning with a Two-Stage Heuristic Met...
收藏 引用
39th IEEE International Conference on distributed computing Systems (ICDCS)
作者: Ji, Shengwei Bu, Chenyang Li, Lei Wu, Xindong Hefei Univ Technol Sch Comp Sci & Informat Engn Hefei Peoples R China Hefei Univ Technol Key Lab Knowledge Engn Big Data Minist Educ Hefei Peoples R China Hefei Univ Technol Inst Big Knowledge Sci Hefei Peoples R China Mininglamp Acad Sci Mininglamp Technol Beijing Peoples R China
graph edge partitioning divides the edges of an input graph into multiple balanced partitions of a given size to minimize the sum of vertices that are cut, which is critical to the performance of distributed graph com... 详细信息
来源: 评论
Finding Mutual X at WeChat-Scale Social Network in Ten Minitues
Finding Mutual X at WeChat-Scale Social Network in Ten Minit...
收藏 引用
IEEE International Conference on Big Data (Big Data)
作者: He, Conghui Sun, Shijie Li, Benli Tu, Xiaogang Yu, Donghai Tencent Inc Shenzhen Guangdong Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Guangdong Peoples R China
The problem of finding mutual X is essential in mining and analysis of complex social networks. X can be user's public data such as friends, education information, etc. However, massive social networks pose a sign... 详细信息
来源: 评论