binary storage tree

基本解釋

Data storage uses a binary sort tree, based on this will become a larger data structure.
數(shù)據(jù)的存儲(chǔ)用了一個(gè)二叉排序樹(shù)，在此基礎(chǔ)上還變成了一個(gè)更大的數(shù)據(jù)結(jié)構(gòu)…
nulung.com
A storage method of massive graphic data based on triangle binary tree partition mode was discussed, and a scheduling method of divided logical data module was also presented.
采用基于三角形二叉樹(shù)剖分方式的海量數(shù)據(jù)存儲(chǔ)方式，并通過(guò)劃分?jǐn)?shù)據(jù)邏輯粒度進(jìn)行海量數(shù)據(jù)高效調(diào)度的數(shù)據(jù)處理方法，使得圖形數(shù)據(jù)的處理效率得到顯著的提高。
In this paper, binary tree structure substitutes for linked list structure used in traditional IDS, aiming to better storage of rules and improve pattern matching so as to speed intrusion detection.
提出以二叉樹(shù)結(jié)構(gòu)取代原有入侵檢測(cè)系統(tǒng)采用的鏈表結(jié)構(gòu)，旨在改進(jìn)入侵規(guī)則的存儲(chǔ)和模式匹配，提高檢測(cè)速度。