Method of Implementing B++ Tree Search on a Parallel Using Virtual Tree Structure

CHUR > College Computer Science and Informatics > Department of Bioinformatics > Patents > Item 987654321/39414

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/39414

Title:	Method of Implementing B++ Tree Search on a Parallel Using Virtual Tree Structure
Authors:	許文龍 Shu, Wen-Lung
Contributors:	生物資訊學系 Bioinformatics
Keywords:	平行硬體搜查器;演算法;人工智慧 Parallel Hardware Searcher;Algorithm;AI
Date:	2009
Issue Date:	2014-07-07 14:47:27 (UTC+8)
Abstract:	現今個人電腦技術發展迅速，雙核心處理器在市場上逐漸普及，很明顯叢集分散的電腦結構將是未來的驅勢。B++搜尋樹演算法在資料庫領域是最被廣泛使用的搜尋技術，尤其在資料庫、網路、人工智慧產業存在一個強大需求，需要超強的搜尋功能去處理超大量的資料。因應這個需求，一個虛擬樹平行搜尋演算法被發明出來，此演算法能夠執行B++樹狀搜尋，在平行的系統環境，如：電腦叢集或cubic system。在這個演算法，m個處理器中有一個必須休息，m值增大值系統效能幾乎相同，然而每一個處理器，僅需處理位在自己記憶體的資料 Since earlier computer developing stage, many researchers had been devoted to study different search methods. Today, these methods are quite mutual. Some researchers proposed several parallel search methods. But their results are dissatisfactory. Because,
Appears in Collections:	[Department of Bioinformatics] Patents

Files in This Item:

File	Description	Size	Format
MethodofImplementingB++TreeSearchonaParallelUsingVirtualTreeStructure.pdf		26Kb	Adobe PDF	543	View/Open