unordered tree
基本解釋
- [計(jì)算機(jī)科學(xué)技術(shù)]無(wú)序樹(shù)無(wú)序數(shù)
英漢例句
- Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed.
在研究無(wú)序樹(shù)包含匹配的基礎(chǔ)上,提出一種新的基于XML的軟件構(gòu)件查詢匹配算法。 - A kind of component matching model based on the unordered label tree-inclusion matching and Struct Graph (S-Graph) searching model is proposed.
提出了基于無(wú)序標(biāo)簽樹(shù)匹配和結(jié)構(gòu)圖搜索的組件檢索與匹配策略,并實(shí)現(xiàn)了一個(gè)組件庫(kù)管理系統(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.
提出了基于無(wú)序標(biāo)簽樹(shù)匹配和結(jié)構(gòu)圖搜索的組件檢索與匹配策略,并實(shí)現(xiàn)了一個(gè)組件庫(kù)管理系統(tǒng)模型。
雙語(yǔ)例句
專業(yè)釋義
- 無(wú)序樹(shù)
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)記無(wú)序樹(shù)來(lái)表示XML文檔,從中抽取出頻繁子樹(shù)作為模式,并用樹(shù)型模式來(lái)描述它。 - 無(wú)序數(shù)