發(fā)布時(shí)間：2018-10-17 17:41

【摘要】：隨著電子商務(wù)和物流產(chǎn)業(yè)的迅猛發(fā)展,其存儲(chǔ)處理系統(tǒng)中的物流文件具有數(shù)據(jù)量大、數(shù)據(jù)更新頻繁等特點(diǎn),對(duì)物流文件如何快速地實(shí)現(xiàn)查找是物流系統(tǒng)迫切需要解決問(wèn)題之一。物流文件中含有大量的多維元數(shù)據(jù),現(xiàn)有的索引結(jié)構(gòu)因沒(méi)有充分利用其中元數(shù)據(jù),而不能更有效的滿足多維元數(shù)據(jù)復(fù)雜查詢的要求。為此,本論文主要研究?jī)?nèi)容如下:首先,在物流文件中,根據(jù)多維元數(shù)據(jù)索引結(jié)構(gòu)的需求,本文在R樹(shù)節(jié)點(diǎn)上放入布隆過(guò)濾器(Bloom Filter)提出一種多維元數(shù)據(jù)索引結(jié)構(gòu),稱為R樹(shù)布隆過(guò)濾器,簡(jiǎn)稱R-TBF(R-Tree and Bloom Filter)。物流文件中元數(shù)據(jù)更新頻次高,為了保證索引結(jié)構(gòu)的更新性能,本文接著提出R-TBF索引結(jié)構(gòu)的更新機(jī)制,它由基礎(chǔ)索引結(jié)構(gòu)和更新緩存結(jié)構(gòu)組成。最后用在物流文件中的多維元數(shù)據(jù)的查詢實(shí)例說(shuō)明我提出的索引結(jié)構(gòu)與更新機(jī)制。其次,為了能夠在物流信息存儲(chǔ)系統(tǒng)中快速的查找到物流文件,本文采用R-TBF索引結(jié)構(gòu),建立元數(shù)據(jù)立方體(metadata cube),設(shè)計(jì)了一種基于元數(shù)據(jù)立方體的R樹(shù)布隆過(guò)濾器的查詢機(jī)制,英文簡(jiǎn)稱R-TBFMC(Query Mechanism of R-Tree and Bloom Filter based Metadata Cube)。查詢機(jī)制設(shè)計(jì)了三個(gè)模塊:R-TBFMC主模塊,R-TBFMC查詢模塊以及R-TBFMC更新模塊。同時(shí)設(shè)計(jì)了兩種查詢方法,分別是范圍和值查詢法和范圍最大值查詢法。最后,進(jìn)行了多維元數(shù)據(jù)查詢機(jī)制的實(shí)現(xiàn)工作,實(shí)現(xiàn)了多維元數(shù)據(jù)查詢機(jī)制的三個(gè)模塊,以及兩種查詢算法——范圍和值查詢法和范圍最大值查詢法。并對(duì)提出的查詢機(jī)制(基于元數(shù)據(jù)立方體的R樹(shù)布隆過(guò)濾器的查詢機(jī)制)的性能進(jìn)行測(cè)試與分析來(lái)證實(shí)此查詢機(jī)制的高效性。
[Abstract]:With the rapid development of electronic commerce and logistics industry, the logistics files in the storage and processing system are characterized by large amount of data and frequent updating of data. How to find logistics files quickly is one of the urgent problems that need to be solved in logistics system. There are a lot of multidimensional metadata in the logistics file, and the existing index structure can not satisfy the requirement of complex query of multidimensional metadata because it does not make full use of the metadata. Therefore, the main contents of this paper are as follows: firstly, according to the requirement of multidimensional metadata index structure in logistics file, this paper puts a kind of multidimensional metadata index structure (Bloom Filter) into the R-tree node. Called R-Tree Bron filter, abbreviated as R-TBF (R-Tree and Bloom Filter).) In order to ensure the update performance of index structure, this paper proposes an update mechanism of R-TBF index structure, which consists of basic index structure and update cache structure. Finally, the index structure and update mechanism are illustrated by a query example of multidimensional metadata in the logistics file. Secondly, in order to find the logistics files quickly in the logistics information storage system, this paper adopts the R-TBF index structure, establishes the metadata cube (metadata cube), to design a query mechanism of R-tree Bron filter based on the metadata cube. Abbreviated R-TBFMC (Query Mechanism of R-Tree and Bloom Filter based Metadata Cube). The query mechanism includes three modules: R-TBFMC main module, R-TBFMC query module and R-TBFMC update module. At the same time, two query methods, range and value query and range maximum query, are designed. Finally, the implementation of multidimensional metadata query mechanism is carried out, and the three modules of multidimensional metadata query mechanism are implemented, as well as two query algorithms: range and value query and range maximum query. The performance of the proposed query mechanism (the query mechanism of R-tree Bron filter based on metadata cube) is tested and analyzed to verify the efficiency of the query mechanism.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP311.13

【相似文獻(xiàn)】

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

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

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

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

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

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

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

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

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

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

10 陳瀟;;SQL Server中索引的建立與分析[J];科技信息;2012年36期

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

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

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

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

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

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

6 張s，

本文編號(hào)：2277450