本文關(guān)鍵詞： 多維數(shù)據(jù)索引 skip-webs UB樹 云索引 SUB-index　出處：《云南大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：云計算平臺作為一種新興的計算基礎(chǔ)設(shè)施還需要很多的后續(xù)工作,構(gòu)建云的基礎(chǔ)設(shè)施最重要的一步就是構(gòu)建具有良好擴展性的數(shù)據(jù)存儲系統(tǒng),并且這些數(shù)據(jù)存儲系統(tǒng)必須支持很大的工作量負載�，F(xiàn)有比較主流的云存儲系統(tǒng)主要包括Google的BigTable, Amazon的Dynamo等。而當(dāng)前大部分的云存儲系統(tǒng)中,多是采用DHT(分布式哈希表)方式來構(gòu)建數(shù)據(jù)索引,是一種純粹的Key-Value模型來組織數(shù)據(jù),通過主鍵高效的獲取數(shù)據(jù)。這類解決方案通常是采用特殊化處理后,基于語義的或者是局部性的映射機制來優(yōu)化查詢的性能,但在多維度查詢方面不是很理想。因此本文嘗試提出了一種新型的在云環(huán)境下的分布式多維數(shù)據(jù)索引結(jié)構(gòu)SUB-index(skip-webs UB-tree),為解決此類問題提出一些參考。 本文嘗試提出一種在云環(huán)境下多維數(shù)據(jù)索引結(jié)構(gòu)SUB-index。SUB-index采用UB樹這種結(jié)構(gòu)來作為多維數(shù)據(jù)索引的研究基礎(chǔ),嘗試用一種類似線性結(jié)構(gòu)skip-webs架構(gòu)來構(gòu)造分布式索引。這樣使得SUB-index不僅結(jié)合了skip-webs架構(gòu)中不需要進行平衡調(diào)整以代替平衡樹中復(fù)雜的調(diào)整的特性,而且利用UB樹考慮到存儲結(jié)構(gòu)和磁盤的結(jié)構(gòu)相對應(yīng)的優(yōu)勢。SUB-index為在云環(huán)境下的有效多維數(shù)據(jù)索引架構(gòu)提出了新的參考。本文還設(shè)計了SUB-index多維數(shù)據(jù)索引結(jié)構(gòu)的相關(guān)查詢算法,包括點查詢以及范圍查詢,還有插入和刪除的算法。論文最后還對所提出的分布式多維數(shù)據(jù)索引結(jié)構(gòu)SUB-index的點查詢、范圍查詢、插入更新和可靠性設(shè)計了相關(guān)的測試和進行了仿真實驗。從實驗結(jié)果可以看出,SUB-index索引結(jié)構(gòu)是高效的,并且在范圍查詢方面提供了良好的支持。
[Abstract]:Cloud computing platform as a new computing infrastructure needs a lot of follow-up work. The most important step to build cloud infrastructure is to build a data storage system with good scalability. And these data storage systems must support a lot of workload. The existing mainstream cloud storage system mainly includes Google BigTable. In most cloud storage systems, DHT (distributed hash table) is used to build the data index. Is a pure Key-Value model to organize data and get data efficiently through primary keys. This type of solution is typically treated with specialization. Semantic or local mapping mechanisms are used to optimize query performance. But it is not ideal for multi-dimensional query. Therefore, this paper attempts to propose a new distributed multidimensional data index structure SUB-index. in the cloud environment. Skip-webs UB-tree. Some references are put forward to solve this kind of problems. This paper attempts to propose a multi-dimensional data index structure SUB-index.SUB-index in the cloud environment using UB-tree structure as the research basis of multidimensional data index. This paper attempts to construct a distributed index using a linear structure like skip-webs architecture, which not only combines SUB-index with skip-webs architecture, but also does not require balancing adjustment. In place of the properties of complex adjustments in the balance tree. Moreover, using UB-tree to consider the advantages of storage structure and disk structure, the SUB-index provides a new reference for the efficient multidimensional data index architecture in cloud environment. This paper also designs SUB. Correlation query algorithm of index multidimensional data index structure. Including point query and range query, as well as the algorithm of insertion and deletion. Finally, the paper also proposed the distributed multidimensional data index structure SUB-index point query, scope query. Relevant tests and simulation experiments are designed for insert update and reliability. The experimental results show that the SUB-index index structure is efficient. And in the scope of query provides good support.
【學(xué)位授予單位】：云南大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：TP333

【參考文獻】

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

1 夏宇;朱欣焰;;高維空間數(shù)據(jù)索引技術(shù)研究[J];測繪科學(xué);2009年01期

2 史文中,郭薇,彭奕彰;一種面向地理信息系統(tǒng)的空間索引方法[J];測繪學(xué)報;2001年02期

3 陸鋒,周成虎;一種基于Hilbert排列碼的GIS空間索引方法[J];計算機輔助設(shè)計與圖形學(xué)學(xué)報;2001年05期

4 蔡浴泓;孫蕾;;基于R樹的空間數(shù)據(jù)索引技術(shù)的探索[J];計算機應(yīng)用與軟件;2008年12期

5 滕連澤;劉洪斌;武偉;;基于空間數(shù)據(jù)不同索引方法的比較[J];計算機與現(xiàn)代化;2006年01期

，

本文編號：1444534