Enhanced Stored Procedures Development for GraphScope Interactive Graph Query Engine

[zhanglei1949]

GraphScope Interactive, a key component of the GraphScope project, focuses on querying and analyzing complex graph data, playing a crucial role in real-time data intelligence. It swiftly identifies anomalous nodes or anomaly patterns involving multiple entities based on relationship networks, supporting risk control and attack prevention in business systems. Traditionally, graph analysis relies on business users explicitly writing graph queries like Gremlin and Cypher, which increases the user's learning curve. Additionally, complex operations (like weighted shortest path calculations) are challenging to execute due to the declarative nature of graph queries.

To tackle these challenges, our project adopts the concept of stored procedures, commonly used in database systems, aiming to integrate this feature into GraphScope Interactive's graph querying system. We plan to encapsulate complex graph analysis logic through builtin stored procedures, so users can easily perform out-of-the-box graph analysis with just a few lines of code. This significantly simplifies the learning curve for users new to graph data analytics.

Project Goals and Outputs:

1. Develop at least three builtin stored procedures in C++ using GraphScope Interactive's Stored Procedure C++ API, including shortest paths, k-nearest neighbor traversal from a specified node, and PageRank value calculation.
2. Integrate these built-in stored procedures with the GraphScope Interactive engine and demonstrate their application in data intelligence case studies through the Interactive frontend tools.
3. Produce comprehensive technical documentation and a demo showcase report to enable users to efficiently utilize graph techniques in various application scenarios.

[zhanglei1949]

项目名称：GraphScope Interactive 图查询引擎中的存储过程增强功能开发

描述：
GraphScope Interactive，作为GraphScope开源项目的重要组成部分，专注于解决复杂图数据的查询与分析问题，在实时数据智能领域承担关键任务，能够凭借实体间的关系网络实时锁定异常节点或挖掘由多个实体构成的异常模式，有力支撑了业务系统中风险控制与攻击防范的需求。传统图数据分析通常依赖业务人员显式编写如Gremlin和Cypher等图查询语句进行操作，但这无疑提高了用户的使用门槛；同时，受限于图查询的声明式特性，复杂操作逻辑（如带权最短路径计算）难以有效实施。

针对上述挑战，本项目借鉴数据库系统普遍采用的存储过程方法，旨在GraphScope Interactive图查询系统中引入并整合存储过程（Stored Procedure）支持。我们将通过预定义存储过程来封装复杂的图分析逻辑，使得用户仅需通过几行代码调用内置的存储过程，即可轻松实现开箱即用的图分析，大幅降低用户对图数据分析技术的入门难度。

项目目标及产出如下：

1. 利用GraphScope Interactive提供的Stored Procedure C++编程接口，采用C++语言开发至少包含三点间最短路径、指定节点出发的k度邻居遍历以及PageRank值计算在内的三个内置存储过程实现。
2. 完成上述内置存储过程与GraphScope Interactive引擎的集成，并借助Interactive的前端工具，实现在具体的数据智能案例分析中的应用演示。
3. 编撰详尽的技术文档及Demo展示报告，以便用户在更多应用场景中便捷高效地运用图技术。

[zhanglei1949]

项目难度：基础
技术要求：熟练使用C++编程语言

[github-actions]

/cc @yecol @sighingnow, this issus/pr has had no activity for a long time, please help to review the status and assign people to work on it.