Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
The least-used key selection method for information retrieval in large-scale Cloud-based service repositories
by
Yuan, Bo
, Anjum, Ashiq
, Wu, Yan
, Panneerselvam, John
, Lu, Yao
, Gu, Jiayan
, Liu, Lu
in
Cloud computing
/ Efficiency
/ Indexing
/ Information retrieval
/ Internet of Things
/ Internet service providers
/ Mathematical models
/ Methods
/ Ontology
/ Open access publishing
/ Parameters
/ Probability
/ Repositories
/ User needs
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The least-used key selection method for information retrieval in large-scale Cloud-based service repositories
by
Yuan, Bo
, Anjum, Ashiq
, Wu, Yan
, Panneerselvam, John
, Lu, Yao
, Gu, Jiayan
, Liu, Lu
in
Cloud computing
/ Efficiency
/ Indexing
/ Information retrieval
/ Internet of Things
/ Internet service providers
/ Mathematical models
/ Methods
/ Ontology
/ Open access publishing
/ Parameters
/ Probability
/ Repositories
/ User needs
2022
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
The least-used key selection method for information retrieval in large-scale Cloud-based service repositories
by
Yuan, Bo
, Anjum, Ashiq
, Wu, Yan
, Panneerselvam, John
, Lu, Yao
, Gu, Jiayan
, Liu, Lu
in
Cloud computing
/ Efficiency
/ Indexing
/ Information retrieval
/ Internet of Things
/ Internet service providers
/ Mathematical models
/ Methods
/ Ontology
/ Open access publishing
/ Parameters
/ Probability
/ Repositories
/ User needs
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
The least-used key selection method for information retrieval in large-scale Cloud-based service repositories
Journal Article
The least-used key selection method for information retrieval in large-scale Cloud-based service repositories
2022
Request Book From Autostore
and Choose the Collection Method
Overview
As the number of devices connected to the Internet of Things (IoT) increases significantly, it leads to an exponential growth in the number of services that need to be processed and stored in the large-scale Cloud-based service repositories. An efficient service indexing model is critical for service retrieval and management of large-scale Cloud-based service repositories. The multilevel index model is the state-of-art service indexing model in recent years to improve service discovery and combination. This paper aims to optimize the model to consider the impact of unequal appearing probability of service retrieval request parameters and service input parameters on service retrieval and service addition operations. The least-used key selection method has been proposed to narrow the search scope of service retrieval and reduce its time. The experimental results show that the proposed least-used key selection method improves the service retrieval efficiency significantly compared with the designated key selection method in the case of the unequal appearing probability of parameters in service retrieval requests under three indexing models.
Publisher
Springer Nature B.V
MBRLCatalogueRelatedBooks
Related Items
Related Items
We currently cannot retrieve any items related to this title. Kindly check back at a later time.
This website uses cookies to ensure you get the best experience on our website.