arrow
返回

Optimising Queries for Pattern Detection Over Large Scale Temporally Evolving Graphs

delete2024-01-01
delete0
delete
OA
AI
H
Hassan Nazeer Chaudhry *
M
Matteo Rossi
DOI:10.1109/ACCESS.2024.3417352delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Large-scale graph processing and Stream processing are two distinct computational paradigms for big data processing. Graph processing deals with computation on graphs of billions of vertices and edges. However, large-scale graph processing frameworks mostly work on graphs that do not change over time, while on the other end of the spectrum, stream processing operates on a continuous stream of data in real-time. Modern-day graphs change very rapidly over time, and finding patterns in temporally evolving graphs could reveal a lot of insights that can not be unveiled using traditional graph computations. We have proposed a novel framework called FlowGraph which could find patterns in dynamic and temporally evolving graphs. Computations on large-scale graphs are iterative and take multiple steps before final results can be calculated, which is very different from stream processing which is one-shot computation. Therefore, the most critical bottleneck of such a system is the time required to process the query. In this work, we have proposed a query optimization technique that could reduce the time required to process the pattern. The proposed system has an optimization technique that could reduce the time required to process the pattern, especially those related to the temporal evolution of the graph. Our method shows for eight clauses the execution time is reduced by 75%, we also proved that this improvement is not affected by the scaling of the graph or the change of elements in given clauses.
Keyword:
Optimization
Real-time systems
Query processing
Social networking (online)
Databases
Data structures
Transportation
Graph data structures
distributed computations
vertex-centric computations
temporal pattern recognition
query optimization
and dynamic graph computations

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

P
Polytechnic University of Milan
学者数:
2.0W
论文数: 1.8W
被引数: 24
引用论文

引用论文

Scalable Graph Processing Frameworks: A Taxonomy and Open Challenges可扩展的图处理框架: 分类学和开放挑战
err2018-06-12
err55
PREAI
errHeidari, Safiollah; Simmhan, Yogesh; Calheiros, Rodrigo N.; Buyya, Rajkumar
err分享
err收藏
err分享
err收藏
Graph-based methods for analysing networks in cell biology
err2006-05-23
err374
errOAAI
errAittokallio, Tero; Schwikowski, Benno
err分享
err收藏
学者 查看更多内容