An algorithm of estimation pattern tree number in probabilistic XML data tree

• Published in: 2010 International Conference on Electronics and Information Engineering Vol. 1; pp. V1-507 - V1-510
• Main Authors: Jianwei Wang, Zhongxiao Hao
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.08.2010
• Subjects: absolute path vector; Artificial neural networks; Educational institutions; Estimation; Pattern matching; pattern tree; Probabilistic logic; probabilistic XML data tree; XML
• DOI: 10.1109/ICEIE.2010.5559685
• ISBN: 9781424476794; 1424476798

Because of decomposition is a kind of effective strategy for query, the number of pattern tree in the probabilistic XML data tree is the basis of decomposing it. The definitions of absolute path vector and absolute path vector set are given. On the basis of parsing all absolute path in the probabilistic XML data tree, the algorithm for estimating the pattern tree number based on the absolute path vector set is presented. The experiment results show that the number of different scale pattern tree can be right estimated. The number of some different scale pattern trees should be estimated through the algorithm before decomposing, and it provides the rule of choosing one of some different scale pattern tree to decompose the probabilistic XML data tree.