摘要
谓词处理问题一直是XPath查询研究的重点问题。本文首先讨论了自动机技术用于XPath查询的主要思想,而后提出了一种基于交错自动机(AFA)的XPath处理模型XBA,XBA采用逆向分析的方法构造AFA的转移函数,试验结果表明XBA可以提高XPath表达式中谓词处理的效率。
Predicate process is the fundamental problem of XPath queries. This paper first discuss the main idea of the automata theory for XPath queries, then propose an new model on AFA for evaluate XPaths with predicates：XBA. In XBA, a converse analyse method is used to construct transition function , Experimental results show that XBA can improve the efficiency of evaluate XPaths with predicates.
出处
《微计算机信息》
北大核心
2008年第15期229-230,共2页
Control & Automation
基金
河南省教委自然科学基金(2006520014)
关键词
XPATH
交错自动机
谓词处理
Xpath
alternating finite automata
predicate process
