A graph database-based approach utilizing FAHP and directed bipartite graph for service composition
| Autor: | Chun Wang, Guodong Fan, Jing Li, Ming Zhu, Lei Zhao |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Theoretical computer science
Graph database Relational database business.industry Computer science 020207 software engineering Cloud computing 02 engineering and technology Graphplan computer.software_genre Management Information Systems Task (project management) Hardware and Architecture 020204 information systems 0202 electrical engineering electronic engineering information engineering Bipartite graph business computer Dijkstra's algorithm Software Edge computing Information Systems |
| Zdroj: | Service Oriented Computing and Applications. 14:269-281 |
| ISSN: | 1863-2394 1863-2386 |
| DOI: | 10.1007/s11761-020-00298-7 |
| Popis: | Cloud computing has recently evolved into container technology and edge computing for conveniently hosting and delivering a set of services. There is a need to compose individual services to perform a complex task. However, finding an optimal solution of composition satisfying both functional and non-functional requirements is a challenging problem. To solve this problem, we propose a method using fuzzy analytical hierarchy process and an extended Dijkstra algorithm to find a solution in a directed bipartite graph stored in a Neo4j graph database. Unlike other database-based approaches that aim to optimize a pre-defined composition task, our approach is much flexible that can perform an arbitrary task once the services information is preprocessed in a database. We conduct experiments and compare the performance of the proposed approach with a Graphplan method and a relational database-based approach, and the results show that this approach leads to less query execution time and better user’s satisfaction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink