2 February 2023 in ACM Computing Surveys
GraphQL is a query language and execution engine for web application programming interfaces (APIs) proposed as an alternative to improve data access problems and versioning of representational state transfer APIs. In this article, we thoroughly study the GraphQL field, first describing the GraphQL paradigm and its conceptual framework, and then conducting a systematic mapping study of 84 primary studies selected from an original set of 3,185. Our work analyzes trends or knowledge gaps about GraphQL by general classification of the studies and specific classification of this research topic. The study’s main conclusions show that GraphQL adoption is growing in the community as a strong alternative to implement APIs. However, we identified the need to strengthen the amount and rigor of empirical evidence collection in applied industry and government studies. In addition, we revealed the opportunity for specific studies on most GraphQL components, especially the consumption of GraphQL API services.
14 February 2022 in IEEE Transactions on Software Engineering
Automated test case generation for web APIs is a thriving research topic, where test cases are frequently derived from the API specification. However, this process is only partially automated since testers are usually obliged to manually set meaningful valid test inputs for each input parameter. In this article, we present ARTE, an approach for the automated extraction of realistic test data for web APIs from knowledge bases like DBpedia. Specifically, ARTE leverages the specification of the API parameters to automatically search for realistic test inputs using natural language processing, search-based, and knowledge extraction techniques. ARTE has been integrated into RESTest, an open-source testing framework for RESTful APIs, fully automating the test case generation process. Evaluation results on 140 operations from 48 real-world web APIs show that ARTE can efficiently generate realistic test inputs for 64.9% of the target parameters, outperforming the state-of-the-art approach SAIGEN (31.8%). More importantly, ARTE supported the generation of over twice as many valid API calls (57.3%) as random generation (20%) and SAIGEN (26%), leading to a higher failure detection capability and uncovering several real-world bugs. These results show the potential of ARTE for enhancing existing web API testing tools, achieving an unprecedented level of automation.
1 December 2012 in Journal of Web Semantics
Semantic Web Services discovery is commonly a heavyweight task, which has scalability issues when the number of services or the ontology complexity increase, because most approaches are based on Description Logics reasoning. As a higher number of services becomes available, there is a need for solutions that improve discovery performance. Our proposal tackles this scalability problem by adding a preprocessing stage based on two SPARQL queries that filter service repositories, discarding service descriptions that do not refer to any functionality or non-functional aspect requested by the user before the actual discovery takes place. This approach fairly reduces the search space for discovery mechanisms, consequently improving the overall performance of this task. Furthermore, this particular solution does not provide yet another discovery mechanism, but it is easily applicable to any of the existing ones, as our prototype evaluation shows. Moreover, proposed queries are automatically generated from service requests, transparently to the user. In order to validate our proposal, this article showcases an application to the OWL-S ontology, in addition to a comprehensive performance analysis that we carried out in order to test and compare the results obtained from proposed filters and current discovery approaches, discussing the benefits of our proposal
22 July 2016 in IEEE Transactions on Services Computing
Nowadays, service trading over the Web is gaining momentum. In this highly dynamic scenario, both providers and consumers need to formalize their contractual and legal relationship, creating service level agreements. Although there exist some proposals that provide models to describe that relationship, they usually only cover technical aspects, not providing explicit semantics to the agreement terms. Furthermore, these models cannot be effectively shared on the Web, since they do not actually follow Web principles. These drawbacks hamper take-up and automatic analysis. In this article, we introduce Linked USDL Agreement, a semantic model to specify, manage and share service level agreement descriptions on the Web. This model is part of the Linked USDL family of ontologies that can describe not only technical but also business related aspects of services, incorporating Web principles. We validate our proposal by describing agreements in computational and non-computational scenarios, namely cloud computing and business process outsourcing services. Moreover, we evaluate the actual coverage and expressiveness of Linked USDL Agreement comparing it with existing models. In order to foster its adoption and effectively manage the service level agreement lifecycle, we present an implemented tool that supports creation, automatic analysis, and publication on the Web of agreement descriptions.
1 September 2013 in Knowledge-Based Systems
Service ranking has been long-acknowledged to play a fundamental role in helping users to select the best o erings among services retrieved from a search request. There exist many ranking mechanisms, each one providing ad hoc preference models that o er di erent levels of expressiveness. Consequently, applying a single mechanism to a particular scenario constrains the user to de ne preferences based on that mechanism's facilities. Furthermore, a more exible solution that uses several independent mechanisms will face interoperability issues because of the di erences between preference models provided by each ranking mechanism. In order to overcome these issues, we propose a Preference- based Universal Ranking Integration (PURI) framework that enables the combination of several ranking mechanisms using a common, holistic preference model. Using PURI, di erent ranking mechanisms are seamlessly and transparently integrated, o ering a single fa cade to de ne preferences using highly expressive facilities that are not only decoupled from the concrete mechanisms that perform the ranking process, but also allow to exploit synergies from the combination of integrated mechanisms. We also thoroughly present a particular application scenario in the SOA4All EU project and evaluate the bene ts and applicability of PURI in further domains