Tripoline
Xiaolin Jiang, Chengshuo Xu, Xizhe Yin, Zhijia Zhao, Rajiv Gupta
Abstract
For compute-intensive iterative queries over a streaming graph, it is critical to evaluate the queries continuously and incrementally for best efficiency. However, the existing incremental graph processing requires a priori knowledge of the query (e.g., the source vertex of a vertex-specific query); otherwise, it has to fall back to the expensive full evaluation that starts from scratch.
Topics & Concepts
Computer scienceVertex (graph theory)A priori and a posterioriGraphScratchTheoretical computer scienceInformation retrievalProgramming languagePhilosophyEpistemologyGraph Theory and AlgorithmsCaching and Content DeliveryAdvanced Graph Neural Networks