memory tree 中文意思是什麼

memory tree 解釋
記憶樹
  • memory : n. 1. 記憶；記憶力；【自動化】存儲器；信息存儲方式；存儲量。2. 回憶。3. 紀念。4. 死後的名聲，遺芳。5. 追想得起的年限[范圍]。
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Let ' s plant a cherry tree in memory of our graduation

    我們種棵櫻桃樹作為畢業紀念吧。
  2. In the first place, the paper briefly discusses issues related to the main index mechanisms in spatial and temporal, studies the access methods of spatio - temporal databases which has been presented. furthermore, the paper explains the storage mechanisms in stadbs ( spatio - temporal analysis database system ) and presents a hr - tree index structure based on main memory to realize the index mechanism of stadbs, it ' s main technologies were discussed in detail. lastly, a visual demo of hr - tree based on main memory was introduced in this paper

    本文在分析討論了主要的空間和時間索引技術的基礎上，研究、分析了時空數據的存取方法，對已提出的時空索引技術進行了分類、比較；根據時空分析數據庫stadbs存儲機制的特點，採用基於主存的hr -樹作為stadbs時空數據的索引結構，設計與實現了stadbs的時空存取方法，論文對stadbs時空索引機制的設計與實現作了較詳細的介紹，同時闡述了基於主存的hr -樹可視化演示程序的主要實現方法。
  3. The in - memory data structure had a sort of tree structure, as shown in listing 1, rooted at the home pages of the various sites being crawled, so the visitor pattern was ideal for searching it or extracting data from it

    內存中的數據結構是一種樹型結構，如清單1所示，它的根是快速搜索過的各個網站的主頁，因此visitor模式是搜索這些主頁或者從中提取數據的理想模式。
  4. All at once, instantly in close connection, there rose up the memory of the look platon had fixed upon him, as he sat under the tree, of the shot heard at that spot, of the dogs howl, of the guilty faces of the soldiers as they ran by, of the smoking gun, of karataevs absence at that halting - place ; and he was on the point of fully realising that karataev had been killed, but at the same instant, at some mysterious summons, there rose up the memory of a summer evening he had spent with a beautiful polish lady on the verandah of his house at kiev

    突然間，如煙往事在腦際涌現出來：有普拉東坐在樹下投來的目光，有那個地方傳來的槍聲，狗的叫聲，兩個法國人從他身旁跑過去時帶有犯罪的面部表情，那支還在冒煙的槍，想起在這個宿營地永遠也見不著的卡拉塔耶夫，他正要弄清楚卡拉塔耶夫是否已被打死，但是，就在這一剎那，他也不知道為什麼，他忽然想起他和一個美麗的波蘭姑娘在他在基輔的住宅陽臺上度過的那個夏夜。
  5. This article, according to the common digital keyboard on the mobile communication equipment, make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard. using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information. chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space

    本文就根據移動通信設備上常見的數字鍵盤，為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究；並使用了一種在查找時空間復雜度為o （ n ） 、時間復雜度為o （ n ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。
  6. Legend has it that when the monk huineng passed by zhaoqing on his way back home in his later years, he stopped on a hill and planted a plum tree. in memory of this, the plum nunnery was built in the song dynasty ( 996 )

    梅庵相傳是禪宗六祖慧能，晚年重返家鄉時，路經肇慶，在停留的小山崗上插上梅花，宋朝至道二年（九九六年） ，智遠和尚為紀此事，興建梅庵。
  7. The traditional methods on extracting content are representing the web page with the data structure of trees in the main memory. unfortunately, the space and time complexity is relatively high when building and searching the tree

    傳統的方法是將網頁結構表示成樹，但建樹與查找樹的過程中，空間與時間復雜度都過高。
  8. A number of tree - walking optimizations are built into this macro, giving you linear - o in big - o notation - efficiencies in processing a given sxml structure ; a naive approach could easily use more memory or cpu time. see resources

    這個宏對樹遍歷進行了一些優化，可以以線性效率用大o表示法為o （ n ）處理給定的sxml結構，普通的方法很容易會佔用更多的內存和cpu時間。
  9. In the thesis, compatible data storage fashion and data structure for a large - scale 3d scene is discussed firstly. then the process technique for dem, spatial object geometry data, texture image data and scene metadata are discussed in turn. finally, a new nested index, scene pyramid + sub scene regular dividing quad - tree is brought forward, which consumes less memory and reduces the complexity of spatial data query

    本文首先確定了適用於大規模三維場景可視化的數據結構和存儲方式；然後分別針對dem數據、地物模型數據、紋理影像數據及場景元數據論述了分割與lod處理的方法；最後給出場景金字塔與子場景規則分割四叉樹兩套索引的建立以及具體應用策略，該索引機制減少了內存消耗，降低了數據查找的復雜性。
  10. Suffix tree is a good index structure for smaller sequences, but it not suit large sequences, due to the so - called “ memory bottleneck ”. the suffix array is the closest competing structure, as it needs less space than a suffix tree. however, it is not convenient for searching

    對于較小的序列來說，后綴樹索引無疑是一種很好的解決辦法，但由於它產生了「內存瓶頸」 ，不適合大的序列;后綴數組是另一種最具有競爭力的索引結構，與后綴樹相比，它需更少的存儲空間，但在數據搜索方面卻效率較低;基於q - gram和q - sample的索引方法雖然能用於快速搜索，但是不能用於搜索相似度低的數據。
  11. I begin the process with the creation of an in - memory tree for the new author table see listing 2

    首先為新的作者表創建一個內存樹（參見清單2 ） 。
  12. The dom is an in - memory cache tree representation of an xml document

    Dom是xml文檔的內存中緩存樹表示形式。
  13. If you want an in - memory tree representation of an xml document, dom is already available to do just this

    如果您想要採用xml文檔的內存中樹狀表示，那麼可以用dom來實現。
  14. The dom is an in - memory cache tree representation of an xml document and enables the navigation and editing of this document

    Dom是xml文檔的內存中（緩存）樹狀表示形式，允許對該文檔的導航和編輯。
  15. This is done in order to release the memory allocated to contain the internal xml tree representation that was created during the parse phase

    這樣做是為了釋放已分配的內存，以包含在分析階段創建的內部xml樹表示形式。
  16. Csa - tree : an optimized high - dimensional index tree for main memory access

    一種改進的高維主存索引樹
  17. Create another in - memory tree

    創建另一個內存樹
  18. The algorithm of sf _ dt, which bases on the idea of decision tree classification algorithm ids, use the means of file splitting take the place of the means which bases on memory. it improves the scalability of classification algorithm and can deal with very large database

    Sf _ dt演算法以決策樹分類演算法id3的基本思想為基礎，用基於文件分割的方法代替原有的基於內存的演算法，提高了演算法的可規模性，可以處理超大規模的數據。
  19. Table, graph, and tree data structures supporting arbitrary data attributes, data indexing, and selection queries, all with an efficient memory footprint

    支持由表，圖，樹組成的數據結構，欄位的數據索引和選擇列的查詢，並且高效的利用內存。
  20. Secondly, when processing branching queries, compared with the join method, the amount of nodes that need to be traversed in the xml data tree here could be reduced to a great extent, what is more, it would not need to store intermediate results to obtain the final result, which makes it engrosses little memory

    第二、對于分支查詢的處理，相比于join的方法，所需遍歷的節點數量得到很大程度的降低，並且無須保存中間結果即可得到最終結果集，內存開銷極小，使得分支查詢的處理效率明顯提高。
分享友人
分享到 Line

分享到臉書