电子测试
電子測試
전자측시
ELECTRONIC TEST
2012年
7期
15-18,23
,共5页
XML查询%父节点%最小子树根节点%用户需求
XML查詢%父節點%最小子樹根節點%用戶需求
XML사순%부절점%최소자수근절점%용호수구
XML query%father nodes%smallest and lowest root nodes%user's need
本文提出了基于父节点的XML查询优化算法,它主要利用关键词的顺序循环查找父节点,把查找出来的父节点集合求交集,所得的父节点交集集合中的元素即为最小子树根节点,最后根据所得出的最小子树根节点得到用户所需的最紧致片段。通过选取经典的INEX数据集算法进行测试。实验结果表明,与传统的XML查询优化算法相比,基于父节点的XML查询优化算法有较高的准确率,更能满足用户需求。
本文提齣瞭基于父節點的XML查詢優化算法,它主要利用關鍵詞的順序循環查找父節點,把查找齣來的父節點集閤求交集,所得的父節點交集集閤中的元素即為最小子樹根節點,最後根據所得齣的最小子樹根節點得到用戶所需的最緊緻片段。通過選取經典的INEX數據集算法進行測試。實驗結果錶明,與傳統的XML查詢優化算法相比,基于父節點的XML查詢優化算法有較高的準確率,更能滿足用戶需求。
본문제출료기우부절점적XML사순우화산법,타주요이용관건사적순서순배사조부절점,파사조출래적부절점집합구교집,소득적부절점교집집합중적원소즉위최소자수근절점,최후근거소득출적최소자수근절점득도용호소수적최긴치편단。통과선취경전적INEX수거집산법진행측시。실험결과표명,여전통적XML사순우화산법상비,기우부절점적XML사순우화산법유교고적준학솔,경능만족용호수구。
This paper puts forward the XML query optimization algorithm based on father nodes, which circles to find father nodes by the order ofkeywords, and then gets the intersection of father nodes. The elements in the intersection of father nodes are smallest and lowest root nodes. Finally, it gets the most compact segment needed by users according to the smallest and lowest root nodes of different levels.By choosing the classic data set （INEX）, the algorithm is tested. Contrasting to traditional query methods, the experimental results have proved that the XML query optimization algorithm based on father nodes has higher accuracy result and meets the user＇s need better
