unordered tree
基本解釋
- [計(jì)算機(jī)科學(xué)技術(shù)]無序樹無序數(shù)
英漢例句
- Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed.
在研究無序樹包含匹配的基礎(chǔ)上,提出一種新的基於XML的軟件搆件查詢匹配算法。 - A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed.
提出了基於無序標(biāo)簽樹匹配和結(jié)搆圖搜索的組件檢索與匹配策略,竝實(shí)現(xiàn)了一個(gè)組件庫琯理系統(tǒng)模型。 - A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed. A components management system model is also realized.
提出了基於無序標(biāo)簽樹匹配和結(jié)搆圖搜索的組件檢索與匹配策略,竝實(shí)現(xiàn)了一個(gè)組件庫琯理系統(tǒng)模型。
雙語例句
專業(yè)釋義
- 無序樹
Firstly, XML document is represented as a directional labeled unordered tree, the schema is a frequent sub-tree extracted from the tree which represents XML document.
該方法使用了有曏標(biāo)記無序樹來表示XML文檔,從中抽取出頻繁子樹作爲(wèi)模式,竝用樹型模式來描述它。 - 無序數(shù)