图数据库中有向二分图构建的服务组合
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP393

基金项目:

国家重点研发资助项目(2018YFB1402500);淄博市校城融合发展资助项目(2019ZBXC114)。


Service composition based on directed bipartite graph in graph database
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    云计算与大数据时代的到来促进了Web服务的发展。由于用户需求的复杂性,单个服务无法满足要求时,可将多个服务组合在一起提供解决方案。然而云中存在大量服务,查找合适的服务组合成为一个非确定性多项式(NP,non-deterministic polynomial)难问题。文章提出了一种利用图数据库解决组合问题的方法,通过构建基于有向二分图的服务组合图,对服务进行预组合并存储在Neo4j图数据库中,使用最少服务数组合查询和Dijkstra搜索算法来寻找服务数量最少或服务质量(QoS,quality of service)优化解。此外,能够根据服务的可用性对图数据库进行删除、添加、更新。实验结果表明,该方法能够在较短时间内在图数据库中寻找到满足用户需求的服务组合。

    Abstract:

    The advent of cloud computing and big data era has promoted the development of web services. Due to the complexity of user requirements, when a single service cannot meet the requirements, multiple services can be composed to provide solutions. As there are a lot of services in the cloud, it is non-deterministic polynomial hard to find a proper service composition. This paper proposes a method to solve the problem of composition by using the graph database. Through constructing a service composition graph based on a directed bipartite graph, services are pre-composed and stored in a Neo4j graph database,using the least service composition query and Dijkstra search algorithm to find the solution with the least number of services or the best quality of service. In addition, service compositions in the graph database can be added, deleted, and updated according to the availability of services. The experimental results show that the method can find the service composition that meets the user's needs in a short time in the graph database.

    参考文献
    相似文献
    引证文献
引用本文

范国栋,李静,祝铭,吴志勇,阎松.图数据库中有向二分图构建的服务组合[J].重庆大学学报,2020,43(7):19-29.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2019-11-26
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2020-07-18
  • 出版日期:
文章二维码