Semantics-based API discovery, matching and composition with linked metadata

Web APIs have been adopted as the de facto standard for exchanging data on the Web. However, engineering applications that orchestrate the invocation of multiple APIs and the data flow among them are still mostly manual and labor intensive. In fact, as the number of the potentially relevant APIs inc...

Full description

Saved in:
Bibliographic Details
Published in:Service oriented computing and applications Vol. 14; no. 4; pp. 283 - 296
Main Authors: Serrano, Diego, Stroulia, Eleni
Format: Journal Article
Language:English
Published: London Springer London 01.12.2020
Springer Nature B.V
Subjects:
Application programming interface
Composition
Computer Appl. in Administrative Data Processing
Computer Science
Computer Systems Organization and Communication Networks
e-Commerce/e-business
Graph theory
Isomorphism
IT in Business
Iterative methods
Management of Computing and Information Systems
Metadata
Original Research Paper
Semantics
Software Engineering/Programming and Operating Systems
SPARQL
REST
Semantic Web services
Linked data
RDF
SWAGGER
Automatic service composition
ISSN:1863-2386, 1863-2394
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Web APIs have been adopted as the de facto standard for exchanging data on the Web. However, engineering applications that orchestrate the invocation of multiple APIs and the data flow among them are still mostly manual and labor intensive. In fact, as the number of the potentially relevant APIs increases, compositions become opaque, difficult to maintain, and practically impossible to reuse. The recent advances around linked data formalisms have the potential to provide “usable” semantics, to enable automatic API composition methods. In this paper, we formalize a simplified description model, based on SPARQL graph patterns, for capturing the semantics of Web APIs. Based on this model, we propose a methodology for a fully automated process that produces semantically valid composition chains, using iterative subgraph isomorphism. We have validated the usefulness and accuracy of our approach, using a collection of publicly available Web APIs relevant to a real-world use cases.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1863-2386
1863-2394
DOI:10.1007/s11761-020-00301-1