本文關(guān)鍵詞：服務(wù)庫多級索引模型性能分析　出處：《江蘇大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： Web服務(wù) 服務(wù)組合 服務(wù)發(fā)現(xiàn) 服務(wù)存儲 服務(wù)管理

【摘要】：面向服務(wù)的計算(Service-Oriented Computing,SOC)為企業(yè)軟件集成和分布式系統(tǒng)提供了一種靈活的解決方案。面向服務(wù)的體系架構(gòu)(Service-Oriented Architecture,SOA)是面向服務(wù)計算的基礎(chǔ)設(shè)施,其基本的要素是Web服務(wù)。在最近幾年,Web服務(wù)的數(shù)量急劇增加,同時快速發(fā)展的云計算也促進了服務(wù)的發(fā)展,大量的服務(wù)匯集于以云平臺為中心的服務(wù)庫。服務(wù)發(fā)現(xiàn)和服務(wù)組合是當(dāng)前服務(wù)計算領(lǐng)域的兩個重要研究方向。因此,如何高效地管理一個大規(guī)模的服務(wù)庫并能有效促進服務(wù)發(fā)現(xiàn)和服務(wù)組合將是一個非常重要且具有挑戰(zhàn)性的問題。本文首先從服務(wù)的研究背景及意義入手,研究與介紹了服務(wù)發(fā)現(xiàn)和服務(wù)組合的研究現(xiàn)狀,然后在此基礎(chǔ)上進一步研究了服務(wù)索引結(jié)構(gòu),對倒排索引以及多級索引模型的三種部署模型進行了較為詳細的研究,具體的研究內(nèi)容包括:(1)目前大規(guī)模服務(wù)庫主要是以倒排索引的結(jié)構(gòu)進行存儲,雖然倒排索引可以在很大程度上縮小服務(wù)發(fā)現(xiàn)和組合的查找空間,但仍然存在大量的信息冗余,導(dǎo)致效率低下。針對倒排索引信息冗余問題,多級索引模型以及其三種部署模型的存儲結(jié)構(gòu)在最大程度上消除了信息冗余問題,并能有效促進服務(wù)發(fā)現(xiàn)和服務(wù)組合效率。但針對特定的服務(wù)庫,多級索引模型并沒有給出一個用來選取其效率最高的索引模型的有效標(biāo)準(zhǔn),針對這個問題,本文首先對不同索引模型結(jié)構(gòu)進行了性能分析,并根據(jù)服務(wù)庫以及服務(wù)的特點給出了期望函數(shù),作為服務(wù)庫選取高效服務(wù)索引模型的依據(jù)。然后給出了詳細的五種索引模型的期望函數(shù)的公式推導(dǎo)過程,并通過優(yōu)化部署方案分析了各個索引模型的特點以及其適用的服務(wù)庫的特點等。最后,實驗結(jié)果驗證了所提優(yōu)化部署方案以及期望函數(shù)的準(zhǔn)確性和可靠性。(2)針對多級索引模型中的鍵值優(yōu)化選擇算法進行了初步探討。首先,對多級索引模型中的鍵值選取原理進行了深入的分析與介紹,并通過多種簡單示例幫助理解。然后分析了鍵值選取中存在的問題。最后,通過實驗對比鍵值優(yōu)化與非優(yōu)化狀態(tài)下索引結(jié)構(gòu)的檢索性能,說明了鍵值在隨機選取情況下并沒有對索引結(jié)構(gòu)的檢索性能造成任何影響,證明了鍵值優(yōu)化選取中存在的問題,也證實了對鍵值優(yōu)化選擇問題的初步探討的正確性。
[Abstract]:Service-Oriented Computing. Service-Oriented Architecture provides a flexible solution for enterprise software integration and distributed systems. SOA) is the infrastructure of service-oriented computing, whose basic element is Web services. In recent years, the number of web services has increased dramatically, and the rapid development of cloud computing has also promoted the development of services. A large number of services are gathered in the cloud platform-centric service library. Service discovery and service composition are two important research directions in the field of service computing. How to efficiently manage a large-scale service library and effectively promote service discovery and service composition will be a very important and challenging issue. This paper starts with the research background and significance of service. This paper studies and introduces the research status of service discovery and service composition, and then further studies the service index structure. In this paper, three deployment models of inverted index and multilevel index model are studied in detail. The specific research contents include: 1) at present, the large scale service library is mainly stored in the structure of inverted index. Although inverted index can reduce the search space of service discovery and composition to a large extent, there is still a lot of information redundancy, which leads to inefficiency. Multi-level index model and its storage structure of three deployment models can eliminate the problem of information redundancy to the maximum extent, and can effectively promote the efficiency of service discovery and service composition. However, the storage structure of the multi-level index model and its three deployment models can effectively promote the efficiency of service discovery and service composition. The multilevel index model does not give an effective standard to select the most efficient index model. In order to solve this problem, this paper first analyzes the performance of different index models. According to the characteristics of the service library and the characteristics of the service, the expected function is given as the basis for the service library to select the efficient service index model. Then, the derivation process of the expectation function of the five index models is given in detail. And through the optimization of deployment scheme analysis of the characteristics of each index model and its applicable service library characteristics and so on. Finally. The experimental results verify the proposed optimal deployment scheme and the accuracy and reliability of the expected function. The selection principle of key and value in multilevel index model is deeply analyzed and introduced, and some simple examples are used to help us understand. Then, the problems in key value selection are analyzed. Finally. By comparing the retrieval performance of the index structure in the state of optimization and non-optimization, it is shown that the key value has no effect on the retrieval performance of the index structure in the case of random selection. The problems in the selection of key and value are proved, and the correctness of the preliminary discussion on the selection of key and value is also confirmed.
【學(xué)位授予單位】：江蘇大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP393.09

【相似文獻】

相關(guān)期刊論文 前10條

1 古毅;吳中福;魏麗;鐘將;馬金亮;;高維空間數(shù)據(jù)索引結(jié)構(gòu)分析研究[J];計算機科學(xué);2006年05期

2 陳紅艷;;淺談索引的使用[J];科技資訊;2007年16期

3 馮亞麗;丁良奎;劉永江;王興兆;;多格式海量數(shù)據(jù)統(tǒng)一存取的索引結(jié)構(gòu)[J];計算機應(yīng)用研究;2013年06期

4 黃恩祝;;索引系統(tǒng)結(jié)構(gòu)的三個重要規(guī)律[J];圖書館學(xué)通訊;1988年01期

5 楊燁;;SQL Server索引性能分析[J];武漢船舶職業(yè)技術(shù)學(xué)院學(xué)報;2008年02期

6 劉鳳晨;黃河;劉慶文;丁永生;;隨機跳躍索引:一種支持隨機插入的可信賴索引[J];計算機學(xué)報;2009年05期

7 田宏武;王成;喬曉軍;;一種基于索引結(jié)構(gòu)的多語言界面實現(xiàn)方法[J];微計算機信息;2010年05期

8 羅彬;基于MS SQL Server的索引研究與應(yīng)用[J];大連民族學(xué)院學(xué)報;2001年03期

9 祝曉坤,賈永紅;基于多層索引結(jié)構(gòu)的聯(lián)合熵算法研究[J];測繪信息與工程;2005年05期

10 章德斌;曹麗君;梁永欣;張忠平;;支持k近鄰查詢的X*樹索引結(jié)構(gòu)[J];計算機工程與應(yīng)用;2011年05期

相關(guān)會議論文 前10條

1 汪衛(wèi);王勇;王宇君;施伯樂;;一維動態(tài)區(qū)間索引結(jié)構(gòu)[A];數(shù)據(jù)庫研究進展97——第十四屆全國數(shù)據(jù)庫學(xué)術(shù)會議論文集（上）[C];1997年

2 曹奎;馮玉才;袁芳;;一種支持基于內(nèi)容的圖像檢索的多維索引結(jié)構(gòu)[A];第十八屆全國數(shù)據(jù)庫學(xué)術(shù)會議論文集（研究報告篇）[C];2001年

3 劉顯敏;李建中;王宏志;劉雨洋;駱吉洲;;SAJ:以最小化空間代價為目標(biāo)的F&B索引構(gòu)建算法[A];第二十三屆中國數(shù)據(jù)庫學(xué)術(shù)會議論文集（研究報告篇）[C];2006年

4 肖偉器;馮玉才;;數(shù)據(jù)庫索引結(jié)構(gòu)的測試技術(shù)[A];第十一屆全國數(shù)據(jù)庫學(xué)術(shù)會議論文集[C];1993年

5 謝閩峰;汪衛(wèi);施伯樂;;集合索引結(jié)構(gòu)及其聯(lián)接操作[A];第二十屆全國數(shù)據(jù)庫學(xué)術(shù)會議論文集（技術(shù)報告篇）[C];2003年

6 張s，

本文編號：1436699