Performance formula-based optimal deployments of multilevel indices for service retrieval.
|Authors||Wu, Yan, Xu, Wei, Liu, Lu and Miao, Dejun|
There are many different index structures for service repositories, such as sequential index, inverted index, and multilevel indices that include three deployments. Different service sets maybe have different characteristics that may affect performance from different aspects. For a given service set, which index structure is the most optimal one? To address these issues, this paper analyses five indexing models and proposes expectation of traversed service count to estimate performance of service retrieval. Based on these expectation formulas, an optimal deployment method can be identified to maximize efficiency of service retrieval. Our experiments first validate correctness of the proposed formulas and then validate the effective of the optimal method.
|Keywords||Service composition; Service discovery; Service management; Service storage|
|Journal||Concurrency and Computation: Practice and Experience|
|Digital Object Identifier (DOI)||https://doi.org/10.1002/cpe.4265|
|Web address (URL)||http://hdl.handle.net/10545/622068|
|Publication dates||25 Aug 2017|
|Publication process dates|
|Deposited||22 Jan 2018, 15:27|
Archived with thanks to Concurrency and Computation: Practice and Experience
|Contributors||Jiangsu University, University of Derby, School of Computer Science and Telecommunication Engineering; Jiangsu University; Zhenjiang Jiangsu 212000 China, Computer Science and Telecommunication Engineering, School of Computer Science and Telecommunication Engineering; Jiangsu University; Zhenjiang Jiangsu 212000 China, University of Derby; Kedleston Road Derby DE22 1GB UK and Department of Computing and Mathematics; University of Derby; Kedleston Road Derby DE22 1GB UK|
File Access Level
1views this month
1downloads this month