Description: Trie tree can be used for general dictionary english, can also be used to search the index. For a given a string a1, a2, a3 ,..., an. Is used TRIE tree english english after n times to complete a search. But they did not like B-tree search efficiency, B tree search algorithm complexity is logt (n+ 1/2). When t trend, and search efficiency becomes efficient. No wonder the DB2 access memory settings for the virtual memory size of a PAGE, and the frame switching frequency to reduce the need for frequent switching PAGE.
- [swish-efiles.1.3.2.tar] - C serach engine, contains many methods f
- [darts-0.2.tar] - array dictionary-generation procedures.
- [DisplayBTree] - focus on B-tree code insertion, deletion
- [B_Trees] - B tree code, and demonstrations, mainly
- [DHT] - DHT entry Introduction
- [datarepair] - To speak at length about the structure o
- [PCA] - This procedure is used PCA method for fa
- [biaodashi] - The program from the original four suffi
- [DS] - Containing a variety of classic data str
File list (Check if you may need any files):
Download