B-TREE文件索引源代碼,快速,高效的數(shù)據(jù)文件索引程序.
標(biāo)簽： B-TREE 索引 源代碼 數(shù)據(jù)文件
上傳時間： 2013-12-29
上傳用戶：nanfeicui
Deleting a node of RB-Tree without recurrence
標(biāo)簽： recurrence Deleting RB-Tree without
上傳時間： 2015-05-05
上傳用戶：yuzsu
基于內(nèi)容的多媒體數(shù)據(jù)庫檢索算法： 用于最近鄰搜索的R*-tree算法
標(biāo)簽： tree 算法 多媒體 數(shù)據(jù)庫檢索
上傳時間： 2015-05-18
上傳用戶：13517191407
基于內(nèi)容的多媒體數(shù)據(jù)檢索算法SR-Tree，類似于R*-tree和SS-tree的最近鄰搜索
標(biāo)簽： SR-Tree 多媒體數(shù)據(jù) 檢索 算法
上傳時間： 2015-05-18
上傳用戶：縹緲
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標(biāo)簽： available libraries Although nearly
上傳時間： 2014-01-22
上傳用戶：zhoujunzhen
with this program you can search your whole driver and list all files in a tree view box.
標(biāo)簽： program driver search files
上傳時間： 2013-12-16
上傳用戶：源弋弋
pat-tree中文抽詞,中文字詞搜尋演算法.
上傳時間： 2013-12-06
上傳用戶：hakim
A bi-directional bubble sort demonstration algorithm * SortAlgorithm.java
標(biāo)簽： bi-directional SortAlgorithm demonstration algorithm
上傳時間： 2015-06-10
上傳用戶：tonyshao
此程序用到了,ADO連接ACCESS數(shù)據(jù)庫,切分窗口,以及不同視圖之間進(jìn)行通信.List Control和Tree Control,用戶UI線程等技術(shù).
標(biāo)簽： Control ACCESS List Tree
上傳時間： 2015-06-22
上傳用戶：tb_6877751
Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the well known wavelet transform of the given matrix. Daubechies wavelet coefficients are used for wavelet transform operation wahich is saved in wavcoeff.mat.
標(biāo)簽： implements the wav Included
上傳時間： 2015-06-23
上傳用戶：愛死愛死
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
