Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

A Database-Driven Algorithm for Building Top-k Service-Based Systems

Dandan Peng, Le Sun*

Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology (CICAEET), Nanjing University of Information Science & Technology, Nanjing, 210044, China

* Corresponding Author: Le Sun. Email: email

Journal of Quantum Computing 2020, 2(4), 171-179. https://doi.org/10.32604/jqc.2020.015402

Abstract

The purpose of this work aims is to automatically build top-k (the number of suggested results) light weight service based systems (LitSBSs) on the basis of user-given keywords. Compared with our previous work, we use a score (oscore) to evaluate the keyword matching degree and QoS performance of a service so that we could find top-k LitSBSs with both high keyword matching degree and great QoS performance at the same time. In addition, to guarantee the quality of found top-k LitSBSs and improve the time efficiency, we redesign the database-driven algorithm (LitDB). We add the step of referential services selecting into the process of the LitDB, which could prioritize services with high quality (high keyword matching degree and great QoS performance). We design comprehensive experiments to demonstrate the great time performance of LitDB.

Keywords


Cite This Article

D. Peng and L. Sun, "A database-driven algorithm for building top-k service-based systems," Journal of Quantum Computing, vol. 2, no.4, pp. 171–179, 2020.



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1283

    View

  • 987

    Download

  • 0

    Like

Share Link