Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries
Authors: 
Zheng Chen, Feng Zhang, Yang Chen, Xiaokun Fang, Guanyu Feng, Xiaowei Zhu, Wenguang Chen, Xiaoyong DuAuthors Info & Claims
Zheng Chen, Feng Zhang, Yang Chen, Xiaokun Fang, Guanyu Feng, Xiaowei Zhu, Wenguang Chen, Xiaoyong DuAuthors Info & ClaimsPages 3003 - 3016
Abstract
Evolving graphs consisting of slices are large and constantly changing. For example, in Alipay, the graph generates hundreds of millions of new transaction records every day. Analyzing the graph within a temporary window is time-consuming due to the heavy merging of slices. Fortunately, we have discovered that most queries exhibit consistent patterns and possess monotonic properties. As a result, transitional results can be computed within slice generation for reuse. Accordingly, we develop MergeGraph enabling window-based monotonic graph analytics with reusable transitional results for pattern-consistent queries. MergeGraph has three advantages over previous works. First, it is the first system specifically tailored for window-based monotonic graph analytics with pattern-consistent queries. Second, it effectively utilizes transitional results from different slices concurrently. Third, MergeGraph boasts a high degree of expressiveness, supporting a broad spectrum of monotonic graph queries. Experimental results demonstrate that MergeGraph delivers significant performance benefits. In evaluating four typical graph applications, MergeGraph achieves an average speedup of 11.30× compared to state-of-the-art methods.
References
[1]
2020. China's 2020 Digital Payment Industry - WeChat Pay vs Alipay. https://thirdbridge.com/chinas-2020-digital-payment-industry-wechat-pay-vs-alipay/
[2]
2021. Top 5 enterprise graph analytics use cases. https://www.techtarget.com/searchbusinessanalytics/feature/Top-5-enterprise-graph-analytics-use-cases
[3]
2023. Alipay. https://www.alipay.com/
[4]
Mahbod Afarin, Chao Gao, Shafiur Rahman, Nael B. Abu-Ghazaleh, and Rajiv Gupta. 2023. CommonGraph: Graph Analytics on Evolving Data. In ASPLOS (2). ACM, 133--145.
[5]
António Lorvao Antunes, Elsa Cardoso, and José Barateiro. 2022. Incorporation of Ontologies in Data Warehouse/Business Intelligence Systems - A Systematic Literature Review. Int. J. Inf. Manag. Data Insights 2, 2 (2022), 100131.
[6]
Naheed Anjum Arafat, Arijit Khan, Arpit Kumar Rai, and Bishwamittra Ghosh. 2023. Neighborhood-based Hypergraph Core Decomposition. Proc. VLDB Endow. 16, 9 (2023), 2061--2074.
[7]
Timothy G. Armstrong, Vamsi Ponnekanti, Dhruba Borthakur, and Mark Callaghan. 2013. LinkBench: a database benchmark based on the Facebook social graph. In SIGMOD Conference. ACM, 1185--1196.
[8]
Ilias Azizi, Karima Echihabi, and Themis Palpanas. 2023. Elpis: Graph-Based Similarity Search for Scalable Data Science. Proc. VLDB Endow. 16, 6 (2023), 1548--1559.
[9]
Maciej Besta, Michał Podstawski, Linus Groner, Edgar Solomonik, and Torsten Hoefler. 2017. To push or to pull: On reducing communication and synchronization in graph computations. In Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing. 93--104.
[10]
Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. 2011. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the 20th international conference on World Wide Web, Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM Press, 587--596.
[11]
Paolo Boldi and Sebastiano Vigna. 2004. The WebGraph Framework I: Compression Techniques. In Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). ACM Press, Manhattan, USA, 595--601.
[12]
Lijun Chang, Mouyi Xu, and Darren Strash. 2022. Efficient Maximum k-Plex Computation over Large Sparse Graphs. Proc. VLDB Endow. 16, 2 (2022), 127--139.
[13]
Dan Chen, Chuangyi Gui, Yi Zhang, Hai Jin, Long Zheng, Yu Huang, and Xiaofei Liao. 2022. GraphFly: Efficient Asynchronous Streaming Graphs Processing via Dependency-Flow. In SC. IEEE, 45:1--45:14.
[14]
Rong Chen, Jiaxin Shi, Yanzhe Chen, Binyu Zang, Haibing Guan, and Haibo Chen. 2018. PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs. ACM Trans. Parallel Comput. 5, 3 (2018), 13:1--13:39.
[15]
Zhida Chen, Gao Cong, and Walid G. Aref. 2020. STAR: A Distributed Stream Warehouse System for Spatial Data. In SIGMOD Conference. ACM, 2761--2764.
[16]
Zheng Chen, Feng Zhang, JiaWei Guan, Jidong Zhai, Xipeng Shen, Huanchen Zhang, Wentong Shu, and Xiaoyong Du. 2023. Compressgraph: Efficient parallel graph analytics with rule-based compression. Proceedings of the ACM on Management of Data 1, 1 (2023), 1--31.
[17]
Raymond Cheng, Ji Hong, Aapo Kyrola, Youshan Miao, Xuetian Weng, Ming Wu, Fan Yang, Lidong Zhou, Feng Zhao, and Enhong Chen. 2012. Kineograph: taking the pulse of a fast-changing and connected world. In EuroSys. ACM, 85--98.
[18]
Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Hongzhi Chen, and Guoren Wang. 2022. Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach. In SIGMOD Conference. ACM, 2034--2047.
[19]
Yizhou Dai, Miao Qiao, and Lijun Chang. 2022. Anchored Densest Subgraph. In SIGMOD Conference. ACM, 1200--1213.
[20]
Wenfei Fan, Yuanhao Li, Muyang Liu, and Can Lu. 2022. A Hierarchical Contraction Scheme for Querying Big Graphs. In SIGMOD Conference. ACM, 1726--1740.
[21]
Wenfei Fan, Chao Tian, Ruiqi Xu, Qiang Yin, Wenyuan Yu, and Jingren Zhou. 2021. Incrementalizing Graph Algorithms. In SIGMOD Conference. ACM, 459--471.
[22]
Muhammad Farhan, Qing Wang, and Henning Koehler. 2022. BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale. In SIGMOD Conference. ACM, 2020--2033.
[23]
Guanyu Feng, Zixuan Ma, Daixuan Li, Shengqi Chen, Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2021. RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s. In SIGMOD Conference. ACM, 513--527.
[24]
Sen Gao, Hongchao Qin, Rong-Hua Li, and Bingsheng He. 2023. Parallel Colorful h-star Core Maintenance in Dynamic Graphs. Proc. VLDB Endow. 16, 10 (2023), 2538--2550.
[25]
Georgia Garani, Andrey V. Chernov, Ilias K. Savvas, and Maria Butakova. 2019. A Data Warehouse Approach for Business Intelligence. In WETICE. IEEE, 70--75.
[26]
Kamran Ghane. 2020. Big Data Pipeline with ML-Based and Crowd Sourced Dynamically Created and Maintained Columnar Data Warehouse for Structured and Unstructured Big Data. In ICICT. IEEE, 60--67.
[27]
Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI. USENIX Association, 17--30.
[28]
Joseph E. Gonzalez, Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ion Stoica. 2014. GraphX: Graph Processing in a Distributed Dataflow Framework. In OSDI. USENIX Association, 599--613.
[29]
Xiangyang Gou and Lei Zou. 2021. Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges. In SIGMOD Conference. ACM, 645--657.
[30]
Samuel Grossman, Heiner Litz, and Christos Kozyrakis. 2018. Making pull-based graph processing performant. ACM SIGPLAN Notices 53, 1 (2018), 246--260.
[31]
Wei Guo, Chang Meng, Enming Yuan, Zhicheng He, Huifeng Guo, Yingxue Zhang, Bo Chen, Yaochen Hu, Ruiming Tang, Xiu Li, and Rui Zhang. 2023. Compressed Interaction Graph based Framework for Multi-behavior Recommendation. In WWW. ACM, 960--970.
[32]
Wentao Han, Youshan Miao, Kaiwei Li, Ming Wu, Fan Yang, Lidong Zhou, Vijayan Prabhakaran, Wenguang Chen, and Enhong Chen. 2014. Chronos: a graph engine for temporal graph analysis. In EuroSys. ACM, 1:1--1:14.
[33]
Anand Padmanabha Iyer, Li Erran Li, Tathagata Das, and Ion Stoica. 2016. Time-evolving graph processing at scale. In GRADES. ACM, 5.
[34]
Anand Padmanabha Iyer, Qifan Pu, Kishan Patel, Joseph E. Gonzalez, and Ion Stoica. 2021. TEGRA: Efficient Ad-Hoc Analytics on Evolving Graphs. In NSDI. USENIX Association, 337--355.
[35]
Xun Jian, Zhiyuan Li, and Lei Chen. 2023. SUFF: Accelerating Subgraph Matching with Historical Data. Proc. VLDB Endow. 16, 7 (2023), 1699--1711.
[36]
Jiaxin Jiang, Yuan Li, Bingsheng He, Bryan Hooi, Jia Chen, and Johan Kok Zhi Kang. 2022. Spade: A Real-Time Fraud Detection Framework on Evolving Graphs. Proc. VLDB Endow. 16, 3 (2022), 461--469.
[37]
Xiaolin Jiang, Chengshuo Xu, Xizhe Yin, Zhijia Zhao, and Rajiv Gupta. 2021. Tripoline: generalized incremental graph processing via graph triangle inequality. In EuroSys. ACM, 17--32.
[38]
Zhiguo Jiang, Hanhua Chen, and Hai Jin. 2023. Auxo: A Scalable and Efficient Graph Stream Summarization Structure. Proc. VLDB Endow. 16, 6 (2023), 1386--1398.
[39]
Junghoon Kim, Siqiang Luo, Gao Cong, and Wenyuan Yu. 2022. DMCS : Density Modularity based Community Search. In SIGMOD Conference. ACM, 889--903.
[40]
Seongyun Ko, Taesung Lee, Kijae Hong, Wonseok Lee, In Seo, Jiwon Seo, and Wook-Shin Han. 2021. iTurboGraph: Scaling and Automating Incremental Graph Analytics. In SIGMOD Conference. ACM, 977--990.
[41]
Pradeep Kumar and H. Howie Huang. 2020. GraphOne: A Data Store for Real-time Analytics on Evolving Graphs. ACM Trans. Storage 15, 4 (2020), 29:1--29:40.
[42]
Janet Layne, Justin Carpenter, Edoardo Serra, and Francesco Gullo. 2023. Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs. Proc. VLDB Endow. 16, 9 (2023), 2075--2089.
[43]
Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.
[44]
Faming Li, Zhaonian Zou, Jianzhong Li, Xiaochun Yang, and Bin Wang. 2022. Evolving subgraph matching on temporal graphs. Knowl. Based Syst. 258 (2022), 109961.
[45]
Faming Li, Zhaonian Zou, Xianmin Liu, Jianzhong Li, Xiaochun Yang, and Bin Wang. 2023. Detecting maximum k-durable structures on temporal graphs. Knowl. Based Syst. 271 (2023), 110561.
[46]
Jia Li, Wenyue Zhao, Nikos Ntarmos, Yang Cao, and Peter Buneman. 2023. MITra: A Framework for Multi-Instance Graph Traversal. Proc. VLDB Endow. 16, 10 (2023), 2551--2564.
[47]
Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin. 2022. On Scalable Computation of Graph Eccentricities. In SIGMOD Conference. ACM, 904--916.
[48]
Yiming Li, Yanyan Shen, Lei Chen, and Mingxuan Yuan. 2023. Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank. Proc. VLDB Endow. 16, 6 (2023), 1332--1345.
[49]
Meihao Liao, Rong-Hua Li, Qiangqiang Dai, and Guoren Wang. 2022. Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach. In SIGMOD Conference. ACM, 2048--2061.
[50]
Dandan Liu and Zhaonian Zou. 2023. gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs. Proc. VLDB Endow. 16, 11 (2023), 3201--3213.
[51]
Jiesong Liu, Feng Zhang, Lv Lu, Chang Qi, Xiaoguang Guo, Dong Deng, Guoliang Li, Huanchen Zhang, Jidong Zhai, Hechen Zhang, et al. 2024. G-Learned Index: Enabling Efficient Learned Index on GPU. IEEE Transactions on Parallel and Distributed Systems (2024).
[52]
Yucheng Low, Joseph E. Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. 2014. GraphLab: A New Framework For Parallel Machine Learning. CoRR abs/1408.2041 (2014).
[53]
Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, and Xiaolin Han. 2022. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. In SIGMOD Conference. ACM, 845--859.
[54]
Peter Macko, Virendra J. Marathe, Daniel W. Margo, and Margo I. Seltzer. 2015. LLAMA: Efficient graph analytics using Large Multiversioned Arrays. In ICDE. IEEE Computer Society, 363--374.
[55]
Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In SIGMOD Conference. ACM, 135--146.
[56]
Mugilan Mariappan, Joanna Che, and Keval Vora. 2021. DZiG: sparsity-aware incremental processing of streaming graphs. In EuroSys. ACM, 83--98.
[57]
Mugilan Mariappan and Keval Vora. 2019. GraphBolt: Dependency-Driven Synchronous Processing of Streaming Graphs. In EuroSys. ACM, 25:1--25:16.
[58]
Anthony Martins, Pedro Martins, Filipe Caldeira, and Filipe Sá. 2020. An Evaluation of How Big-Data and Data Warehouses Improve Business Intelligence Decision Making. In WorldCIST (1) (Advances in Intelligent Systems and Computing), Vol. 1159. Springer, 609--619.
[59]
Youshan Miao, Wentao Han, Kaiwei Li, Ming Wu, Fan Yang, Lidong Zhou, Vijayan Prabhakaran, Enhong Chen, and Wenguang Chen. 2015. ImmortalGraph: A System for Storage and Analysis of Temporal Graphs. ACM Trans. Storage 11, 3 (2015), 14:1--14:34.
[60]
Mukesh K. Mohania. 2001. Building web warehouse for semi-structured data. Data Knowl. Eng. 39, 2 (2001), 101--103.
[61]
Derek Gordon Murray, Frank McSherry, Rebecca Isaacs, Michael Isard, Paul Barham, and Martin Abadi. 2013. Naiad: a timely dataflow system. In SOSP. ACM, 439--455.
[62]
Zhenxuan Pan, Tao Wu, Qingwen Zhao, Qiang Zhou, Zhiwei Peng, Jiefeng Li, Qi Zhang, Guanyu Feng, and Xiaowei Zhu. 2023. GeaFlow: A Graph Extended and Accelerated Dataflow System. Proceedings of the ACM on Management of Data 1, 2 (2023), 1--27.
[63]
Serafeim Papadias, Zoi Kaoudi, Jorge-Arnulfo Quiané-Ruiz, and Volker Markl. 2022. Space-Efficient Random Walks on Streaming Graphs. Proc. VLDB Endow. 16, 2 (2022), 356--368.
[64]
Chengzhi Piao, Tingyang Xu, Xiangguo Sun, Yu Rong, Kangfei Zhao, and Hong Cheng. 2023. Computing Graph Edit Distance via Neural Graph Matching. Proc. VLDB Endow. 16, 8 (2023), 1817--1829.
[65]
Vijayan Prabhakaran, Ming Wu, Xuetian Weng, Frank McSherry, Lidong Zhou, and Maya Haradasan. 2012. Managing Large Graphs on Multi-Cores with Graph Awareness. In USENIX Annual Technical Conference. USENIX Association, 41--52.
[66]
Xiafei Qiu, Wubin Cen, Zhengping Qian, You Peng, Ying Zhang, Xuemin Lin, and Jingren Zhou. 2018. Real-time Constrained Cycle Detection in Large Dynamic Graphs. Proc. VLDB Endow. 11, 12 (2018), 1876--1888.
[67]
Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. AAAI Press, 4292--4293. https://networkrepository.com
[68]
Amitabha Roy, Laurent Bindschaedler, Jasmina Malicevic, and Willy Zwaenepoel. 2015. Chaos: scale-out graph processing from secondary storage. In SOSP. ACM, 410--424.
[69]
Siddhartha Sahu and Semih Salihoglu. 2021. Graphsurge: Graph Analytics on View Collections Using Differential Computation. In SIGMOD Conference. ACM, 1518--1530.
[70]
Semih Salihoglu and Jennifer Widom. 2013. GPS: a graph processing system. In SSDBM. ACM, 22:1--22:12.
[71]
Dipanjan Sengupta, Narayanan Sundaram, Xia Zhu, Theodore L. Willke, Jeffrey S. Young, Matthew Wolf, and Karsten Schwan. 2016. GraphIn: An Online High Performance Incremental Graph Processing Framework. In Euro-Par (Lecture Notes in Computer Science), Vol. 9833. Springer, 319--333.
[72]
Amirhesam Shahvarani and Hans-Arno Jacobsen. 2021. Distributed Stream KNN Join. In SIGMOD Conference. ACM, 1597--1609.
[73]
Xiaogang Shi, Bin Cui, Yingxia Shao, and Yunhai Tong. 2016. Tornado: A System For Real-Time Iterative Analysis Over Evolving Data. In SIGMOD Conference. ACM, 417--430.
[74]
Julian Shun and Guy E. Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In PPoPP. ACM, 135--146.
[75]
Dominik Slezak, Jakub Wroblewski, Victoria Eastwood, and Piotr Synak. 2008. Brighthouse: an analytic data warehouse for ad-hoc queries. Proc. VLDB Endow. 1, 2 (2008), 1337--1345.
[76]
Yahui Sun, Shuai Ma, and Bin Cui. 2022. Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties. In SIGMOD Conference. ACM, 874--888.
[77]
David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, and Kenny Zhang. 2022. GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams. In SIGMOD Conference. ACM, 325--339.
[78]
Manuel Then, Timo Kersten, Stephan Günnemann, Alfons Kemper, and Thomas Neumann. 2017. Automatic Algorithm Transformation for Efficient Multi-Snapshot Analytics on Temporal Graphs. Proc. VLDB Endow. 10, 8 (2017), 877--888.
[79]
Anxin Tian, Alexander Zhou, Yue Wang, and Lei Chen. 2023. Maximal D-truss Search in Dynamic Directed Graphs. Proc. VLDB Endow. 16, 9 (2023), 2199--2211.
[80]
Keval Vora, Rajiv Gupta, and Guoqing Xu. 2016. Synergistic Analysis of Evolving Graphs. ACM Trans. Archit. Code Optim. 13, 4 (2016), 32:1--32:27.
[81]
Keval Vora, Rajiv Gupta, and Guoqing Xu. 2017. KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations. In ASPLOS. ACM, 237--251.
[82]
Keval Vora, Guoqing Xu, and Rajiv Gupta. 2016. Load the Edges You Need: A Generic I/O Optimization for Disk-based Graph Processing. In USENIX Annual Technical Conference. USENIX Association, 507--522.
[83]
Jingting Wang and Bao Liu. 2020. Design of ETL Tool for Structured Data Based on Data Warehouse. In CSAE. ACM, 119:1--119:5.
[84]
Kai Wang, Guoqing Xu, Zhendong Su, and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement - Scalable and Programmable Analytics over Very Large Graphs on a Single PC. In USENIX Annual Technical Conference. USENIX Association, 387--401.
[85]
Zhigang WANG, Ning WANG, Jie NIE, Zhiqiang WEI, Yu GU, and Ge YU. 2023. A lock-free approach to parallelizing personalized PageRank computations on GPU. Frontiers of Computer Science 17, 1, Article 171602 (2023), 171602 pages.
[86]
Zuozhi Wang, Kai Zeng, Botong Huang, Wei Chen, Xiaozong Cui, Bo Wang, Ji Liu, Liya Fan, Dachuan Qu, Zhenyu Hou, Tao Guan, Chen Li, and Jingren Zhou. 2020. Grosbeak: A Data Warehouse Supporting Resource-Aware Incremental Computing. In SIGMOD Conference. ACM, 2797--2800.
[87]
JianXuan Wu, Xiangnan He, Xiang Wang, Qifan Wang, Weijian Chen, Jianxun Lian, and Xing Xie. 2022. Graph convolution machine for context-aware recommender system. Frontiers of Computer Science 16, 6, Article 166614 (2022), 166614 pages.
[88]
Ming Wu, Fan Yang, Jilong Xue, Wencong Xiao, Youshan Miao, Lan Wei, Haoxiang Lin, Yafei Dai, and Lidong Zhou. 2015. GraM: scaling graph computation to the trillions. In SoCC. ACM, 408--421.
[89]
Tianyang Xu, Zhao Lu, and Yuanyuan Zhu. 2022. Efficient Triangle-Connected Truss Community Search In Dynamic Graphs. Proc. VLDB Endow. 16, 3 (2022), 519--531.
[90]
Junyong Yang, Ming Zhong, Yuanyuan Zhu, Tieyun Qian, Mengchi Liu, and Jeffrey Xu Yu. 2023. Scalable Time-Range k-Core Query on Temporal Graphs. Proc. VLDB Endow. 16, 5 (2023), 1168--1180.
[91]
Chang Ye, Yuchen Li, Bingsheng He, Zhao Li, and Jianling Sun. 2021. GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection. In SIGMOD Conference. ACM, 2348--2356.
[92]
Haoteng Yin, Muhan Zhang, Jianguo Wang, and Pan Li. 2023. SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning. Proc. VLDB Endow. 16, 11 (2023), 2939--2948.
[93]
Kaiqiang Yu, Cheng Long, Shengxin Liu, and Da Yan. 2022. Efficient Algorithms for Maximal k-Biplex Enumeration. In SIGMOD Conference. ACM, 860--873.
[94]
Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Xiaoyong Du. 2021. POCLib: A high-performance framework for enabling near orthogonal processing on compression. IEEE transactions on Parallel and Distributed Systems 33, 2 (2021), 459--475.
[95]
Yuhao Zhang and Arun Kumar. 2023. Lotan: Bridging the Gap between GNNs and Scalable Graph Analytics Engines. Proc. VLDB Endow. 16, 11 (2023), 2728--2741.
[96]
Ziwei Zhao, Xi Zhu, Tong Xu, Aakas Lizhiyu, Yu Yu, Xueying Li, Zikai Yin, and Enhong Chen. 2023. Time-interval Aware Share Recommendation via Bi-directional Continuous Time Dynamic Graphs. In SIGIR. ACM, 822--831.
[97]
Yanping Zheng, Zhewei Wei, and Jiajun Liu. 2023. Decoupled Graph Neural Networks for Large Dynamic Graphs. Proc. VLDB Endow. 16, 9 (2023), 2239--2247.
[98]
Xiangyu Zhi, Xiao Yan, Bo Tang, Ziyao Yin, Yanchao Zhu, and Minqi Zhou. 2023. CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution. Proceedings of the VLDB Endowment 17, 4 (2023), 891--903.
[99]
Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A {Computation-Centric} Distributed Graph Processing System. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). 301--316.
[100]
Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. {GridGraph}:{Large-Scale} Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). 375--386.
[101]
Xiaoke Zhu, Yang Liu, Shuhao Liu, and Wenfei Fan. 2023. MiniGraph: Querying Big Graphs with a Single Machine. Proc. VLDB Endow. 16, 9 (2023), 2172--2185.
[102]
Chaoji Zuo and Dong Deng. 2023. ARKGraph: All-Range Approximate K-Nearest-Neighbor Graph. Proc. VLDB Endow. 16, 10 (2023), 2645--2658.
Index Terms
- Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries
Index terms have been assigned to the content through auto-classification.
Recommendations
Maintaining consistent results of continuous queries under diverse window specifications
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving-yet restricted-set of tuples and thus provide timely and incremental results. Although sliding windows get frequently employed in many ...
Towards Window Analytics over Large-scale Graphs
SIGMOD '15 PhD Symposium: Proceedings of the 2015 ACM SIGMOD on PhD SymposiumIn relational DBMS, window functions have been widely used to facilitate data analytics. Surprisingly, while similar concepts have been employed for graph analytics, there has been no explicit notions of graph window analytic functions. In this paper, ...
Comments
Information & Contributors
Information
Published In
Publisher
VLDB Endowment
Publication History
Published: 30 August 2024
Published in PVLDB Volume 17, Issue 11
Check for updates
Badges
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 51Total Downloads
- Downloads (Last 12 months)51
- Downloads (Last 6 weeks)22
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in